/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:33:16,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:33:16,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:33:16,628 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:33:16,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:33:16,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:33:16,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:33:16,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:33:16,631 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:33:16,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:33:16,636 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:33:16,636 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:33:16,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:33:16,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:33:16,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:33:16,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:33:16,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:33:16,638 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:33:16,638 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:33:16,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:33:16,638 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:33:16,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:33:16,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:33:16,639 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:33:16,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:33:16,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:33:16,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:33:16,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:33:16,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:33:16,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:33:16,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:33:16,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:33:16,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:33:16,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:33:16,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:33:16,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:33:16,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:33:16,821 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:33:16,821 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:33:16,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs-pthread.i [2023-11-30 04:33:17,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:33:17,948 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:33:17,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/31_simple_loop5_vs-pthread.i [2023-11-30 04:33:17,957 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3b9e887/e47a12b2c62f4440b7cb6f3dda11bb8b/FLAGea619ce60 [2023-11-30 04:33:17,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d3b9e887/e47a12b2c62f4440b7cb6f3dda11bb8b [2023-11-30 04:33:17,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:33:17,972 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:33:17,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:33:17,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:33:17,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:33:17,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:33:17" (1/1) ... [2023-11-30 04:33:17,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f56d811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:17, skipping insertion in model container [2023-11-30 04:33:17,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:33:17" (1/1) ... [2023-11-30 04:33:18,003 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:33:18,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:33:18,194 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:33:18,241 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:33:18,274 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:33:18,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18 WrapperNode [2023-11-30 04:33:18,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:33:18,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:33:18,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:33:18,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:33:18,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,321 INFO L138 Inliner]: procedures = 163, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2023-11-30 04:33:18,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:33:18,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:33:18,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:33:18,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:33:18,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:33:18,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:33:18,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:33:18,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:33:18,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (1/1) ... [2023-11-30 04:33:18,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:33:18,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:33:18,410 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-30 04:33:18,445 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-30 04:33:18,451 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2023-11-30 04:33:18,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2023-11-30 04:33:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 04:33:18,452 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 04:33:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:33:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 04:33:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:33:18,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:33:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:33:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:33:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 04:33:18,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:33:18,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:33:18,454 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:33:18,578 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:33:18,580 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:33:18,732 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:33:18,751 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:33:18,752 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 04:33:18,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:33:18 BoogieIcfgContainer [2023-11-30 04:33:18,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:33:18,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:33:18,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:33:18,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:33:18,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:33:17" (1/3) ... [2023-11-30 04:33:18,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa98add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:33:18, skipping insertion in model container [2023-11-30 04:33:18,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:33:18" (2/3) ... [2023-11-30 04:33:18,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa98add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:33:18, skipping insertion in model container [2023-11-30 04:33:18,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:33:18" (3/3) ... [2023-11-30 04:33:18,762 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs-pthread.i [2023-11-30 04:33:18,774 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:33:18,774 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-30 04:33:18,774 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:33:18,807 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:18,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 79 transitions, 166 flow [2023-11-30 04:33:18,867 INFO L124 PetriNetUnfolderBase]: 8/91 cut-off events. [2023-11-30 04:33:18,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:18,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 91 events. 8/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 67. Up to 4 conditions per place. [2023-11-30 04:33:18,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 79 transitions, 166 flow [2023-11-30 04:33:18,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 78 transitions, 163 flow [2023-11-30 04:33:18,906 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:18,917 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10983c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:18,918 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-30 04:33:18,926 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:18,926 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 04:33:18,926 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:18,927 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:18,927 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:18,927 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:18,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash 203619419, now seen corresponding path program 1 times [2023-11-30 04:33:18,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:18,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695787880] [2023-11-30 04:33:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:18,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:19,170 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-30 04:33:19,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:19,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695787880] [2023-11-30 04:33:19,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695787880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:19,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:19,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:19,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200933413] [2023-11-30 04:33:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:19,178 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:19,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:19,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:19,209 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 79 [2023-11-30 04:33:19,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-30 04:33:19,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:19,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 79 [2023-11-30 04:33:19,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:19,306 INFO L124 PetriNetUnfolderBase]: 55/222 cut-off events. [2023-11-30 04:33:19,307 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:33:19,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 222 events. 55/222 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 831 event pairs, 34 based on Foata normal form. 71/271 useless extension candidates. Maximal degree in co-relation 289. Up to 90 conditions per place. [2023-11-30 04:33:19,311 INFO L140 encePairwiseOnDemand]: 68/79 looper letters, 15 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-11-30 04:33:19,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 56 transitions, 151 flow [2023-11-30 04:33:19,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 173 transitions. [2023-11-30 04:33:19,322 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.729957805907173 [2023-11-30 04:33:19,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 173 transitions. [2023-11-30 04:33:19,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 173 transitions. [2023-11-30 04:33:19,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:19,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 173 transitions. [2023-11-30 04:33:19,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 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-30 04:33:19,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-30 04:33:19,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-30 04:33:19,336 INFO L307 CegarLoopForPetriNet]: 77 programPoint places, -15 predicate places. [2023-11-30 04:33:19,336 INFO L500 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 151 flow [2023-11-30 04:33:19,336 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-30 04:33:19,337 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:19,337 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:19,337 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:33:19,337 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:19,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:19,338 INFO L85 PathProgramCache]: Analyzing trace with hash 203619420, now seen corresponding path program 1 times [2023-11-30 04:33:19,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:19,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150416665] [2023-11-30 04:33:19,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:19,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:19,491 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-30 04:33:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:19,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150416665] [2023-11-30 04:33:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150416665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:19,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29415625] [2023-11-30 04:33:19,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:19,493 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:19,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:19,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:19,494 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 79 [2023-11-30 04:33:19,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-30 04:33:19,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:19,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 79 [2023-11-30 04:33:19,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:19,532 INFO L124 PetriNetUnfolderBase]: 34/160 cut-off events. [2023-11-30 04:33:19,532 INFO L125 PetriNetUnfolderBase]: For 33/45 co-relation queries the response was YES. [2023-11-30 04:33:19,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 160 events. 34/160 cut-off events. For 33/45 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 481 event pairs, 20 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 248. Up to 56 conditions per place. [2023-11-30 04:33:19,535 INFO L140 encePairwiseOnDemand]: 76/79 looper letters, 12 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-11-30 04:33:19,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 169 flow [2023-11-30 04:33:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2023-11-30 04:33:19,539 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6962025316455697 [2023-11-30 04:33:19,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 165 transitions. [2023-11-30 04:33:19,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 165 transitions. [2023-11-30 04:33:19,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:19,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 165 transitions. [2023-11-30 04:33:19,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 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-30 04:33:19,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-30 04:33:19,542 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 0 states have call successors, (0), 0 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-30 04:33:19,542 INFO L307 CegarLoopForPetriNet]: 77 programPoint places, -15 predicate places. [2023-11-30 04:33:19,542 INFO L500 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 169 flow [2023-11-30 04:33:19,543 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 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-30 04:33:19,543 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:19,543 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:19,543 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:33:19,543 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:19,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1668461742, now seen corresponding path program 1 times [2023-11-30 04:33:19,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:19,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768412891] [2023-11-30 04:33:19,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:19,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:19,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:19,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:19,614 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:19,614 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-30 04:33:19,616 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-11-30 04:33:19,617 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-30 04:33:19,617 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-30 04:33:19,617 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-11-30 04:33:19,618 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-11-30 04:33:19,618 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:33:19,619 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:19,623 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:19,623 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 04:33:19,660 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:19,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 114 transitions, 248 flow [2023-11-30 04:33:19,679 INFO L124 PetriNetUnfolderBase]: 11/121 cut-off events. [2023-11-30 04:33:19,680 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:33:19,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 121 events. 11/121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 264 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 128. Up to 6 conditions per place. [2023-11-30 04:33:19,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 114 transitions, 248 flow [2023-11-30 04:33:19,687 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 93 transitions, 199 flow [2023-11-30 04:33:19,689 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:19,692 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10983c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:19,693 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-30 04:33:19,696 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:19,696 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 04:33:19,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:19,696 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:19,696 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:19,696 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:19,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:19,697 INFO L85 PathProgramCache]: Analyzing trace with hash 807987213, now seen corresponding path program 1 times [2023-11-30 04:33:19,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:19,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024142908] [2023-11-30 04:33:19,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:19,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:19,761 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-30 04:33:19,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:19,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024142908] [2023-11-30 04:33:19,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024142908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:19,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:19,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:19,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553114456] [2023-11-30 04:33:19,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:19,763 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:19,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:19,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:19,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:19,765 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 114 [2023-11-30 04:33:19,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-30 04:33:19,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:19,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 114 [2023-11-30 04:33:19,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:19,878 INFO L124 PetriNetUnfolderBase]: 280/768 cut-off events. [2023-11-30 04:33:19,879 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-30 04:33:19,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 768 events. 280/768 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4277 event pairs, 178 based on Foata normal form. 302/1003 useless extension candidates. Maximal degree in co-relation 1159. Up to 387 conditions per place. [2023-11-30 04:33:19,884 INFO L140 encePairwiseOnDemand]: 101/114 looper letters, 18 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2023-11-30 04:33:19,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 185 flow [2023-11-30 04:33:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-11-30 04:33:19,887 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7134502923976608 [2023-11-30 04:33:19,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-11-30 04:33:19,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-11-30 04:33:19,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:19,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-11-30 04:33:19,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 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-30 04:33:19,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-30 04:33:19,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-30 04:33:19,892 INFO L307 CegarLoopForPetriNet]: 92 programPoint places, -18 predicate places. [2023-11-30 04:33:19,892 INFO L500 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 185 flow [2023-11-30 04:33:19,892 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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-30 04:33:19,893 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:19,893 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:19,893 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:33:19,893 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:19,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash 807987214, now seen corresponding path program 1 times [2023-11-30 04:33:19,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598753539] [2023-11-30 04:33:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:19,954 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-30 04:33:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598753539] [2023-11-30 04:33:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598753539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865803639] [2023-11-30 04:33:19,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:19,955 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:19,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:19,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:19,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:19,956 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 114 [2023-11-30 04:33:19,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-30 04:33:19,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:19,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 114 [2023-11-30 04:33:19,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:20,053 INFO L124 PetriNetUnfolderBase]: 178/535 cut-off events. [2023-11-30 04:33:20,053 INFO L125 PetriNetUnfolderBase]: For 126/180 co-relation queries the response was YES. [2023-11-30 04:33:20,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 535 events. 178/535 cut-off events. For 126/180 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2649 event pairs, 110 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 1028. Up to 245 conditions per place. [2023-11-30 04:33:20,055 INFO L140 encePairwiseOnDemand]: 111/114 looper letters, 15 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2023-11-30 04:33:20,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 65 transitions, 209 flow [2023-11-30 04:33:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2023-11-30 04:33:20,057 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2023-11-30 04:33:20,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 234 transitions. [2023-11-30 04:33:20,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 234 transitions. [2023-11-30 04:33:20,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:20,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 234 transitions. [2023-11-30 04:33:20,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 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-30 04:33:20,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-30 04:33:20,059 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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-30 04:33:20,060 INFO L307 CegarLoopForPetriNet]: 92 programPoint places, -18 predicate places. [2023-11-30 04:33:20,060 INFO L500 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 209 flow [2023-11-30 04:33:20,060 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 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-30 04:33:20,060 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:20,061 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:20,061 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:33:20,061 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:20,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1945452585, now seen corresponding path program 1 times [2023-11-30 04:33:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:20,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661969903] [2023-11-30 04:33:20,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:20,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:20,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:20,107 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:20,107 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-30 04:33:20,107 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-11-30 04:33:20,107 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-30 04:33:20,108 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-30 04:33:20,110 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-11-30 04:33:20,110 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-11-30 04:33:20,110 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:33:20,111 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:20,111 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:20,111 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 04:33:20,135 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:20,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 149 transitions, 334 flow [2023-11-30 04:33:20,155 INFO L124 PetriNetUnfolderBase]: 14/151 cut-off events. [2023-11-30 04:33:20,156 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:33:20,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 151 events. 14/151 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 352 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 162. Up to 8 conditions per place. [2023-11-30 04:33:20,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 149 transitions, 334 flow [2023-11-30 04:33:20,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 108 transitions, 237 flow [2023-11-30 04:33:20,159 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:20,161 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10983c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:20,161 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-30 04:33:20,164 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:20,164 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 04:33:20,164 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:20,164 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:20,164 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:20,164 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:20,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1529131070, now seen corresponding path program 1 times [2023-11-30 04:33:20,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:20,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104594040] [2023-11-30 04:33:20,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:20,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:20,192 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-30 04:33:20,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:20,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104594040] [2023-11-30 04:33:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104594040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:20,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:20,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:20,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952098347] [2023-11-30 04:33:20,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:20,193 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:20,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:20,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:20,194 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 149 [2023-11-30 04:33:20,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 108 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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-30 04:33:20,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:20,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 149 [2023-11-30 04:33:20,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:20,443 INFO L124 PetriNetUnfolderBase]: 1198/2649 cut-off events. [2023-11-30 04:33:20,443 INFO L125 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2023-11-30 04:33:20,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4324 conditions, 2649 events. 1198/2649 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17943 event pairs, 772 based on Foata normal form. 1157/3604 useless extension candidates. Maximal degree in co-relation 4282. Up to 1521 conditions per place. [2023-11-30 04:33:20,461 INFO L140 encePairwiseOnDemand]: 134/149 looper letters, 21 selfloop transitions, 1 changer transitions 0/78 dead transitions. [2023-11-30 04:33:20,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 78 transitions, 221 flow [2023-11-30 04:33:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:20,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-11-30 04:33:20,463 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7046979865771812 [2023-11-30 04:33:20,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-11-30 04:33:20,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-11-30 04:33:20,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:20,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-11-30 04:33:20,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-30 04:33:20,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 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-30 04:33:20,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 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-30 04:33:20,467 INFO L307 CegarLoopForPetriNet]: 107 programPoint places, -21 predicate places. [2023-11-30 04:33:20,468 INFO L500 AbstractCegarLoop]: Abstraction has has 86 places, 78 transitions, 221 flow [2023-11-30 04:33:20,468 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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-30 04:33:20,468 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:20,468 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:20,468 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:33:20,468 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:20,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1529131069, now seen corresponding path program 1 times [2023-11-30 04:33:20,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:20,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897554843] [2023-11-30 04:33:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:20,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:20,524 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-30 04:33:20,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:20,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897554843] [2023-11-30 04:33:20,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897554843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:20,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:20,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:20,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768114505] [2023-11-30 04:33:20,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:20,527 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:20,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:20,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:20,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:20,528 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 149 [2023-11-30 04:33:20,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 78 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-30 04:33:20,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:20,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 149 [2023-11-30 04:33:20,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:20,753 INFO L124 PetriNetUnfolderBase]: 772/1822 cut-off events. [2023-11-30 04:33:20,753 INFO L125 PetriNetUnfolderBase]: For 522/702 co-relation queries the response was YES. [2023-11-30 04:33:20,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 1822 events. 772/1822 cut-off events. For 522/702 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 11745 event pairs, 488 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 3881. Up to 974 conditions per place. [2023-11-30 04:33:20,766 INFO L140 encePairwiseOnDemand]: 146/149 looper letters, 18 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2023-11-30 04:33:20,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 76 transitions, 251 flow [2023-11-30 04:33:20,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:20,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-11-30 04:33:20,767 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6778523489932886 [2023-11-30 04:33:20,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-11-30 04:33:20,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-11-30 04:33:20,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:20,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-11-30 04:33:20,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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-30 04:33:20,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 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-30 04:33:20,769 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 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-30 04:33:20,770 INFO L307 CegarLoopForPetriNet]: 107 programPoint places, -21 predicate places. [2023-11-30 04:33:20,770 INFO L500 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 251 flow [2023-11-30 04:33:20,771 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 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-30 04:33:20,771 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:20,771 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:20,771 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:33:20,771 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:20,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:20,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1584663601, now seen corresponding path program 1 times [2023-11-30 04:33:20,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:20,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714175710] [2023-11-30 04:33:20,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:20,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:20,787 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:20,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:20,808 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:20,809 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-30 04:33:20,809 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-11-30 04:33:20,809 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-30 04:33:20,809 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-30 04:33:20,809 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-11-30 04:33:20,809 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-11-30 04:33:20,809 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:33:20,809 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:20,810 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:20,810 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 04:33:20,836 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:20,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 177 places, 184 transitions, 424 flow [2023-11-30 04:33:20,847 INFO L124 PetriNetUnfolderBase]: 17/181 cut-off events. [2023-11-30 04:33:20,848 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 04:33:20,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 181 events. 17/181 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 432 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 197. Up to 10 conditions per place. [2023-11-30 04:33:20,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 177 places, 184 transitions, 424 flow [2023-11-30 04:33:20,849 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 123 transitions, 277 flow [2023-11-30 04:33:20,850 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:20,850 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10983c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:20,850 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-30 04:33:20,851 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:20,852 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 04:33:20,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:20,852 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:20,852 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:20,852 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:20,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:20,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1782199162, now seen corresponding path program 1 times [2023-11-30 04:33:20,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:20,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469421655] [2023-11-30 04:33:20,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:20,871 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-30 04:33:20,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469421655] [2023-11-30 04:33:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469421655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411827455] [2023-11-30 04:33:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:20,872 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:20,873 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 184 [2023-11-30 04:33:20,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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-30 04:33:20,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:20,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 184 [2023-11-30 04:33:20,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:21,827 INFO L124 PetriNetUnfolderBase]: 4681/9021 cut-off events. [2023-11-30 04:33:21,827 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2023-11-30 04:33:21,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15233 conditions, 9021 events. 4681/9021 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 69645 event pairs, 3040 based on Foata normal form. 4208/12622 useless extension candidates. Maximal degree in co-relation 15190. Up to 5652 conditions per place. [2023-11-30 04:33:21,887 INFO L140 encePairwiseOnDemand]: 167/184 looper letters, 24 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:33:21,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 89 transitions, 259 flow [2023-11-30 04:33:21,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-11-30 04:33:21,889 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6992753623188406 [2023-11-30 04:33:21,889 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-11-30 04:33:21,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-11-30 04:33:21,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:21,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-11-30 04:33:21,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 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-30 04:33:21,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:33:21,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:33:21,891 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2023-11-30 04:33:21,891 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 259 flow [2023-11-30 04:33:21,892 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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-30 04:33:21,892 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:21,892 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:21,892 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:33:21,892 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:21,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1782199163, now seen corresponding path program 1 times [2023-11-30 04:33:21,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:21,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515528072] [2023-11-30 04:33:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:21,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:21,925 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-30 04:33:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:21,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515528072] [2023-11-30 04:33:21,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515528072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:21,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:21,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318008073] [2023-11-30 04:33:21,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:21,926 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:21,927 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 184 [2023-11-30 04:33:21,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-30 04:33:21,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:21,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 184 [2023-11-30 04:33:21,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:22,582 INFO L124 PetriNetUnfolderBase]: 3040/6169 cut-off events. [2023-11-30 04:33:22,582 INFO L125 PetriNetUnfolderBase]: For 2196/2754 co-relation queries the response was YES. [2023-11-30 04:33:22,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14028 conditions, 6169 events. 3040/6169 cut-off events. For 2196/2754 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 46129 event pairs, 1946 based on Foata normal form. 0/5927 useless extension candidates. Maximal degree in co-relation 13979. Up to 3647 conditions per place. [2023-11-30 04:33:22,631 INFO L140 encePairwiseOnDemand]: 181/184 looper letters, 21 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-11-30 04:33:22,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 87 transitions, 295 flow [2023-11-30 04:33:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-30 04:33:22,633 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6739130434782609 [2023-11-30 04:33:22,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-30 04:33:22,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-30 04:33:22,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:22,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-30 04:33:22,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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-30 04:33:22,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:33:22,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:33:22,635 INFO L307 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2023-11-30 04:33:22,635 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 295 flow [2023-11-30 04:33:22,635 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 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-30 04:33:22,636 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:22,636 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:22,636 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:33:22,636 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:22,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:22,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1293118267, now seen corresponding path program 1 times [2023-11-30 04:33:22,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468916509] [2023-11-30 04:33:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:22,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:22,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:22,660 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:22,660 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-30 04:33:22,660 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-11-30 04:33:22,660 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-30 04:33:22,660 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-30 04:33:22,660 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-11-30 04:33:22,661 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-11-30 04:33:22,661 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:33:22,661 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:22,661 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:22,661 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 04:33:22,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:22,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 219 transitions, 518 flow [2023-11-30 04:33:22,700 INFO L124 PetriNetUnfolderBase]: 20/211 cut-off events. [2023-11-30 04:33:22,700 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 04:33:22,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 211 events. 20/211 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 521 event pairs, 0 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 233. Up to 12 conditions per place. [2023-11-30 04:33:22,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 219 transitions, 518 flow [2023-11-30 04:33:22,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 138 transitions, 319 flow [2023-11-30 04:33:22,703 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:22,704 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10983c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:22,704 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-30 04:33:22,705 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:22,705 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 04:33:22,705 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:22,705 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:22,705 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:22,705 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:22,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2142923979, now seen corresponding path program 1 times [2023-11-30 04:33:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:22,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480206111] [2023-11-30 04:33:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:22,725 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-30 04:33:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:22,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480206111] [2023-11-30 04:33:22,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480206111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:22,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:22,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:22,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608417213] [2023-11-30 04:33:22,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:22,726 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:22,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:22,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:22,727 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 219 [2023-11-30 04:33:22,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 138 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-30 04:33:22,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:22,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 219 [2023-11-30 04:33:22,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:25,952 INFO L124 PetriNetUnfolderBase]: 17317/30324 cut-off events. [2023-11-30 04:33:25,952 INFO L125 PetriNetUnfolderBase]: For 6530/6530 co-relation queries the response was YES. [2023-11-30 04:33:26,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52575 conditions, 30324 events. 17317/30324 cut-off events. For 6530/6530 co-relation queries the response was YES. Maximal size of possible extension queue 1094. Compared 253394 event pairs, 11302 based on Foata normal form. 14819/43321 useless extension candidates. Maximal degree in co-relation 52531. Up to 20232 conditions per place. [2023-11-30 04:33:26,268 INFO L140 encePairwiseOnDemand]: 200/219 looper letters, 27 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2023-11-30 04:33:26,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 100 transitions, 299 flow [2023-11-30 04:33:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2023-11-30 04:33:26,270 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.69558599695586 [2023-11-30 04:33:26,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2023-11-30 04:33:26,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2023-11-30 04:33:26,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:26,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2023-11-30 04:33:26,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 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-30 04:33:26,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-30 04:33:26,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-30 04:33:26,274 INFO L307 CegarLoopForPetriNet]: 137 programPoint places, -27 predicate places. [2023-11-30 04:33:26,274 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 299 flow [2023-11-30 04:33:26,275 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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-30 04:33:26,275 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:26,275 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:26,275 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:33:26,275 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:26,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:26,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2142923978, now seen corresponding path program 1 times [2023-11-30 04:33:26,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:26,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737447619] [2023-11-30 04:33:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:26,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:26,314 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-30 04:33:26,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:26,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737447619] [2023-11-30 04:33:26,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737447619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:26,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:26,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820461646] [2023-11-30 04:33:26,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:26,315 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:26,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:26,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:26,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:26,316 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 219 [2023-11-30 04:33:26,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 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-30 04:33:26,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:26,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 219 [2023-11-30 04:33:26,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:28,449 INFO L124 PetriNetUnfolderBase]: 11302/20668 cut-off events. [2023-11-30 04:33:28,450 INFO L125 PetriNetUnfolderBase]: For 9081/10773 co-relation queries the response was YES. [2023-11-30 04:33:28,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48940 conditions, 20668 events. 11302/20668 cut-off events. For 9081/10773 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 171190 event pairs, 7292 based on Foata normal form. 0/19940 useless extension candidates. Maximal degree in co-relation 48890. Up to 13124 conditions per place. [2023-11-30 04:33:28,668 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 24 selfloop transitions, 1 changer transitions 0/98 dead transitions. [2023-11-30 04:33:28,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 98 transitions, 341 flow [2023-11-30 04:33:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-11-30 04:33:28,669 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6712328767123288 [2023-11-30 04:33:28,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-11-30 04:33:28,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-11-30 04:33:28,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:28,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-11-30 04:33:28,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 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-30 04:33:28,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-30 04:33:28,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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-30 04:33:28,672 INFO L307 CegarLoopForPetriNet]: 137 programPoint places, -27 predicate places. [2023-11-30 04:33:28,672 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 98 transitions, 341 flow [2023-11-30 04:33:28,672 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 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-30 04:33:28,672 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:28,673 INFO L232 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:28,673 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:33:28,673 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:28,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1778195632, now seen corresponding path program 1 times [2023-11-30 04:33:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190146168] [2023-11-30 04:33:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:28,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:28,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:28,710 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:28,710 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-30 04:33:28,710 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-11-30 04:33:28,710 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-30 04:33:28,710 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-30 04:33:28,710 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-11-30 04:33:28,711 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-11-30 04:33:28,711 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:33:28,711 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:28,711 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:28,711 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-30 04:33:28,744 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:28,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 254 transitions, 616 flow [2023-11-30 04:33:28,762 INFO L124 PetriNetUnfolderBase]: 23/241 cut-off events. [2023-11-30 04:33:28,762 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-30 04:33:28,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 241 events. 23/241 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 577 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 270. Up to 14 conditions per place. [2023-11-30 04:33:28,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 254 transitions, 616 flow [2023-11-30 04:33:28,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 153 transitions, 363 flow [2023-11-30 04:33:28,765 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:28,766 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10983c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:28,766 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-30 04:33:28,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:28,767 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 04:33:28,767 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:28,767 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:28,767 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:28,767 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:28,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:28,767 INFO L85 PathProgramCache]: Analyzing trace with hash -419598605, now seen corresponding path program 1 times [2023-11-30 04:33:28,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:28,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018545697] [2023-11-30 04:33:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:28,819 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-30 04:33:28,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:28,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018545697] [2023-11-30 04:33:28,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018545697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:28,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:28,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:28,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837556823] [2023-11-30 04:33:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:28,820 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:28,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:28,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:28,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:28,821 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 254 [2023-11-30 04:33:28,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 153 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-30 04:33:28,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:28,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 254 [2023-11-30 04:33:28,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:39,766 INFO L124 PetriNetUnfolderBase]: 61786/100794 cut-off events. [2023-11-30 04:33:39,766 INFO L125 PetriNetUnfolderBase]: For 28886/28886 co-relation queries the response was YES. [2023-11-30 04:33:40,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178450 conditions, 100794 events. 61786/100794 cut-off events. For 28886/28886 co-relation queries the response was YES. Maximal size of possible extension queue 3101. Compared 894974 event pairs, 40462 based on Foata normal form. 51026/146353 useless extension candidates. Maximal degree in co-relation 178405. Up to 70533 conditions per place. [2023-11-30 04:33:41,375 INFO L140 encePairwiseOnDemand]: 233/254 looper letters, 30 selfloop transitions, 1 changer transitions 0/111 dead transitions. [2023-11-30 04:33:41,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 111 transitions, 341 flow [2023-11-30 04:33:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2023-11-30 04:33:41,393 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6929133858267716 [2023-11-30 04:33:41,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 528 transitions. [2023-11-30 04:33:41,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 528 transitions. [2023-11-30 04:33:41,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:41,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 528 transitions. [2023-11-30 04:33:41,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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-30 04:33:41,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-30 04:33:41,396 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-30 04:33:41,397 INFO L307 CegarLoopForPetriNet]: 152 programPoint places, -30 predicate places. [2023-11-30 04:33:41,397 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 111 transitions, 341 flow [2023-11-30 04:33:41,397 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 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-30 04:33:41,397 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:41,397 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:41,397 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:33:41,397 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:41,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -419598604, now seen corresponding path program 1 times [2023-11-30 04:33:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312187671] [2023-11-30 04:33:41,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:41,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:41,458 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-30 04:33:41,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:41,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312187671] [2023-11-30 04:33:41,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312187671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:41,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319586789] [2023-11-30 04:33:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:41,460 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:41,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:41,461 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 254 [2023-11-30 04:33:41,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 111 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 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-30 04:33:41,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:41,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 254 [2023-11-30 04:33:41,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:33:49,337 INFO L124 PetriNetUnfolderBase]: 40462/68539 cut-off events. [2023-11-30 04:33:49,338 INFO L125 PetriNetUnfolderBase]: For 36540/41634 co-relation queries the response was YES. [2023-11-30 04:33:49,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167525 conditions, 68539 events. 40462/68539 cut-off events. For 36540/41634 co-relation queries the response was YES. Maximal size of possible extension queue 2180. Compared 606659 event pairs, 26246 based on Foata normal form. 0/66353 useless extension candidates. Maximal degree in co-relation 167474. Up to 45929 conditions per place. [2023-11-30 04:33:50,600 INFO L140 encePairwiseOnDemand]: 251/254 looper letters, 27 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2023-11-30 04:33:50,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 109 transitions, 389 flow [2023-11-30 04:33:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:33:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:33:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-11-30 04:33:50,602 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6692913385826772 [2023-11-30 04:33:50,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-11-30 04:33:50,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-11-30 04:33:50,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:33:50,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-11-30 04:33:50,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:33:50,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-30 04:33:50,604 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 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-30 04:33:50,604 INFO L307 CegarLoopForPetriNet]: 152 programPoint places, -30 predicate places. [2023-11-30 04:33:50,604 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 389 flow [2023-11-30 04:33:50,604 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 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-30 04:33:50,604 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:50,605 INFO L232 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:50,605 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:33:50,605 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:50,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash 236054911, now seen corresponding path program 1 times [2023-11-30 04:33:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726176371] [2023-11-30 04:33:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:50,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:33:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:33:50,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:33:50,636 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:33:50,636 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-30 04:33:50,636 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-11-30 04:33:50,637 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-30 04:33:50,637 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-30 04:33:50,637 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-11-30 04:33:50,637 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-11-30 04:33:50,637 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 04:33:50,637 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:33:50,638 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:33:50,638 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-11-30 04:33:50,667 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:33:50,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 289 transitions, 718 flow [2023-11-30 04:33:50,684 INFO L124 PetriNetUnfolderBase]: 26/271 cut-off events. [2023-11-30 04:33:50,684 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-30 04:33:50,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 271 events. 26/271 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 645 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 308. Up to 16 conditions per place. [2023-11-30 04:33:50,685 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 289 transitions, 718 flow [2023-11-30 04:33:50,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 168 transitions, 409 flow [2023-11-30 04:33:50,686 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:33:50,687 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10983c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:33:50,687 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-30 04:33:50,687 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:33:50,687 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 04:33:50,688 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:33:50,688 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:33:50,688 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:33:50,688 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:33:50,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:33:50,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1637759308, now seen corresponding path program 1 times [2023-11-30 04:33:50,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:33:50,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174860933] [2023-11-30 04:33:50,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:33:50,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:33:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:33:50,704 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-30 04:33:50,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:33:50,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174860933] [2023-11-30 04:33:50,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174860933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:33:50,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:33:50,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:33:50,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387439289] [2023-11-30 04:33:50,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:33:50,704 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:33:50,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:33:50,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:33:50,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:33:50,705 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 289 [2023-11-30 04:33:50,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 168 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 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-30 04:33:50,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:33:50,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 289 [2023-11-30 04:33:50,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:34:29,973 INFO L124 PetriNetUnfolderBase]: 214876/331887 cut-off events. [2023-11-30 04:34:29,974 INFO L125 PetriNetUnfolderBase]: For 120011/120011 co-relation queries the response was YES. [2023-11-30 04:34:33,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597626 conditions, 331887 events. 214876/331887 cut-off events. For 120011/120011 co-relation queries the response was YES. Maximal size of possible extension queue 8853. Compared 3075679 event pairs, 141064 based on Foata normal form. 172769/488254 useless extension candidates. Maximal degree in co-relation 597580. Up to 241119 conditions per place. [2023-11-30 04:34:36,535 INFO L140 encePairwiseOnDemand]: 266/289 looper letters, 33 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2023-11-30 04:34:36,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 122 transitions, 385 flow [2023-11-30 04:34:36,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:34:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:34:36,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 599 transitions. [2023-11-30 04:34:36,537 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6908881199538639 [2023-11-30 04:34:36,537 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 599 transitions. [2023-11-30 04:34:36,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 599 transitions. [2023-11-30 04:34:36,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:34:36,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 599 transitions. [2023-11-30 04:34:36,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.66666666666666) internal successors, (599), 3 states have internal predecessors, (599), 0 states have call successors, (0), 0 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-30 04:34:36,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 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-30 04:34:36,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 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-30 04:34:36,540 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -33 predicate places. [2023-11-30 04:34:36,540 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 122 transitions, 385 flow [2023-11-30 04:34:36,540 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 0 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-30 04:34:36,541 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:34:36,541 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:34:36,541 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 04:34:36,541 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:34:36,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:34:36,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1637759307, now seen corresponding path program 1 times [2023-11-30 04:34:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:34:36,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210799217] [2023-11-30 04:34:36,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:34:36,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:34:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:34:36,570 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-30 04:34:36,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:34:36,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210799217] [2023-11-30 04:34:36,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210799217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:34:36,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:34:36,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:34:36,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483935780] [2023-11-30 04:34:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:34:36,571 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:34:36,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:34:36,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:34:36,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:34:36,571 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 289 [2023-11-30 04:34:36,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 122 transitions, 385 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 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-30 04:34:36,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:34:36,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 289 [2023-11-30 04:34:36,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:35:11,881 INFO L124 PetriNetUnfolderBase]: 141064/225274 cut-off events. [2023-11-30 04:35:11,882 INFO L125 PetriNetUnfolderBase]: For 142974/158274 co-relation queries the response was YES. [2023-11-30 04:35:14,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564831 conditions, 225274 events. 141064/225274 cut-off events. For 142974/158274 co-relation queries the response was YES. Maximal size of possible extension queue 6219. Compared 2110808 event pairs, 91856 based on Foata normal form. 0/218714 useless extension candidates. Maximal degree in co-relation 564779. Up to 157466 conditions per place. [2023-11-30 04:35:16,520 INFO L140 encePairwiseOnDemand]: 286/289 looper letters, 30 selfloop transitions, 1 changer transitions 0/120 dead transitions. [2023-11-30 04:35:16,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 120 transitions, 439 flow [2023-11-30 04:35:16,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:35:16,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:35:16,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-11-30 04:35:16,522 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6678200692041523 [2023-11-30 04:35:16,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-11-30 04:35:16,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-11-30 04:35:16,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:35:16,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-11-30 04:35:16,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 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-30 04:35:16,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 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-30 04:35:16,546 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 289.0) internal successors, (1156), 4 states have internal predecessors, (1156), 0 states have call successors, (0), 0 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-30 04:35:16,546 INFO L307 CegarLoopForPetriNet]: 167 programPoint places, -33 predicate places. [2023-11-30 04:35:16,546 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 120 transitions, 439 flow [2023-11-30 04:35:16,546 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 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-30 04:35:16,546 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:16,547 INFO L232 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:16,547 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 04:35:16,547 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:35:16,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash -51022127, now seen corresponding path program 1 times [2023-11-30 04:35:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:16,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81555170] [2023-11-30 04:35:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:16,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:35:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:35:16,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:35:16,579 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:35:16,579 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-11-30 04:35:16,579 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 6 remaining) [2023-11-30 04:35:16,579 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 6 remaining) [2023-11-30 04:35:16,580 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 6 remaining) [2023-11-30 04:35:16,580 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 6 remaining) [2023-11-30 04:35:16,580 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2023-11-30 04:35:16,580 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 04:35:16,580 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:35:16,580 WARN L227 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:35:16,580 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2023-11-30 04:35:16,618 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:35:16,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 309 places, 324 transitions, 824 flow [2023-11-30 04:35:16,643 INFO L124 PetriNetUnfolderBase]: 29/301 cut-off events. [2023-11-30 04:35:16,643 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-30 04:35:16,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 301 events. 29/301 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 731 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 347. Up to 18 conditions per place. [2023-11-30 04:35:16,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 309 places, 324 transitions, 824 flow [2023-11-30 04:35:16,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 183 transitions, 457 flow [2023-11-30 04:35:16,649 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:35:16,649 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10983c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:35:16,649 INFO L363 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-30 04:35:16,650 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:35:16,650 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-30 04:35:16,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:35:16,650 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:35:16,650 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:35:16,650 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 3 more)] === [2023-11-30 04:35:16,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:35:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1502438792, now seen corresponding path program 1 times [2023-11-30 04:35:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:35:16,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189468668] [2023-11-30 04:35:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:35:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:35:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:35:16,669 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-30 04:35:16,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:35:16,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189468668] [2023-11-30 04:35:16,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189468668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:35:16,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:35:16,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:35:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654525822] [2023-11-30 04:35:16,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:35:16,670 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:35:16,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:35:16,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:35:16,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:35:16,671 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 324 [2023-11-30 04:35:16,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 183 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 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-30 04:35:16,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:35:16,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 324 [2023-11-30 04:35:16,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand