/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:22:51,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:22:51,346 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-SemanticLbe.epf [2023-11-17 11:22:51,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:22:51,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:22:51,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:22:51,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:22:51,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:22:51,373 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:22:51,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:22:51,373 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:22:51,373 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:22:51,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:22:51,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:22:51,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:22:51,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:22:51,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:22:51,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:22:51,375 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:22:51,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:22:51,375 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:22:51,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:22:51,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:22:51,385 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:22:51,385 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:22:51,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:22:51,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:22:51,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:22:51,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:22:51,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:22:51,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:22:51,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:22:51,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:22:51,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:22:51,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:22:51,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:22:51,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:22:51,540 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:22:51,540 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2023-11-17 11:22:52,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:22:52,910 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:22:52,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i [2023-11-17 11:22:52,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915a11f2c/5c5e941030d948ee873083bb9a5594aa/FLAGde562a7a7 [2023-11-17 11:22:52,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/915a11f2c/5c5e941030d948ee873083bb9a5594aa [2023-11-17 11:22:52,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:22:52,947 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:22:52,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:22:52,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:22:52,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:22:52,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:22:52" (1/1) ... [2023-11-17 11:22:52,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e0e1c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:52, skipping insertion in model container [2023-11-17 11:22:52,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:22:52" (1/1) ... [2023-11-17 11:22:53,010 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:22:53,128 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 11:22:53,235 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i[30633,30646] [2023-11-17 11:22:53,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:22:53,252 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:22:53,272 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-17 11:22:53,286 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/45_monabsex1_vs.i[30633,30646] [2023-11-17 11:22:53,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:22:53,311 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:22:53,312 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:22:53,312 WARN L675 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:22:53,317 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:22:53,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53 WrapperNode [2023-11-17 11:22:53,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:22:53,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:22:53,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:22:53,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:22:53,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,358 INFO L138 Inliner]: procedures = 171, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2023-11-17 11:22:53,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:22:53,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:22:53,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:22:53,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:22:53,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:22:53,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:22:53,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:22:53,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:22:53,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (1/1) ... [2023-11-17 11:22:53,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:22:53,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:22:53,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:22:53,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:22:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-17 11:22:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-17 11:22:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:22:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:22:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:22:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:22:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:22:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:22:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:22:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:22:53,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:22:53,467 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:22:53,585 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:22:53,587 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:22:53,683 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:22:53,782 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:22:53,783 INFO L307 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-17 11:22:53,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:22:53 BoogieIcfgContainer [2023-11-17 11:22:53,784 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:22:53,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:22:53,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:22:53,788 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:22:53,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:22:52" (1/3) ... [2023-11-17 11:22:53,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1707c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:22:53, skipping insertion in model container [2023-11-17 11:22:53,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:22:53" (2/3) ... [2023-11-17 11:22:53,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1707c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:22:53, skipping insertion in model container [2023-11-17 11:22:53,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:22:53" (3/3) ... [2023-11-17 11:22:53,790 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2023-11-17 11:22:53,806 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:22:53,807 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:22:53,807 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:22:53,827 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:22:53,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 12 transitions, 28 flow [2023-11-17 11:22:53,879 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-11-17 11:22:53,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:22:53,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 14 events. 1/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 18 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2023-11-17 11:22:53,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 14 places, 12 transitions, 28 flow [2023-11-17 11:22:53,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 14 places, 12 transitions, 28 flow [2023-11-17 11:22:53,887 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:22:53,896 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 14 places, 12 transitions, 28 flow [2023-11-17 11:22:53,898 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 14 places, 12 transitions, 28 flow [2023-11-17 11:22:53,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 14 places, 12 transitions, 28 flow [2023-11-17 11:22:53,903 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-11-17 11:22:53,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:22:53,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18 conditions, 14 events. 1/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 18 event pairs, 0 based on Foata normal form. 0/10 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2023-11-17 11:22:53,903 INFO L119 LiptonReduction]: Number of co-enabled transitions 48 [2023-11-17 11:22:54,121 INFO L134 LiptonReduction]: Checked pairs total: 54 [2023-11-17 11:22:54,121 INFO L136 LiptonReduction]: Total number of compositions: 7 [2023-11-17 11:22:54,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:22:54,140 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7171a4c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:22:54,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 11:22:54,143 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:22:54,143 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2023-11-17 11:22:54,143 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:22:54,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:54,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-17 11:22:54,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 11:22:54,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash 4123461, now seen corresponding path program 1 times [2023-11-17 11:22:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:54,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079882470] [2023-11-17 11:22:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:54,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:22:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079882470] [2023-11-17 11:22:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079882470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:22:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88355744] [2023-11-17 11:22:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:54,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 11:22:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 11:22:54,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 11:22:54,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2023-11-17 11:22:54,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 11 places, 8 transitions, 20 flow. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:54,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2023-11-17 11:22:54,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:54,404 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2023-11-17 11:22:54,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:22:54,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 11 events. 2/11 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 9 event pairs, 2 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 14. Up to 11 conditions per place. [2023-11-17 11:22:54,406 INFO L140 encePairwiseOnDemand]: 17/19 looper letters, 5 selfloop transitions, 0 changer transitions 0/6 dead transitions. [2023-11-17 11:22:54,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 10 places, 6 transitions, 26 flow [2023-11-17 11:22:54,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 11:22:54,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 11:22:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 11 transitions. [2023-11-17 11:22:54,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2894736842105263 [2023-11-17 11:22:54,418 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 11 transitions. [2023-11-17 11:22:54,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 11 transitions. [2023-11-17 11:22:54,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:54,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 11 transitions. [2023-11-17 11:22:54,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,426 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,428 INFO L175 Difference]: Start difference. First operand has 11 places, 8 transitions, 20 flow. Second operand 2 states and 11 transitions. [2023-11-17 11:22:54,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 10 places, 6 transitions, 26 flow [2023-11-17 11:22:54,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 10 places, 6 transitions, 26 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:22:54,433 INFO L231 Difference]: Finished difference. Result has 10 places, 6 transitions, 16 flow [2023-11-17 11:22:54,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=16, PETRI_DIFFERENCE_MINUEND_PLACES=9, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=16, PETRI_PLACES=10, PETRI_TRANSITIONS=6} [2023-11-17 11:22:54,444 INFO L281 CegarLoopForPetriNet]: 11 programPoint places, -1 predicate places. [2023-11-17 11:22:54,444 INFO L495 AbstractCegarLoop]: Abstraction has has 10 places, 6 transitions, 16 flow [2023-11-17 11:22:54,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:54,445 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-11-17 11:22:54,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:22:54,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-17 11:22:54,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash -332332415, now seen corresponding path program 1 times [2023-11-17 11:22:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110715141] [2023-11-17 11:22:54,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:54,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:22:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:54,528 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:22:54,528 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:22:54,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-17 11:22:54,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-11-17 11:22:54,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-11-17 11:22:54,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:22:54,532 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-17 11:22:54,535 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:22:54,535 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-17 11:22:54,571 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:22:54,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 48 flow [2023-11-17 11:22:54,576 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-11-17 11:22:54,576 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:22:54,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 17. Up to 3 conditions per place. [2023-11-17 11:22:54,577 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 19 transitions, 48 flow [2023-11-17 11:22:54,577 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 19 transitions, 48 flow [2023-11-17 11:22:54,577 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:22:54,578 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 19 transitions, 48 flow [2023-11-17 11:22:54,578 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 19 transitions, 48 flow [2023-11-17 11:22:54,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 19 transitions, 48 flow [2023-11-17 11:22:54,585 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-11-17 11:22:54,585 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:22:54,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 17. Up to 3 conditions per place. [2023-11-17 11:22:54,586 INFO L119 LiptonReduction]: Number of co-enabled transitions 180 [2023-11-17 11:22:54,769 INFO L134 LiptonReduction]: Checked pairs total: 494 [2023-11-17 11:22:54,770 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-11-17 11:22:54,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:22:54,777 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7171a4c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:22:54,777 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 11:22:54,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:22:54,782 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-17 11:22:54,782 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:22:54,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:54,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:22:54,783 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-17 11:22:54,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:54,783 INFO L85 PathProgramCache]: Analyzing trace with hash 152645257, now seen corresponding path program 1 times [2023-11-17 11:22:54,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:54,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192208087] [2023-11-17 11:22:54,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:22:54,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192208087] [2023-11-17 11:22:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192208087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:54,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:54,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14610422] [2023-11-17 11:22:54,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:54,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:54,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:54,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2023-11-17 11:22:54,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:54,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2023-11-17 11:22:54,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:54,946 INFO L124 PetriNetUnfolderBase]: 73/148 cut-off events. [2023-11-17 11:22:54,946 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-17 11:22:54,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 148 events. 73/148 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 529 event pairs, 30 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 258. Up to 75 conditions per place. [2023-11-17 11:22:54,949 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 15 selfloop transitions, 3 changer transitions 0/19 dead transitions. [2023-11-17 11:22:54,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 19 transitions, 89 flow [2023-11-17 11:22:54,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:54,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2023-11-17 11:22:54,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2023-11-17 11:22:54,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 26 transitions. [2023-11-17 11:22:54,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 26 transitions. [2023-11-17 11:22:54,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:54,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 26 transitions. [2023-11-17 11:22:54,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,954 INFO L175 Difference]: Start difference. First operand has 18 places, 14 transitions, 38 flow. Second operand 3 states and 26 transitions. [2023-11-17 11:22:54,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 19 transitions, 89 flow [2023-11-17 11:22:54,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 19 transitions, 89 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:22:54,956 INFO L231 Difference]: Finished difference. Result has 21 places, 14 transitions, 56 flow [2023-11-17 11:22:54,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=21, PETRI_TRANSITIONS=14} [2023-11-17 11:22:54,957 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2023-11-17 11:22:54,957 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 14 transitions, 56 flow [2023-11-17 11:22:54,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:54,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:54,957 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:54,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:22:54,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-17 11:22:54,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:54,959 INFO L85 PathProgramCache]: Analyzing trace with hash -934226704, now seen corresponding path program 1 times [2023-11-17 11:22:54,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:54,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878548603] [2023-11-17 11:22:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:54,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:54,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:55,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:22:55,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:55,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878548603] [2023-11-17 11:22:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878548603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:55,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028665809] [2023-11-17 11:22:55,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:55,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:55,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:55,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:55,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 28 [2023-11-17 11:22:55,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 14 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:55,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 28 [2023-11-17 11:22:55,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:55,074 INFO L124 PetriNetUnfolderBase]: 59/133 cut-off events. [2023-11-17 11:22:55,075 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-17 11:22:55,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 133 events. 59/133 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 487 event pairs, 31 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 151. Up to 67 conditions per place. [2023-11-17 11:22:55,076 INFO L140 encePairwiseOnDemand]: 24/28 looper letters, 14 selfloop transitions, 4 changer transitions 0/19 dead transitions. [2023-11-17 11:22:55,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 108 flow [2023-11-17 11:22:55,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:55,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2023-11-17 11:22:55,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2023-11-17 11:22:55,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 20 transitions. [2023-11-17 11:22:55,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 20 transitions. [2023-11-17 11:22:55,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:55,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 20 transitions. [2023-11-17 11:22:55,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,079 INFO L175 Difference]: Start difference. First operand has 21 places, 14 transitions, 56 flow. Second operand 3 states and 20 transitions. [2023-11-17 11:22:55,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 108 flow [2023-11-17 11:22:55,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:22:55,081 INFO L231 Difference]: Finished difference. Result has 23 places, 16 transitions, 78 flow [2023-11-17 11:22:55,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=23, PETRI_TRANSITIONS=16} [2023-11-17 11:22:55,081 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2023-11-17 11:22:55,082 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 78 flow [2023-11-17 11:22:55,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:55,082 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2023-11-17 11:22:55,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:22:55,082 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-11-17 11:22:55,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:55,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1103721073, now seen corresponding path program 1 times [2023-11-17 11:22:55,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:55,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000757345] [2023-11-17 11:22:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:55,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:55,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:22:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:55,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:22:55,129 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:22:55,129 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-11-17 11:22:55,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-11-17 11:22:55,129 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-11-17 11:22:55,130 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-11-17 11:22:55,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:22:55,130 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-17 11:22:55,130 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:22:55,130 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-17 11:22:55,151 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:22:55,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 70 flow [2023-11-17 11:22:55,166 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2023-11-17 11:22:55,166 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 11:22:55,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 3/34 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 31. Up to 4 conditions per place. [2023-11-17 11:22:55,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 26 transitions, 70 flow [2023-11-17 11:22:55,169 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 70 flow [2023-11-17 11:22:55,169 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:22:55,169 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 70 flow [2023-11-17 11:22:55,170 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 70 flow [2023-11-17 11:22:55,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 70 flow [2023-11-17 11:22:55,174 INFO L124 PetriNetUnfolderBase]: 3/34 cut-off events. [2023-11-17 11:22:55,175 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-17 11:22:55,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 34 events. 3/34 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 31. Up to 4 conditions per place. [2023-11-17 11:22:55,179 INFO L119 LiptonReduction]: Number of co-enabled transitions 396 [2023-11-17 11:22:55,393 INFO L134 LiptonReduction]: Checked pairs total: 471 [2023-11-17 11:22:55,393 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-11-17 11:22:55,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:22:55,395 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7171a4c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:22:55,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 11:22:55,397 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:22:55,397 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-17 11:22:55,397 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:22:55,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:55,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:22:55,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:22:55,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash 186052008, now seen corresponding path program 1 times [2023-11-17 11:22:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832431004] [2023-11-17 11:22:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:22:55,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:55,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832431004] [2023-11-17 11:22:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832431004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:55,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:55,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:55,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429873987] [2023-11-17 11:22:55,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:55,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:55,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:55,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:55,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:55,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2023-11-17 11:22:55,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:55,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2023-11-17 11:22:55,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:55,540 INFO L124 PetriNetUnfolderBase]: 601/964 cut-off events. [2023-11-17 11:22:55,540 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-11-17 11:22:55,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 964 events. 601/964 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4408 event pairs, 300 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 510. Up to 573 conditions per place. [2023-11-17 11:22:55,547 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 22 selfloop transitions, 4 changer transitions 0/27 dead transitions. [2023-11-17 11:22:55,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 27 transitions, 136 flow [2023-11-17 11:22:55,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-11-17 11:22:55,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2807017543859649 [2023-11-17 11:22:55,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 32 transitions. [2023-11-17 11:22:55,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 32 transitions. [2023-11-17 11:22:55,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:55,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 32 transitions. [2023-11-17 11:22:55,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,550 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 52 flow. Second operand 3 states and 32 transitions. [2023-11-17 11:22:55,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 27 transitions, 136 flow [2023-11-17 11:22:55,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 132 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-17 11:22:55,552 INFO L231 Difference]: Finished difference. Result has 27 places, 19 transitions, 78 flow [2023-11-17 11:22:55,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2023-11-17 11:22:55,553 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-11-17 11:22:55,553 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 78 flow [2023-11-17 11:22:55,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:55,554 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:55,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:22:55,554 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:22:55,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:55,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2139652470, now seen corresponding path program 1 times [2023-11-17 11:22:55,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:55,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970553953] [2023-11-17 11:22:55,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:55,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:22:55,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:55,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970553953] [2023-11-17 11:22:55,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970553953] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:55,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:55,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:55,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333739570] [2023-11-17 11:22:55,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:55,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:55,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:55,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:55,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:55,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2023-11-17 11:22:55,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:55,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2023-11-17 11:22:55,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:55,701 INFO L124 PetriNetUnfolderBase]: 710/1163 cut-off events. [2023-11-17 11:22:55,702 INFO L125 PetriNetUnfolderBase]: For 674/674 co-relation queries the response was YES. [2023-11-17 11:22:55,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3018 conditions, 1163 events. 710/1163 cut-off events. For 674/674 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5735 event pairs, 313 based on Foata normal form. 0/992 useless extension candidates. Maximal degree in co-relation 1423. Up to 682 conditions per place. [2023-11-17 11:22:55,709 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 24 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2023-11-17 11:22:55,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 185 flow [2023-11-17 11:22:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:55,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2023-11-17 11:22:55,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2543859649122807 [2023-11-17 11:22:55,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 29 transitions. [2023-11-17 11:22:55,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 29 transitions. [2023-11-17 11:22:55,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:55,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 29 transitions. [2023-11-17 11:22:55,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,713 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,713 INFO L175 Difference]: Start difference. First operand has 27 places, 19 transitions, 78 flow. Second operand 3 states and 29 transitions. [2023-11-17 11:22:55,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 185 flow [2023-11-17 11:22:55,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 171 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:22:55,719 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 118 flow [2023-11-17 11:22:55,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-11-17 11:22:55,720 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 5 predicate places. [2023-11-17 11:22:55,721 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 118 flow [2023-11-17 11:22:55,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:55,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:55,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:22:55,721 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:22:55,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:55,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1904949310, now seen corresponding path program 1 times [2023-11-17 11:22:55,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:55,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859801942] [2023-11-17 11:22:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:55,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:22:55,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:55,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859801942] [2023-11-17 11:22:55,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859801942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:55,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:55,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:22:55,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585691254] [2023-11-17 11:22:55,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:55,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:22:55,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:55,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:22:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:22:55,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2023-11-17 11:22:55,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:55,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2023-11-17 11:22:55,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:55,980 INFO L124 PetriNetUnfolderBase]: 580/963 cut-off events. [2023-11-17 11:22:55,980 INFO L125 PetriNetUnfolderBase]: For 820/820 co-relation queries the response was YES. [2023-11-17 11:22:55,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 963 events. 580/963 cut-off events. For 820/820 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4658 event pairs, 106 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 2808. Up to 810 conditions per place. [2023-11-17 11:22:55,988 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 30 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-11-17 11:22:55,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 230 flow [2023-11-17 11:22:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2023-11-17 11:22:55,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24561403508771928 [2023-11-17 11:22:55,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 28 transitions. [2023-11-17 11:22:55,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 28 transitions. [2023-11-17 11:22:55,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:55,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 28 transitions. [2023-11-17 11:22:55,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,992 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 118 flow. Second operand 3 states and 28 transitions. [2023-11-17 11:22:55,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 230 flow [2023-11-17 11:22:55,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 33 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:22:55,996 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 106 flow [2023-11-17 11:22:55,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-11-17 11:22:55,997 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2023-11-17 11:22:55,997 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 106 flow [2023-11-17 11:22:55,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:55,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:55,998 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:55,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:22:55,998 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:22:55,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1904717746, now seen corresponding path program 1 times [2023-11-17 11:22:55,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357254362] [2023-11-17 11:22:55,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:22:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:56,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357254362] [2023-11-17 11:22:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357254362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:22:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871440540] [2023-11-17 11:22:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:56,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:22:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:56,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:22:56,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:22:56,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2023-11-17 11:22:56,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:56,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2023-11-17 11:22:56,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:56,123 INFO L124 PetriNetUnfolderBase]: 471/797 cut-off events. [2023-11-17 11:22:56,123 INFO L125 PetriNetUnfolderBase]: For 580/580 co-relation queries the response was YES. [2023-11-17 11:22:56,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2315 conditions, 797 events. 471/797 cut-off events. For 580/580 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3731 event pairs, 85 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 1184. Up to 653 conditions per place. [2023-11-17 11:22:56,128 INFO L140 encePairwiseOnDemand]: 36/38 looper letters, 27 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-11-17 11:22:56,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 197 flow [2023-11-17 11:22:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2023-11-17 11:22:56,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21929824561403508 [2023-11-17 11:22:56,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 25 transitions. [2023-11-17 11:22:56,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 25 transitions. [2023-11-17 11:22:56,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:56,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 25 transitions. [2023-11-17 11:22:56,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,131 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 106 flow. Second operand 3 states and 25 transitions. [2023-11-17 11:22:56,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 197 flow [2023-11-17 11:22:56,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:22:56,133 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 104 flow [2023-11-17 11:22:56,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2023-11-17 11:22:56,134 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 4 predicate places. [2023-11-17 11:22:56,135 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 104 flow [2023-11-17 11:22:56,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:56,135 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:56,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:22:56,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:22:56,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:56,136 INFO L85 PathProgramCache]: Analyzing trace with hash 749933447, now seen corresponding path program 1 times [2023-11-17 11:22:56,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:56,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304820925] [2023-11-17 11:22:56,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:56,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 11:22:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304820925] [2023-11-17 11:22:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304820925] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:56,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:56,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849742484] [2023-11-17 11:22:56,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:56,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:56,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:56,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:56,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 38 [2023-11-17 11:22:56,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:56,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 38 [2023-11-17 11:22:56,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:56,261 INFO L124 PetriNetUnfolderBase]: 476/851 cut-off events. [2023-11-17 11:22:56,262 INFO L125 PetriNetUnfolderBase]: For 729/729 co-relation queries the response was YES. [2023-11-17 11:22:56,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 851 events. 476/851 cut-off events. For 729/729 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4296 event pairs, 240 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 1341. Up to 540 conditions per place. [2023-11-17 11:22:56,267 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 22 selfloop transitions, 9 changer transitions 0/32 dead transitions. [2023-11-17 11:22:56,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 32 transitions, 218 flow [2023-11-17 11:22:56,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2023-11-17 11:22:56,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21052631578947367 [2023-11-17 11:22:56,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 24 transitions. [2023-11-17 11:22:56,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 24 transitions. [2023-11-17 11:22:56,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:56,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 24 transitions. [2023-11-17 11:22:56,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,271 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,272 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 104 flow. Second operand 3 states and 24 transitions. [2023-11-17 11:22:56,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 32 transitions, 218 flow [2023-11-17 11:22:56,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:22:56,274 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 180 flow [2023-11-17 11:22:56,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-11-17 11:22:56,276 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2023-11-17 11:22:56,276 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 180 flow [2023-11-17 11:22:56,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:56,276 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2023-11-17 11:22:56,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:22:56,276 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-17 11:22:56,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:56,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1773075360, now seen corresponding path program 1 times [2023-11-17 11:22:56,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:56,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083483219] [2023-11-17 11:22:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:56,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:56,292 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:22:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:56,305 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:22:56,305 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:22:56,305 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-17 11:22:56,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 11:22:56,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-17 11:22:56,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-17 11:22:56,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 11:22:56,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:22:56,306 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-17 11:22:56,307 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:22:56,307 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-17 11:22:56,325 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:22:56,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 94 flow [2023-11-17 11:22:56,331 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2023-11-17 11:22:56,332 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:22:56,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 44 events. 4/44 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 5 conditions per place. [2023-11-17 11:22:56,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 94 flow [2023-11-17 11:22:56,333 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 94 flow [2023-11-17 11:22:56,333 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:22:56,334 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 33 transitions, 94 flow [2023-11-17 11:22:56,334 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 33 transitions, 94 flow [2023-11-17 11:22:56,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 94 flow [2023-11-17 11:22:56,337 INFO L124 PetriNetUnfolderBase]: 4/44 cut-off events. [2023-11-17 11:22:56,338 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:22:56,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 44 events. 4/44 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 5 conditions per place. [2023-11-17 11:22:56,338 INFO L119 LiptonReduction]: Number of co-enabled transitions 696 [2023-11-17 11:22:56,621 INFO L134 LiptonReduction]: Checked pairs total: 1704 [2023-11-17 11:22:56,621 INFO L136 LiptonReduction]: Total number of compositions: 17 [2023-11-17 11:22:56,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:22:56,623 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7171a4c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:22:56,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:22:56,624 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:22:56,624 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-11-17 11:22:56,624 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:22:56,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:56,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:22:56,624 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:22:56,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash 229001722, now seen corresponding path program 1 times [2023-11-17 11:22:56,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:56,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343603676] [2023-11-17 11:22:56,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:56,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:22:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343603676] [2023-11-17 11:22:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343603676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:56,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:56,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295859653] [2023-11-17 11:22:56,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:56,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:56,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:56,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:56,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:56,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2023-11-17 11:22:56,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:56,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:56,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2023-11-17 11:22:56,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:56,971 INFO L124 PetriNetUnfolderBase]: 3640/5197 cut-off events. [2023-11-17 11:22:56,971 INFO L125 PetriNetUnfolderBase]: For 1386/1386 co-relation queries the response was YES. [2023-11-17 11:22:56,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10899 conditions, 5197 events. 3640/5197 cut-off events. For 1386/1386 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 26111 event pairs, 1962 based on Foata normal form. 0/3928 useless extension candidates. Maximal degree in co-relation 2032. Up to 3318 conditions per place. [2023-11-17 11:22:56,999 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 29 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2023-11-17 11:22:56,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 35 transitions, 187 flow [2023-11-17 11:22:57,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:57,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2023-11-17 11:22:57,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28 [2023-11-17 11:22:57,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 42 transitions. [2023-11-17 11:22:57,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 42 transitions. [2023-11-17 11:22:57,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:57,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 42 transitions. [2023-11-17 11:22:57,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,002 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 72 flow. Second operand 3 states and 42 transitions. [2023-11-17 11:22:57,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 35 transitions, 187 flow [2023-11-17 11:22:57,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 35 transitions, 175 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-11-17 11:22:57,003 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 100 flow [2023-11-17 11:22:57,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-11-17 11:22:57,004 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-11-17 11:22:57,004 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 100 flow [2023-11-17 11:22:57,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:57,004 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:57,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:22:57,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:22:57,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1747735162, now seen corresponding path program 1 times [2023-11-17 11:22:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:57,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679286499] [2023-11-17 11:22:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:57,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:22:57,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:57,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679286499] [2023-11-17 11:22:57,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679286499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:57,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:57,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250045645] [2023-11-17 11:22:57,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:57,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:57,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:57,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2023-11-17 11:22:57,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:57,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2023-11-17 11:22:57,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:57,413 INFO L124 PetriNetUnfolderBase]: 4862/7021 cut-off events. [2023-11-17 11:22:57,414 INFO L125 PetriNetUnfolderBase]: For 4453/4453 co-relation queries the response was YES. [2023-11-17 11:22:57,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18054 conditions, 7021 events. 4862/7021 cut-off events. For 4453/4453 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 38383 event pairs, 2212 based on Foata normal form. 0/5734 useless extension candidates. Maximal degree in co-relation 8506. Up to 4510 conditions per place. [2023-11-17 11:22:57,465 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 32 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2023-11-17 11:22:57,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 248 flow [2023-11-17 11:22:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2023-11-17 11:22:57,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24666666666666667 [2023-11-17 11:22:57,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 37 transitions. [2023-11-17 11:22:57,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 37 transitions. [2023-11-17 11:22:57,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:57,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 37 transitions. [2023-11-17 11:22:57,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,470 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 100 flow. Second operand 3 states and 37 transitions. [2023-11-17 11:22:57,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 248 flow [2023-11-17 11:22:57,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:22:57,489 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 158 flow [2023-11-17 11:22:57,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-11-17 11:22:57,491 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-11-17 11:22:57,491 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 158 flow [2023-11-17 11:22:57,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:57,491 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:57,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:22:57,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:22:57,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:57,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1654519084, now seen corresponding path program 1 times [2023-11-17 11:22:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:57,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588227633] [2023-11-17 11:22:57,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:57,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:22:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:57,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588227633] [2023-11-17 11:22:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588227633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:57,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:22:57,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312512342] [2023-11-17 11:22:57,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:57,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:22:57,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:57,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:22:57,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:22:57,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2023-11-17 11:22:57,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:57,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2023-11-17 11:22:57,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:57,913 INFO L124 PetriNetUnfolderBase]: 3937/5694 cut-off events. [2023-11-17 11:22:57,914 INFO L125 PetriNetUnfolderBase]: For 5045/5045 co-relation queries the response was YES. [2023-11-17 11:22:57,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16871 conditions, 5694 events. 3937/5694 cut-off events. For 5045/5045 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 30506 event pairs, 754 based on Foata normal form. 0/4911 useless extension candidates. Maximal degree in co-relation 16788. Up to 4719 conditions per place. [2023-11-17 11:22:57,936 INFO L140 encePairwiseOnDemand]: 48/50 looper letters, 43 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-17 11:22:57,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 327 flow [2023-11-17 11:22:57,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:57,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2023-11-17 11:22:57,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24 [2023-11-17 11:22:57,937 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 36 transitions. [2023-11-17 11:22:57,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 36 transitions. [2023-11-17 11:22:57,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:57,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 36 transitions. [2023-11-17 11:22:57,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,938 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,938 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 158 flow. Second operand 3 states and 36 transitions. [2023-11-17 11:22:57,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 327 flow [2023-11-17 11:22:57,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 46 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:22:57,947 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 142 flow [2023-11-17 11:22:57,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-11-17 11:22:57,948 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-11-17 11:22:57,948 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 142 flow [2023-11-17 11:22:57,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:57,948 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:57,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:22:57,948 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:22:57,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:57,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1654784128, now seen corresponding path program 1 times [2023-11-17 11:22:57,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:57,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492388230] [2023-11-17 11:22:57,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:57,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:22:57,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:57,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492388230] [2023-11-17 11:22:57,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492388230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:57,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:57,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:22:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854790489] [2023-11-17 11:22:57,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:57,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:22:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:22:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:22:57,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2023-11-17 11:22:57,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:57,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:57,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2023-11-17 11:22:57,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:58,277 INFO L124 PetriNetUnfolderBase]: 3177/4646 cut-off events. [2023-11-17 11:22:58,277 INFO L125 PetriNetUnfolderBase]: For 3436/3436 co-relation queries the response was YES. [2023-11-17 11:22:58,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13335 conditions, 4646 events. 3177/4646 cut-off events. For 3436/3436 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 24213 event pairs, 541 based on Foata normal form. 0/3998 useless extension candidates. Maximal degree in co-relation 6671. Up to 3824 conditions per place. [2023-11-17 11:22:58,302 INFO L140 encePairwiseOnDemand]: 48/50 looper letters, 40 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-17 11:22:58,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 288 flow [2023-11-17 11:22:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2023-11-17 11:22:58,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22 [2023-11-17 11:22:58,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 33 transitions. [2023-11-17 11:22:58,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 33 transitions. [2023-11-17 11:22:58,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:58,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 33 transitions. [2023-11-17 11:22:58,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,305 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 142 flow. Second operand 3 states and 33 transitions. [2023-11-17 11:22:58,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 288 flow [2023-11-17 11:22:58,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:22:58,308 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 140 flow [2023-11-17 11:22:58,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2023-11-17 11:22:58,308 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-11-17 11:22:58,309 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 140 flow [2023-11-17 11:22:58,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:58,309 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:58,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:22:58,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:22:58,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:58,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1139453401, now seen corresponding path program 1 times [2023-11-17 11:22:58,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:58,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042028347] [2023-11-17 11:22:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:58,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 11:22:58,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:58,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042028347] [2023-11-17 11:22:58,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042028347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:58,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:58,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122436091] [2023-11-17 11:22:58,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:58,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:58,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:58,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:58,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2023-11-17 11:22:58,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:58,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2023-11-17 11:22:58,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:58,707 INFO L124 PetriNetUnfolderBase]: 3899/5834 cut-off events. [2023-11-17 11:22:58,707 INFO L125 PetriNetUnfolderBase]: For 5543/5543 co-relation queries the response was YES. [2023-11-17 11:22:58,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16865 conditions, 5834 events. 3899/5834 cut-off events. For 5543/5543 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 32853 event pairs, 1656 based on Foata normal form. 0/5120 useless extension candidates. Maximal degree in co-relation 9852. Up to 3861 conditions per place. [2023-11-17 11:22:58,729 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 32 selfloop transitions, 13 changer transitions 0/46 dead transitions. [2023-11-17 11:22:58,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 317 flow [2023-11-17 11:22:58,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:58,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2023-11-17 11:22:58,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21333333333333335 [2023-11-17 11:22:58,730 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 32 transitions. [2023-11-17 11:22:58,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 32 transitions. [2023-11-17 11:22:58,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:58,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 32 transitions. [2023-11-17 11:22:58,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,731 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 140 flow. Second operand 3 states and 32 transitions. [2023-11-17 11:22:58,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 317 flow [2023-11-17 11:22:58,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:22:58,733 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 264 flow [2023-11-17 11:22:58,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2023-11-17 11:22:58,734 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2023-11-17 11:22:58,734 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 264 flow [2023-11-17 11:22:58,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:58,734 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:58,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:22:58,734 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:22:58,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:58,734 INFO L85 PathProgramCache]: Analyzing trace with hash -963316011, now seen corresponding path program 1 times [2023-11-17 11:22:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:58,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573471173] [2023-11-17 11:22:58,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:58,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 11:22:58,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:58,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573471173] [2023-11-17 11:22:58,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573471173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:58,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:58,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:22:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088460478] [2023-11-17 11:22:58,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:58,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:22:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:58,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:22:58,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:22:58,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2023-11-17 11:22:58,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:58,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:58,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2023-11-17 11:22:58,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:59,020 INFO L124 PetriNetUnfolderBase]: 3143/4742 cut-off events. [2023-11-17 11:22:59,021 INFO L125 PetriNetUnfolderBase]: For 7699/7699 co-relation queries the response was YES. [2023-11-17 11:22:59,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16770 conditions, 4742 events. 3143/4742 cut-off events. For 7699/7699 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 26047 event pairs, 657 based on Foata normal form. 306/4712 useless extension candidates. Maximal degree in co-relation 9288. Up to 3830 conditions per place. [2023-11-17 11:22:59,045 INFO L140 encePairwiseOnDemand]: 48/50 looper letters, 47 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-11-17 11:22:59,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 453 flow [2023-11-17 11:22:59,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:59,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2023-11-17 11:22:59,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2 [2023-11-17 11:22:59,046 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 30 transitions. [2023-11-17 11:22:59,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 30 transitions. [2023-11-17 11:22:59,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:59,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 30 transitions. [2023-11-17 11:22:59,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,048 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 264 flow. Second operand 3 states and 30 transitions. [2023-11-17 11:22:59,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 453 flow [2023-11-17 11:22:59,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 52 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:22:59,055 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 242 flow [2023-11-17 11:22:59,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2023-11-17 11:22:59,056 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2023-11-17 11:22:59,056 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 242 flow [2023-11-17 11:22:59,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:59,056 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:59,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 11:22:59,056 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:22:59,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:59,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1923711014, now seen corresponding path program 1 times [2023-11-17 11:22:59,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:59,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518507039] [2023-11-17 11:22:59,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:59,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 11:22:59,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:59,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518507039] [2023-11-17 11:22:59,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518507039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:59,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:59,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:59,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058303527] [2023-11-17 11:22:59,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:59,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:59,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:59,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:59,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:59,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 50 [2023-11-17 11:22:59,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:59,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 50 [2023-11-17 11:22:59,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:22:59,362 INFO L124 PetriNetUnfolderBase]: 3456/5402 cut-off events. [2023-11-17 11:22:59,362 INFO L125 PetriNetUnfolderBase]: For 8557/8557 co-relation queries the response was YES. [2023-11-17 11:22:59,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18061 conditions, 5402 events. 3456/5402 cut-off events. For 8557/8557 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 32112 event pairs, 1505 based on Foata normal form. 0/5147 useless extension candidates. Maximal degree in co-relation 9014. Up to 3764 conditions per place. [2023-11-17 11:22:59,388 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 35 selfloop transitions, 21 changer transitions 0/57 dead transitions. [2023-11-17 11:22:59,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 57 transitions, 496 flow [2023-11-17 11:22:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:22:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:22:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2023-11-17 11:22:59,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19333333333333333 [2023-11-17 11:22:59,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 29 transitions. [2023-11-17 11:22:59,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 29 transitions. [2023-11-17 11:22:59,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:22:59,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 29 transitions. [2023-11-17 11:22:59,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,390 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,390 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 242 flow. Second operand 3 states and 29 transitions. [2023-11-17 11:22:59,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 57 transitions, 496 flow [2023-11-17 11:22:59,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 57 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:22:59,394 INFO L231 Difference]: Finished difference. Result has 39 places, 49 transitions, 460 flow [2023-11-17 11:22:59,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=39, PETRI_TRANSITIONS=49} [2023-11-17 11:22:59,395 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2023-11-17 11:22:59,395 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 49 transitions, 460 flow [2023-11-17 11:22:59,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:59,395 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:59,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 11:22:59,395 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2023-11-17 11:22:59,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash -494539316, now seen corresponding path program 1 times [2023-11-17 11:22:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859721370] [2023-11-17 11:22:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:59,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:22:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:22:59,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:22:59,410 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:22:59,411 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-17 11:22:59,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 11:22:59,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-11-17 11:22:59,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-17 11:22:59,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-17 11:22:59,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:22:59,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-17 11:22:59,411 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:22:59,412 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:22:59,412 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-17 11:22:59,424 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:22:59,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 120 flow [2023-11-17 11:22:59,428 INFO L124 PetriNetUnfolderBase]: 5/54 cut-off events. [2023-11-17 11:22:59,428 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 11:22:59,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 54 events. 5/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2023-11-17 11:22:59,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 40 transitions, 120 flow [2023-11-17 11:22:59,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 40 transitions, 120 flow [2023-11-17 11:22:59,429 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:22:59,429 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 40 transitions, 120 flow [2023-11-17 11:22:59,429 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 40 transitions, 120 flow [2023-11-17 11:22:59,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 40 transitions, 120 flow [2023-11-17 11:22:59,432 INFO L124 PetriNetUnfolderBase]: 5/54 cut-off events. [2023-11-17 11:22:59,432 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 11:22:59,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 54 events. 5/54 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 62. Up to 6 conditions per place. [2023-11-17 11:22:59,432 INFO L119 LiptonReduction]: Number of co-enabled transitions 1080 [2023-11-17 11:22:59,692 INFO L134 LiptonReduction]: Checked pairs total: 2624 [2023-11-17 11:22:59,693 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-11-17 11:22:59,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:22:59,694 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7171a4c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:22:59,694 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:22:59,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:22:59,695 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2023-11-17 11:22:59,695 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:22:59,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:22:59,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:22:59,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:22:59,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:22:59,696 INFO L85 PathProgramCache]: Analyzing trace with hash 283403456, now seen corresponding path program 1 times [2023-11-17 11:22:59,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:22:59,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924597705] [2023-11-17 11:22:59,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:22:59,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:22:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:22:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:22:59,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:22:59,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924597705] [2023-11-17 11:22:59,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924597705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:22:59,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:22:59,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:22:59,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205615124] [2023-11-17 11:22:59,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:22:59,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:22:59,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:22:59,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:22:59,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:22:59,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:22:59,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:22:59,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:22:59,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:22:59,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:01,086 INFO L124 PetriNetUnfolderBase]: 19342/25818 cut-off events. [2023-11-17 11:23:01,086 INFO L125 PetriNetUnfolderBase]: For 10042/10042 co-relation queries the response was YES. [2023-11-17 11:23:01,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54108 conditions, 25818 events. 19342/25818 cut-off events. For 10042/10042 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 139395 event pairs, 10920 based on Foata normal form. 0/19176 useless extension candidates. Maximal degree in co-relation 11034. Up to 17094 conditions per place. [2023-11-17 11:23:01,216 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 36 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2023-11-17 11:23:01,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 242 flow [2023-11-17 11:23:01,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:01,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2023-11-17 11:23:01,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2677595628415301 [2023-11-17 11:23:01,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 49 transitions. [2023-11-17 11:23:01,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 49 transitions. [2023-11-17 11:23:01,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:01,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 49 transitions. [2023-11-17 11:23:01,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:01,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:01,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:01,219 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 92 flow. Second operand 3 states and 49 transitions. [2023-11-17 11:23:01,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 242 flow [2023-11-17 11:23:01,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 218 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-17 11:23:01,223 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 122 flow [2023-11-17 11:23:01,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-17 11:23:01,223 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-11-17 11:23:01,223 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 122 flow [2023-11-17 11:23:01,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:01,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:01,224 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:01,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 11:23:01,224 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:01,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:01,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1085150502, now seen corresponding path program 1 times [2023-11-17 11:23:01,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:01,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886193287] [2023-11-17 11:23:01,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:01,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:23:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886193287] [2023-11-17 11:23:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886193287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:01,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:01,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:23:01,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238302495] [2023-11-17 11:23:01,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:01,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:01,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:01,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:01,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:01,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:23:01,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:01,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:01,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:23:01,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:03,056 INFO L124 PetriNetUnfolderBase]: 26933/36058 cut-off events. [2023-11-17 11:23:03,056 INFO L125 PetriNetUnfolderBase]: For 23705/23705 co-relation queries the response was YES. [2023-11-17 11:23:03,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92155 conditions, 36058 events. 26933/36058 cut-off events. For 23705/23705 co-relation queries the response was YES. Maximal size of possible extension queue 1610. Compared 204813 event pairs, 12856 based on Foata normal form. 0/28591 useless extension candidates. Maximal degree in co-relation 43414. Up to 24301 conditions per place. [2023-11-17 11:23:03,391 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 40 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2023-11-17 11:23:03,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 51 transitions, 311 flow [2023-11-17 11:23:03,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2023-11-17 11:23:03,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2459016393442623 [2023-11-17 11:23:03,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 45 transitions. [2023-11-17 11:23:03,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 45 transitions. [2023-11-17 11:23:03,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:03,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 45 transitions. [2023-11-17 11:23:03,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:03,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:03,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:03,393 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 122 flow. Second operand 3 states and 45 transitions. [2023-11-17 11:23:03,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 51 transitions, 311 flow [2023-11-17 11:23:03,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:03,547 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 198 flow [2023-11-17 11:23:03,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-11-17 11:23:03,548 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-11-17 11:23:03,548 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 198 flow [2023-11-17 11:23:03,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:03,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:03,548 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:03,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-17 11:23:03,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:03,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:03,549 INFO L85 PathProgramCache]: Analyzing trace with hash 720719186, now seen corresponding path program 1 times [2023-11-17 11:23:03,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:03,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36882590] [2023-11-17 11:23:03,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:03,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:03,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:23:03,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:03,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36882590] [2023-11-17 11:23:03,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36882590] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:03,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:03,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:23:03,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354355601] [2023-11-17 11:23:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:03,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:23:03,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:03,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:23:03,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:23:03,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:23:03,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:03,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:03,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:23:03,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:05,011 INFO L124 PetriNetUnfolderBase]: 21841/29208 cut-off events. [2023-11-17 11:23:05,011 INFO L125 PetriNetUnfolderBase]: For 26034/26034 co-relation queries the response was YES. [2023-11-17 11:23:05,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85887 conditions, 29208 events. 21841/29208 cut-off events. For 26034/26034 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 162988 event pairs, 4240 based on Foata normal form. 0/24249 useless extension candidates. Maximal degree in co-relation 85728. Up to 23976 conditions per place. [2023-11-17 11:23:05,258 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 55 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-17 11:23:05,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 416 flow [2023-11-17 11:23:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:05,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2023-11-17 11:23:05,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24043715846994534 [2023-11-17 11:23:05,259 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 44 transitions. [2023-11-17 11:23:05,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 44 transitions. [2023-11-17 11:23:05,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:05,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 44 transitions. [2023-11-17 11:23:05,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:05,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:05,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:05,260 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 198 flow. Second operand 3 states and 44 transitions. [2023-11-17 11:23:05,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 416 flow [2023-11-17 11:23:05,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:05,440 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 178 flow [2023-11-17 11:23:05,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-11-17 11:23:05,440 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-11-17 11:23:05,440 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 178 flow [2023-11-17 11:23:05,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:05,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:05,441 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:05,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-17 11:23:05,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:05,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:05,441 INFO L85 PathProgramCache]: Analyzing trace with hash 720074690, now seen corresponding path program 1 times [2023-11-17 11:23:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:05,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593143698] [2023-11-17 11:23:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:05,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:23:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593143698] [2023-11-17 11:23:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593143698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:05,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:05,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:23:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056825892] [2023-11-17 11:23:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:05,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:23:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:05,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:23:05,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:23:05,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:23:05,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:05,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:05,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:23:05,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:06,866 INFO L124 PetriNetUnfolderBase]: 17667/23780 cut-off events. [2023-11-17 11:23:06,866 INFO L125 PetriNetUnfolderBase]: For 17419/17419 co-relation queries the response was YES. [2023-11-17 11:23:06,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67648 conditions, 23780 events. 17667/23780 cut-off events. For 17419/17419 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 129302 event pairs, 3001 based on Foata normal form. 0/19676 useless extension candidates. Maximal degree in co-relation 35084. Up to 19469 conditions per place. [2023-11-17 11:23:07,039 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 52 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-17 11:23:07,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 55 transitions, 371 flow [2023-11-17 11:23:07,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:07,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2023-11-17 11:23:07,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22404371584699453 [2023-11-17 11:23:07,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 41 transitions. [2023-11-17 11:23:07,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 41 transitions. [2023-11-17 11:23:07,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:07,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 41 transitions. [2023-11-17 11:23:07,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:07,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:07,042 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:07,042 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 178 flow. Second operand 3 states and 41 transitions. [2023-11-17 11:23:07,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 55 transitions, 371 flow [2023-11-17 11:23:07,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 368 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:23:07,046 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 176 flow [2023-11-17 11:23:07,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-11-17 11:23:07,046 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-11-17 11:23:07,047 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 176 flow [2023-11-17 11:23:07,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:07,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:07,047 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:07,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-17 11:23:07,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:07,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:07,047 INFO L85 PathProgramCache]: Analyzing trace with hash 458765881, now seen corresponding path program 1 times [2023-11-17 11:23:07,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:07,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958765914] [2023-11-17 11:23:07,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:07,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 11:23:07,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:07,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958765914] [2023-11-17 11:23:07,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958765914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:07,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:23:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000532163] [2023-11-17 11:23:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:07,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:07,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:07,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:07,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:23:07,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:07,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:07,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:23:07,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:09,358 INFO L124 PetriNetUnfolderBase]: 23345/32006 cut-off events. [2023-11-17 11:23:09,359 INFO L125 PetriNetUnfolderBase]: For 33389/33389 co-relation queries the response was YES. [2023-11-17 11:23:09,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91584 conditions, 32006 events. 23345/32006 cut-off events. For 33389/33389 co-relation queries the response was YES. Maximal size of possible extension queue 1589. Compared 190445 event pairs, 10092 based on Foata normal form. 0/26903 useless extension candidates. Maximal degree in co-relation 52485. Up to 22101 conditions per place. [2023-11-17 11:23:09,562 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 42 selfloop transitions, 17 changer transitions 0/60 dead transitions. [2023-11-17 11:23:09,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 416 flow [2023-11-17 11:23:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2023-11-17 11:23:09,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2185792349726776 [2023-11-17 11:23:09,563 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 40 transitions. [2023-11-17 11:23:09,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 40 transitions. [2023-11-17 11:23:09,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:09,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 40 transitions. [2023-11-17 11:23:09,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:09,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:09,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:09,565 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 176 flow. Second operand 3 states and 40 transitions. [2023-11-17 11:23:09,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 416 flow [2023-11-17 11:23:09,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:23:09,573 INFO L231 Difference]: Finished difference. Result has 43 places, 48 transitions, 348 flow [2023-11-17 11:23:09,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=43, PETRI_TRANSITIONS=48} [2023-11-17 11:23:09,574 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-11-17 11:23:09,574 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 48 transitions, 348 flow [2023-11-17 11:23:09,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:09,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:09,574 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:09,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-17 11:23:09,574 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:09,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1336841947, now seen corresponding path program 1 times [2023-11-17 11:23:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081743922] [2023-11-17 11:23:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 11:23:09,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:09,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081743922] [2023-11-17 11:23:09,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081743922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:09,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:09,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:23:09,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652244150] [2023-11-17 11:23:09,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:09,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:23:09,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:09,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:23:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:23:09,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:23:09,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 48 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:09,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:09,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:23:09,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:11,184 INFO L124 PetriNetUnfolderBase]: 18770/25739 cut-off events. [2023-11-17 11:23:11,185 INFO L125 PetriNetUnfolderBase]: For 43224/43224 co-relation queries the response was YES. [2023-11-17 11:23:11,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89719 conditions, 25739 events. 18770/25739 cut-off events. For 43224/43224 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 148277 event pairs, 3549 based on Foata normal form. 1431/24146 useless extension candidates. Maximal degree in co-relation 51153. Up to 20921 conditions per place. [2023-11-17 11:23:11,459 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 66 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-11-17 11:23:11,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 626 flow [2023-11-17 11:23:11,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:11,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2023-11-17 11:23:11,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20765027322404372 [2023-11-17 11:23:11,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 38 transitions. [2023-11-17 11:23:11,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 38 transitions. [2023-11-17 11:23:11,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:11,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 38 transitions. [2023-11-17 11:23:11,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:11,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:11,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:11,462 INFO L175 Difference]: Start difference. First operand has 43 places, 48 transitions, 348 flow. Second operand 3 states and 38 transitions. [2023-11-17 11:23:11,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 626 flow [2023-11-17 11:23:11,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 71 transitions, 592 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:11,518 INFO L231 Difference]: Finished difference. Result has 42 places, 47 transitions, 318 flow [2023-11-17 11:23:11,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=42, PETRI_TRANSITIONS=47} [2023-11-17 11:23:11,518 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-11-17 11:23:11,518 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 47 transitions, 318 flow [2023-11-17 11:23:11,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:11,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:11,519 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:11,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-17 11:23:11,519 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:11,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash 473067123, now seen corresponding path program 1 times [2023-11-17 11:23:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:11,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761055245] [2023-11-17 11:23:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:11,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:11,541 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 11:23:11,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:11,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761055245] [2023-11-17 11:23:11,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761055245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:11,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:11,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:23:11,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073125601] [2023-11-17 11:23:11,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:11,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:11,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:11,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:11,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:11,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:23:11,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 47 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:11,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:11,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:23:11,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:13,446 INFO L124 PetriNetUnfolderBase]: 23472/32763 cut-off events. [2023-11-17 11:23:13,446 INFO L125 PetriNetUnfolderBase]: For 58724/58724 co-relation queries the response was YES. [2023-11-17 11:23:13,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108384 conditions, 32763 events. 23472/32763 cut-off events. For 58724/58724 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 202041 event pairs, 9257 based on Foata normal form. 0/29373 useless extension candidates. Maximal degree in co-relation 62594. Up to 22994 conditions per place. [2023-11-17 11:23:13,676 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 49 selfloop transitions, 29 changer transitions 0/79 dead transitions. [2023-11-17 11:23:13,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 691 flow [2023-11-17 11:23:13,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2023-11-17 11:23:13,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20218579234972678 [2023-11-17 11:23:13,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 37 transitions. [2023-11-17 11:23:13,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 37 transitions. [2023-11-17 11:23:13,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:13,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 37 transitions. [2023-11-17 11:23:13,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:13,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:13,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:13,678 INFO L175 Difference]: Start difference. First operand has 42 places, 47 transitions, 318 flow. Second operand 3 states and 37 transitions. [2023-11-17 11:23:13,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 79 transitions, 691 flow [2023-11-17 11:23:13,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 79 transitions, 683 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:23:13,692 INFO L231 Difference]: Finished difference. Result has 45 places, 68 transitions, 648 flow [2023-11-17 11:23:13,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=45, PETRI_TRANSITIONS=68} [2023-11-17 11:23:13,693 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-11-17 11:23:13,693 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 68 transitions, 648 flow [2023-11-17 11:23:13,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:13,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:13,693 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:13,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-17 11:23:13,693 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:13,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1780179711, now seen corresponding path program 1 times [2023-11-17 11:23:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593780506] [2023-11-17 11:23:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-17 11:23:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593780506] [2023-11-17 11:23:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593780506] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:13,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:13,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:23:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187531405] [2023-11-17 11:23:13,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:13,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:23:13,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:13,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:23:13,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:23:13,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:23:13,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 68 transitions, 648 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:13,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:13,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:23:13,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:15,726 INFO L124 PetriNetUnfolderBase]: 18892/26495 cut-off events. [2023-11-17 11:23:15,727 INFO L125 PetriNetUnfolderBase]: For 70170/70170 co-relation queries the response was YES. [2023-11-17 11:23:15,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105094 conditions, 26495 events. 18892/26495 cut-off events. For 70170/70170 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 160429 event pairs, 4169 based on Foata normal form. 1518/26477 useless extension candidates. Maximal degree in co-relation 60373. Up to 21002 conditions per place. [2023-11-17 11:23:15,919 INFO L140 encePairwiseOnDemand]: 59/61 looper letters, 88 selfloop transitions, 8 changer transitions 0/97 dead transitions. [2023-11-17 11:23:15,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 97 transitions, 1077 flow [2023-11-17 11:23:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2023-11-17 11:23:15,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1912568306010929 [2023-11-17 11:23:15,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 35 transitions. [2023-11-17 11:23:15,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 35 transitions. [2023-11-17 11:23:15,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:15,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 35 transitions. [2023-11-17 11:23:15,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:15,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:15,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:15,922 INFO L175 Difference]: Start difference. First operand has 45 places, 68 transitions, 648 flow. Second operand 3 states and 35 transitions. [2023-11-17 11:23:15,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 97 transitions, 1077 flow [2023-11-17 11:23:15,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 97 transitions, 1019 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:15,991 INFO L231 Difference]: Finished difference. Result has 44 places, 67 transitions, 602 flow [2023-11-17 11:23:15,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=44, PETRI_TRANSITIONS=67} [2023-11-17 11:23:15,992 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 8 predicate places. [2023-11-17 11:23:15,992 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 67 transitions, 602 flow [2023-11-17 11:23:15,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:15,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:15,993 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:15,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-17 11:23:15,993 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:15,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1318503972, now seen corresponding path program 1 times [2023-11-17 11:23:15,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:15,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226388203] [2023-11-17 11:23:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:15,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-17 11:23:16,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:16,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226388203] [2023-11-17 11:23:16,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226388203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:16,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:16,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:23:16,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248266670] [2023-11-17 11:23:16,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:16,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:16,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:16,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:16,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:16,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 61 [2023-11-17 11:23:16,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 67 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:16,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:16,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 61 [2023-11-17 11:23:16,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:18,155 INFO L124 PetriNetUnfolderBase]: 21697/31173 cut-off events. [2023-11-17 11:23:18,156 INFO L125 PetriNetUnfolderBase]: For 83967/83967 co-relation queries the response was YES. [2023-11-17 11:23:18,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117914 conditions, 31173 events. 21697/31173 cut-off events. For 83967/83967 co-relation queries the response was YES. Maximal size of possible extension queue 1821. Compared 202133 event pairs, 8557 based on Foata normal form. 0/29880 useless extension candidates. Maximal degree in co-relation 63511. Up to 23017 conditions per place. [2023-11-17 11:23:18,348 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 60 selfloop transitions, 49 changer transitions 0/110 dead transitions. [2023-11-17 11:23:18,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 110 transitions, 1218 flow [2023-11-17 11:23:18,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2023-11-17 11:23:18,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18579234972677597 [2023-11-17 11:23:18,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 34 transitions. [2023-11-17 11:23:18,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 34 transitions. [2023-11-17 11:23:18,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:18,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 34 transitions. [2023-11-17 11:23:18,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:18,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:18,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 61.0) internal successors, (244), 4 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:18,354 INFO L175 Difference]: Start difference. First operand has 44 places, 67 transitions, 602 flow. Second operand 3 states and 34 transitions. [2023-11-17 11:23:18,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 110 transitions, 1218 flow [2023-11-17 11:23:18,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 110 transitions, 1202 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:23:18,384 INFO L231 Difference]: Finished difference. Result has 47 places, 100 transitions, 1212 flow [2023-11-17 11:23:18,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=47, PETRI_TRANSITIONS=100} [2023-11-17 11:23:18,385 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-11-17 11:23:18,385 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 100 transitions, 1212 flow [2023-11-17 11:23:18,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:18,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:18,386 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:18,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-17 11:23:18,386 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-11-17 11:23:18,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2076088929, now seen corresponding path program 1 times [2023-11-17 11:23:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327815643] [2023-11-17 11:23:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:23:18,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:23:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:23:18,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:23:18,419 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:23:18,419 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-11-17 11:23:18,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 11:23:18,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-11-17 11:23:18,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-11-17 11:23:18,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-11-17 11:23:18,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-11-17 11:23:18,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 11:23:18,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-17 11:23:18,420 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:18,421 WARN L233 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-17 11:23:18,421 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-17 11:23:18,437 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:23:18,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 148 flow [2023-11-17 11:23:18,441 INFO L124 PetriNetUnfolderBase]: 6/64 cut-off events. [2023-11-17 11:23:18,441 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-17 11:23:18,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 64 events. 6/64 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2023-11-17 11:23:18,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 47 transitions, 148 flow [2023-11-17 11:23:18,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 47 transitions, 148 flow [2023-11-17 11:23:18,442 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:23:18,442 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 47 transitions, 148 flow [2023-11-17 11:23:18,442 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 47 transitions, 148 flow [2023-11-17 11:23:18,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 148 flow [2023-11-17 11:23:18,445 INFO L124 PetriNetUnfolderBase]: 6/64 cut-off events. [2023-11-17 11:23:18,445 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-17 11:23:18,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 64 events. 6/64 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2023-11-17 11:23:18,446 INFO L119 LiptonReduction]: Number of co-enabled transitions 1548 [2023-11-17 11:23:18,888 INFO L134 LiptonReduction]: Checked pairs total: 4925 [2023-11-17 11:23:18,888 INFO L136 LiptonReduction]: Total number of compositions: 28 [2023-11-17 11:23:18,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:23:18,892 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7171a4c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:23:18,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-11-17 11:23:18,893 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:23:18,893 INFO L124 PetriNetUnfolderBase]: 1/8 cut-off events. [2023-11-17 11:23:18,893 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:23:18,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:18,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:23:18,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:23:18,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:18,894 INFO L85 PathProgramCache]: Analyzing trace with hash 348302210, now seen corresponding path program 1 times [2023-11-17 11:23:18,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:18,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856499036] [2023-11-17 11:23:18,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:18,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:18,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:23:18,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:18,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856499036] [2023-11-17 11:23:18,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856499036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:18,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:18,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:23:18,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040071371] [2023-11-17 11:23:18,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:18,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:18,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:18,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:18,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:18,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2023-11-17 11:23:18,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:18,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:18,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2023-11-17 11:23:18,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:25,483 INFO L124 PetriNetUnfolderBase]: 96091/122142 cut-off events. [2023-11-17 11:23:25,484 INFO L125 PetriNetUnfolderBase]: For 59134/59134 co-relation queries the response was YES. [2023-11-17 11:23:25,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256336 conditions, 122142 events. 96091/122142 cut-off events. For 59134/59134 co-relation queries the response was YES. Maximal size of possible extension queue 4060. Compared 679314 event pairs, 55974 based on Foata normal form. 0/89391 useless extension candidates. Maximal degree in co-relation 54591. Up to 83085 conditions per place. [2023-11-17 11:23:26,063 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 43 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-11-17 11:23:26,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 301 flow [2023-11-17 11:23:26,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2023-11-17 11:23:26,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28 [2023-11-17 11:23:26,065 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 63 transitions. [2023-11-17 11:23:26,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 63 transitions. [2023-11-17 11:23:26,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:26,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 63 transitions. [2023-11-17 11:23:26,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,066 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 120 flow. Second operand 3 states and 63 transitions. [2023-11-17 11:23:26,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 301 flow [2023-11-17 11:23:26,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 261 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-11-17 11:23:26,087 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 144 flow [2023-11-17 11:23:26,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-11-17 11:23:26,088 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-11-17 11:23:26,088 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 144 flow [2023-11-17 11:23:26,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:26,099 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:26,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-17 11:23:26,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:23:26,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:26,100 INFO L85 PathProgramCache]: Analyzing trace with hash -428967981, now seen corresponding path program 1 times [2023-11-17 11:23:26,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:26,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005484274] [2023-11-17 11:23:26,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:26,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:23:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005484274] [2023-11-17 11:23:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005484274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:26,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:26,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:23:26,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35150703] [2023-11-17 11:23:26,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:26,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:23:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:26,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:23:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:23:26,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2023-11-17 11:23:26,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:26,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:26,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2023-11-17 11:23:26,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:36,265 INFO L124 PetriNetUnfolderBase]: 135935/173047 cut-off events. [2023-11-17 11:23:36,265 INFO L125 PetriNetUnfolderBase]: For 115932/115932 co-relation queries the response was YES. [2023-11-17 11:23:36,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439766 conditions, 173047 events. 135935/173047 cut-off events. For 115932/115932 co-relation queries the response was YES. Maximal size of possible extension queue 5863. Compared 1003592 event pairs, 67669 based on Foata normal form. 0/134104 useless extension candidates. Maximal degree in co-relation 207379. Up to 120031 conditions per place. [2023-11-17 11:23:37,462 INFO L140 encePairwiseOnDemand]: 67/75 looper letters, 48 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2023-11-17 11:23:37,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 374 flow [2023-11-17 11:23:37,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2023-11-17 11:23:37,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23555555555555555 [2023-11-17 11:23:37,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 53 transitions. [2023-11-17 11:23:37,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 53 transitions. [2023-11-17 11:23:37,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:37,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 53 transitions. [2023-11-17 11:23:37,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:37,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:37,464 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:37,464 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 144 flow. Second operand 3 states and 53 transitions. [2023-11-17 11:23:37,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 374 flow [2023-11-17 11:23:43,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:43,384 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 238 flow [2023-11-17 11:23:43,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-11-17 11:23:43,385 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2023-11-17 11:23:43,385 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 238 flow [2023-11-17 11:23:43,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:43,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:43,385 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:43,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-17 11:23:43,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:23:43,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:43,386 INFO L85 PathProgramCache]: Analyzing trace with hash -412399307, now seen corresponding path program 1 times [2023-11-17 11:23:43,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:43,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167346652] [2023-11-17 11:23:43,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:43,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:43,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 11:23:43,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:43,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167346652] [2023-11-17 11:23:43,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167346652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:43,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:43,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:23:43,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034371403] [2023-11-17 11:23:43,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:43,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:23:43,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:43,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:23:43,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:23:43,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2023-11-17 11:23:43,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:43,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:43,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2023-11-17 11:23:43,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:23:51,644 INFO L124 PetriNetUnfolderBase]: 110560/140454 cut-off events. [2023-11-17 11:23:51,645 INFO L125 PetriNetUnfolderBase]: For 123400/123400 co-relation queries the response was YES. [2023-11-17 11:23:52,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410056 conditions, 140454 events. 110560/140454 cut-off events. For 123400/123400 co-relation queries the response was YES. Maximal size of possible extension queue 4673. Compared 799395 event pairs, 21436 based on Foata normal form. 0/113223 useless extension candidates. Maximal degree in co-relation 409608. Up to 114633 conditions per place. [2023-11-17 11:23:53,007 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 67 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-17 11:23:53,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 505 flow [2023-11-17 11:23:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:23:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:23:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2023-11-17 11:23:53,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2311111111111111 [2023-11-17 11:23:53,008 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 52 transitions. [2023-11-17 11:23:53,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 52 transitions. [2023-11-17 11:23:53,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:23:53,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 52 transitions. [2023-11-17 11:23:53,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:53,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:53,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:53,029 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 238 flow. Second operand 3 states and 52 transitions. [2023-11-17 11:23:53,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 505 flow [2023-11-17 11:23:58,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 469 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:23:58,020 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 214 flow [2023-11-17 11:23:58,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-11-17 11:23:58,021 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-17 11:23:58,021 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 214 flow [2023-11-17 11:23:58,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:58,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:23:58,021 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:23:58,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-17 11:23:58,021 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:23:58,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:23:58,022 INFO L85 PathProgramCache]: Analyzing trace with hash -413104223, now seen corresponding path program 1 times [2023-11-17 11:23:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:23:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396962596] [2023-11-17 11:23:58,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:23:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:23:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:23:58,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 11:23:58,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:23:58,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396962596] [2023-11-17 11:23:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396962596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:23:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:23:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:23:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189787615] [2023-11-17 11:23:58,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:23:58,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:23:58,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:23:58,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:23:58,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:23:58,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2023-11-17 11:23:58,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:23:58,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:23:58,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2023-11-17 11:23:58,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:04,164 INFO L124 PetriNetUnfolderBase]: 89733/114494 cut-off events. [2023-11-17 11:24:04,165 INFO L125 PetriNetUnfolderBase]: For 82222/82222 co-relation queries the response was YES. [2023-11-17 11:24:04,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323069 conditions, 114494 events. 89733/114494 cut-off events. For 82222/82222 co-relation queries the response was YES. Maximal size of possible extension queue 3850. Compared 639169 event pairs, 15349 based on Foata normal form. 0/91958 useless extension candidates. Maximal degree in co-relation 171113. Up to 93272 conditions per place. [2023-11-17 11:24:04,916 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 64 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-17 11:24:04,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 454 flow [2023-11-17 11:24:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2023-11-17 11:24:04,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21777777777777776 [2023-11-17 11:24:04,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 49 transitions. [2023-11-17 11:24:04,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 49 transitions. [2023-11-17 11:24:04,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:04,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 49 transitions. [2023-11-17 11:24:04,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,918 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 214 flow. Second operand 3 states and 49 transitions. [2023-11-17 11:24:04,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 454 flow [2023-11-17 11:24:04,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:04,955 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 212 flow [2023-11-17 11:24:04,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-11-17 11:24:04,956 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-11-17 11:24:04,956 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 212 flow [2023-11-17 11:24:04,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:04,956 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:04,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-17 11:24:04,956 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-11-17 11:24:04,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1904319534, now seen corresponding path program 1 times [2023-11-17 11:24:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776190735] [2023-11-17 11:24:04,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:04,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:04,970 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 11:24:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:04,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776190735] [2023-11-17 11:24:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776190735] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:04,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:04,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822748012] [2023-11-17 11:24:04,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:04,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:04,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:04,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:04,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 75 [2023-11-17 11:24:04,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:04,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:04,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 75 [2023-11-17 11:24:04,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand