/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --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/39_rand_lock_p0_vs-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:04:49,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:04:49,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:04:49,247 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:04:49,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:04:49,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:04:49,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:04:49,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:04:49,250 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:04:49,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:04:49,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:04:49,251 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:04:49,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:04:49,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:04:49,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:04:49,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:04:49,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:04:49,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:04:49,253 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:04:49,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:04:49,253 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:04:49,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:04:49,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:04:49,257 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:04:49,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:04:49,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:49,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:04:49,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:04:49,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:04:49,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:04:49,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:04:49,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:04:49,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:04:49,265 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-12-05 21:04:49,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:04:49,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:04:49,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:04:49,505 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:04:49,506 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:04:49,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i [2023-12-05 21:04:50,724 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:04:50,932 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:04:50,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/39_rand_lock_p0_vs-pthread.i [2023-12-05 21:04:50,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367e655fc/f0978352c19d48b68d384c2a61a0d778/FLAGf69830781 [2023-12-05 21:04:50,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367e655fc/f0978352c19d48b68d384c2a61a0d778 [2023-12-05 21:04:50,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:04:50,960 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:04:50,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:50,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:04:50,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:04:50,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:50" (1/1) ... [2023-12-05 21:04:50,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48273f3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:50, skipping insertion in model container [2023-12-05 21:04:50,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:04:50" (1/1) ... [2023-12-05 21:04:51,021 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:04:51,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:51,282 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:04:51,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:04:51,385 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:04:51,385 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:04:51,390 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:04:51,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51 WrapperNode [2023-12-05 21:04:51,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:04:51,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:51,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:04:51,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:04:51,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,424 INFO L138 Inliner]: procedures = 167, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2023-12-05 21:04:51,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:04:51,425 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:04:51,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:04:51,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:04:51,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:04:51,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:04:51,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:04:51,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:04:51,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (1/1) ... [2023-12-05 21:04:51,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:04:51,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:04:51,687 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:04:51,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:04:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:04:51,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:04:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:04:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:04:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:04:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:04:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:04:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:04:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:04:51,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:04:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:04:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:04:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:04:51,716 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:04:51,828 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:04:51,830 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:04:51,957 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:04:51,982 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:04:51,982 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-05 21:04:51,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:51 BoogieIcfgContainer [2023-12-05 21:04:51,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:04:51,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:04:51,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:04:51,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:04:51,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:04:50" (1/3) ... [2023-12-05 21:04:51,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188bf77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:51, skipping insertion in model container [2023-12-05 21:04:51,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:04:51" (2/3) ... [2023-12-05 21:04:51,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@188bf77c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:04:51, skipping insertion in model container [2023-12-05 21:04:51,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:04:51" (3/3) ... [2023-12-05 21:04:51,990 INFO L112 eAbstractionObserver]: Analyzing ICFG 39_rand_lock_p0_vs-pthread.i [2023-12-05 21:04:52,009 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:04:52,010 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 21:04:52,010 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:04:52,090 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:52,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 74 transitions, 152 flow [2023-12-05 21:04:52,183 INFO L124 PetriNetUnfolderBase]: 4/87 cut-off events. [2023-12-05 21:04:52,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:52,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 87 events. 4/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 55. Up to 4 conditions per place. [2023-12-05 21:04:52,188 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 74 transitions, 152 flow [2023-12-05 21:04:52,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 74 transitions, 152 flow [2023-12-05 21:04:52,199 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:52,206 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;@1c294943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:52,206 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:52,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:52,214 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:04:52,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:52,214 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:52,215 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:52,215 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:52,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1523443686, now seen corresponding path program 1 times [2023-12-05 21:04:52,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:52,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096803583] [2023-12-05 21:04:52,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:52,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:52,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096803583] [2023-12-05 21:04:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096803583] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:52,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:52,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905779960] [2023-12-05 21:04:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:52,500 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:52,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:52,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:52,526 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 74 [2023-12-05 21:04:52,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 74 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:52,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 74 [2023-12-05 21:04:52,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:52,590 INFO L124 PetriNetUnfolderBase]: 9/143 cut-off events. [2023-12-05 21:04:52,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:52,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 143 events. 9/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs, 6 based on Foata normal form. 8/141 useless extension candidates. Maximal degree in co-relation 135. Up to 21 conditions per place. [2023-12-05 21:04:52,593 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 11 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2023-12-05 21:04:52,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 158 flow [2023-12-05 21:04:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2023-12-05 21:04:52,610 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8153153153153153 [2023-12-05 21:04:52,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 181 transitions. [2023-12-05 21:04:52,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 181 transitions. [2023-12-05 21:04:52,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:52,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 181 transitions. [2023-12-05 21:04:52,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,627 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,633 INFO L308 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-12-05 21:04:52,634 INFO L500 AbstractCegarLoop]: Abstraction has has 69 places, 65 transitions, 158 flow [2023-12-05 21:04:52,634 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,634 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:52,635 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:52,635 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:04:52,635 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:52,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:52,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1523443685, now seen corresponding path program 1 times [2023-12-05 21:04:52,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:52,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772323658] [2023-12-05 21:04:52,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:52,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:52,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:52,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772323658] [2023-12-05 21:04:52,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772323658] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:52,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:52,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:52,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346357432] [2023-12-05 21:04:52,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:52,771 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:52,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:52,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:52,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:52,772 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 74 [2023-12-05 21:04:52,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 65 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:52,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 74 [2023-12-05 21:04:52,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:52,822 INFO L124 PetriNetUnfolderBase]: 5/105 cut-off events. [2023-12-05 21:04:52,822 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2023-12-05 21:04:52,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 105 events. 5/105 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 3 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 101. Up to 13 conditions per place. [2023-12-05 21:04:52,825 INFO L140 encePairwiseOnDemand]: 72/74 looper letters, 9 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-12-05 21:04:52,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 64 transitions, 174 flow [2023-12-05 21:04:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 179 transitions. [2023-12-05 21:04:52,829 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8063063063063063 [2023-12-05 21:04:52,829 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 179 transitions. [2023-12-05 21:04:52,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 179 transitions. [2023-12-05 21:04:52,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:52,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 179 transitions. [2023-12-05 21:04:52,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,833 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,833 INFO L308 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-12-05 21:04:52,834 INFO L500 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 174 flow [2023-12-05 21:04:52,834 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:52,834 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:52,834 INFO L233 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] [2023-12-05 21:04:52,834 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:04:52,834 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:52,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:52,835 INFO L85 PathProgramCache]: Analyzing trace with hash 933454952, now seen corresponding path program 1 times [2023-12-05 21:04:52,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:52,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667045164] [2023-12-05 21:04:52,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:52,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:52,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:52,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:52,904 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:52,905 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:52,906 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:52,907 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:52,907 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:04:52,907 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:52,910 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:52,910 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:04:52,939 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:52,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 115 transitions, 240 flow [2023-12-05 21:04:52,963 INFO L124 PetriNetUnfolderBase]: 7/143 cut-off events. [2023-12-05 21:04:52,963 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:04:52,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 143 events. 7/143 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 237 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 95. Up to 6 conditions per place. [2023-12-05 21:04:52,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 115 transitions, 240 flow [2023-12-05 21:04:52,977 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 115 transitions, 240 flow [2023-12-05 21:04:52,987 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:52,988 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;@1c294943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:52,988 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:52,991 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:52,992 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 21:04:52,992 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:52,992 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:52,992 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:52,992 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:52,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2117253325, now seen corresponding path program 1 times [2023-12-05 21:04:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:52,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913226677] [2023-12-05 21:04:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:52,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:53,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:53,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913226677] [2023-12-05 21:04:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913226677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925833744] [2023-12-05 21:04:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:53,072 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:53,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:53,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:53,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:53,073 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2023-12-05 21:04:53,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 115 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:53,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2023-12-05 21:04:53,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:53,211 INFO L124 PetriNetUnfolderBase]: 87/815 cut-off events. [2023-12-05 21:04:53,212 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-12-05 21:04:53,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 815 events. 87/815 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5116 event pairs, 66 based on Foata normal form. 44/806 useless extension candidates. Maximal degree in co-relation 611. Up to 129 conditions per place. [2023-12-05 21:04:53,219 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 15 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2023-12-05 21:04:53,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 105 transitions, 252 flow [2023-12-05 21:04:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-12-05 21:04:53,222 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8521739130434782 [2023-12-05 21:04:53,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-12-05 21:04:53,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-12-05 21:04:53,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:53,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-12-05 21:04:53,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,227 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,229 INFO L308 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2023-12-05 21:04:53,229 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 105 transitions, 252 flow [2023-12-05 21:04:53,230 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,230 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:53,230 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:53,230 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:04:53,230 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:53,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:53,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2117253326, now seen corresponding path program 1 times [2023-12-05 21:04:53,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:53,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181915354] [2023-12-05 21:04:53,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:53,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:53,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181915354] [2023-12-05 21:04:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181915354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:53,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:53,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:53,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355163350] [2023-12-05 21:04:53,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:53,345 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:53,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:53,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:53,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:53,347 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2023-12-05 21:04:53,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 105 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:53,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2023-12-05 21:04:53,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:53,477 INFO L124 PetriNetUnfolderBase]: 53/557 cut-off events. [2023-12-05 21:04:53,478 INFO L125 PetriNetUnfolderBase]: For 43/59 co-relation queries the response was YES. [2023-12-05 21:04:53,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 557 events. 53/557 cut-off events. For 43/59 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2893 event pairs, 39 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 449. Up to 81 conditions per place. [2023-12-05 21:04:53,481 INFO L140 encePairwiseOnDemand]: 113/115 looper letters, 13 selfloop transitions, 1 changer transitions 0/104 dead transitions. [2023-12-05 21:04:53,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 104 transitions, 276 flow [2023-12-05 21:04:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-12-05 21:04:53,482 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8434782608695652 [2023-12-05 21:04:53,482 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-12-05 21:04:53,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-12-05 21:04:53,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:53,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-12-05 21:04:53,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,486 INFO L308 CegarLoopForPetriNet]: 115 programPoint places, -4 predicate places. [2023-12-05 21:04:53,486 INFO L500 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 276 flow [2023-12-05 21:04:53,487 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,487 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:53,487 INFO L233 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] [2023-12-05 21:04:53,487 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:04:53,487 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:53,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:53,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1316335805, now seen corresponding path program 1 times [2023-12-05 21:04:53,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:53,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216523287] [2023-12-05 21:04:53,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:53,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:53,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:53,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:53,541 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:53,541 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:53,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:53,545 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:53,545 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:04:53,546 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:53,547 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:53,549 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:04:53,594 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:53,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 156 transitions, 330 flow [2023-12-05 21:04:53,631 INFO L124 PetriNetUnfolderBase]: 10/199 cut-off events. [2023-12-05 21:04:53,631 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:04:53,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 199 events. 10/199 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 486 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 147. Up to 8 conditions per place. [2023-12-05 21:04:53,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 156 transitions, 330 flow [2023-12-05 21:04:53,638 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 156 transitions, 330 flow [2023-12-05 21:04:53,639 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:53,642 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;@1c294943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:53,642 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:53,645 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:53,645 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 21:04:53,645 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:53,645 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:53,646 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:53,646 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:53,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:53,646 INFO L85 PathProgramCache]: Analyzing trace with hash 109295209, now seen corresponding path program 1 times [2023-12-05 21:04:53,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984460895] [2023-12-05 21:04:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:53,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:53,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984460895] [2023-12-05 21:04:53,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984460895] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:53,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:53,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773885998] [2023-12-05 21:04:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:53,688 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:53,690 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 156 [2023-12-05 21:04:53,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 156 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:53,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:53,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 156 [2023-12-05 21:04:53,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:54,224 INFO L124 PetriNetUnfolderBase]: 543/3651 cut-off events. [2023-12-05 21:04:54,224 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2023-12-05 21:04:54,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 3651 events. 543/3651 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 34964 event pairs, 450 based on Foata normal form. 229/3628 useless extension candidates. Maximal degree in co-relation 959. Up to 705 conditions per place. [2023-12-05 21:04:54,258 INFO L140 encePairwiseOnDemand]: 149/156 looper letters, 19 selfloop transitions, 1 changer transitions 0/145 dead transitions. [2023-12-05 21:04:54,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 145 transitions, 348 flow [2023-12-05 21:04:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-12-05 21:04:54,260 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8696581196581197 [2023-12-05 21:04:54,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-12-05 21:04:54,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-12-05 21:04:54,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:54,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-12-05 21:04:54,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,265 INFO L308 CegarLoopForPetriNet]: 156 programPoint places, -5 predicate places. [2023-12-05 21:04:54,265 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 145 transitions, 348 flow [2023-12-05 21:04:54,265 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,266 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:54,266 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:54,266 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:04:54,266 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:54,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:54,266 INFO L85 PathProgramCache]: Analyzing trace with hash 109295210, now seen corresponding path program 1 times [2023-12-05 21:04:54,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:54,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558745123] [2023-12-05 21:04:54,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:54,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:54,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558745123] [2023-12-05 21:04:54,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558745123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:54,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:54,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53894883] [2023-12-05 21:04:54,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:54,335 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:54,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:54,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:54,337 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 156 [2023-12-05 21:04:54,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 145 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:54,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 156 [2023-12-05 21:04:54,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:54,694 INFO L124 PetriNetUnfolderBase]: 341/2465 cut-off events. [2023-12-05 21:04:54,694 INFO L125 PetriNetUnfolderBase]: For 277/571 co-relation queries the response was YES. [2023-12-05 21:04:54,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 2465 events. 341/2465 cut-off events. For 277/571 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21128 event pairs, 279 based on Foata normal form. 0/2354 useless extension candidates. Maximal degree in co-relation 738. Up to 449 conditions per place. [2023-12-05 21:04:54,713 INFO L140 encePairwiseOnDemand]: 154/156 looper letters, 17 selfloop transitions, 1 changer transitions 0/144 dead transitions. [2023-12-05 21:04:54,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 144 transitions, 380 flow [2023-12-05 21:04:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-12-05 21:04:54,715 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2023-12-05 21:04:54,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-12-05 21:04:54,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-12-05 21:04:54,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:54,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-12-05 21:04:54,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,719 INFO L308 CegarLoopForPetriNet]: 156 programPoint places, -4 predicate places. [2023-12-05 21:04:54,720 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 144 transitions, 380 flow [2023-12-05 21:04:54,720 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,720 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:54,720 INFO L233 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] [2023-12-05 21:04:54,720 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:04:54,721 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:54,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:54,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1912146838, now seen corresponding path program 1 times [2023-12-05 21:04:54,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:54,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794808172] [2023-12-05 21:04:54,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:54,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:54,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:54,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:54,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:54,750 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:54,750 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:54,750 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:54,750 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:54,750 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:04:54,751 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:54,751 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:54,751 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:04:54,782 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:54,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 197 transitions, 422 flow [2023-12-05 21:04:54,812 INFO L124 PetriNetUnfolderBase]: 13/255 cut-off events. [2023-12-05 21:04:54,812 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:04:54,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 255 events. 13/255 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 738 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 207. Up to 10 conditions per place. [2023-12-05 21:04:54,815 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 197 transitions, 422 flow [2023-12-05 21:04:54,817 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 197 transitions, 422 flow [2023-12-05 21:04:54,817 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:54,818 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;@1c294943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:54,818 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:54,820 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:54,820 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 21:04:54,820 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:54,820 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:54,820 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:54,820 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:54,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1042616558, now seen corresponding path program 1 times [2023-12-05 21:04:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:54,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910775002] [2023-12-05 21:04:54,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:54,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:54,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:54,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910775002] [2023-12-05 21:04:54,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910775002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:54,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:54,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:54,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719663043] [2023-12-05 21:04:54,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:54,847 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:54,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:54,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:54,848 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 197 [2023-12-05 21:04:54,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 197 transitions, 422 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:54,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:54,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 197 [2023-12-05 21:04:54,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:57,248 INFO L124 PetriNetUnfolderBase]: 2943/15571 cut-off events. [2023-12-05 21:04:57,249 INFO L125 PetriNetUnfolderBase]: For 1052/1052 co-relation queries the response was YES. [2023-12-05 21:04:57,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19565 conditions, 15571 events. 2943/15571 cut-off events. For 1052/1052 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 194064 event pairs, 2562 based on Foata normal form. 1161/15663 useless extension candidates. Maximal degree in co-relation 4439. Up to 3585 conditions per place. [2023-12-05 21:04:57,416 INFO L140 encePairwiseOnDemand]: 189/197 looper letters, 23 selfloop transitions, 1 changer transitions 0/185 dead transitions. [2023-12-05 21:04:57,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 185 transitions, 446 flow [2023-12-05 21:04:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2023-12-05 21:04:57,418 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8798646362098139 [2023-12-05 21:04:57,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2023-12-05 21:04:57,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2023-12-05 21:04:57,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:57,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2023-12-05 21:04:57,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:57,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:57,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:57,422 INFO L308 CegarLoopForPetriNet]: 197 programPoint places, -5 predicate places. [2023-12-05 21:04:57,422 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 185 transitions, 446 flow [2023-12-05 21:04:57,422 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:57,422 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:57,422 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:57,423 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:04:57,423 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:57,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1042616559, now seen corresponding path program 1 times [2023-12-05 21:04:57,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:57,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661888229] [2023-12-05 21:04:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:57,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:57,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661888229] [2023-12-05 21:04:57,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661888229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:57,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:57,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:57,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461567103] [2023-12-05 21:04:57,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:57,474 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:57,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:57,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:57,475 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 197 [2023-12-05 21:04:57,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 185 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:57,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:57,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 197 [2023-12-05 21:04:57,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:04:58,946 INFO L124 PetriNetUnfolderBase]: 1877/10481 cut-off events. [2023-12-05 21:04:58,946 INFO L125 PetriNetUnfolderBase]: For 1631/3619 co-relation queries the response was YES. [2023-12-05 21:04:59,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15505 conditions, 10481 events. 1877/10481 cut-off events. For 1631/3619 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 121495 event pairs, 1623 based on Foata normal form. 0/9992 useless extension candidates. Maximal degree in co-relation 3445. Up to 2305 conditions per place. [2023-12-05 21:04:59,066 INFO L140 encePairwiseOnDemand]: 195/197 looper letters, 21 selfloop transitions, 1 changer transitions 0/184 dead transitions. [2023-12-05 21:04:59,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 184 transitions, 486 flow [2023-12-05 21:04:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:04:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:04:59,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2023-12-05 21:04:59,068 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.871404399323181 [2023-12-05 21:04:59,068 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2023-12-05 21:04:59,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2023-12-05 21:04:59,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:04:59,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2023-12-05 21:04:59,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:59,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:59,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:59,071 INFO L308 CegarLoopForPetriNet]: 197 programPoint places, -4 predicate places. [2023-12-05 21:04:59,071 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 486 flow [2023-12-05 21:04:59,072 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:59,072 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:59,072 INFO L233 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] [2023-12-05 21:04:59,072 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:04:59,072 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:59,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1270948786, now seen corresponding path program 1 times [2023-12-05 21:04:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:59,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908611701] [2023-12-05 21:04:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:59,088 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:04:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:04:59,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:04:59,104 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:04:59,104 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:04:59,104 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:04:59,105 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:04:59,105 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:04:59,105 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:04:59,106 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:04:59,106 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:04:59,144 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:04:59,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 238 transitions, 516 flow [2023-12-05 21:04:59,188 INFO L124 PetriNetUnfolderBase]: 16/311 cut-off events. [2023-12-05 21:04:59,188 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:04:59,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 311 events. 16/311 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1005 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 268. Up to 12 conditions per place. [2023-12-05 21:04:59,191 INFO L82 GeneralOperation]: Start removeDead. Operand has 238 places, 238 transitions, 516 flow [2023-12-05 21:04:59,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 238 transitions, 516 flow [2023-12-05 21:04:59,194 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:04:59,195 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;@1c294943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:04:59,195 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:04:59,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:04:59,197 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:04:59,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:04:59,197 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:04:59,197 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:04:59,197 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:04:59,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:04:59,197 INFO L85 PathProgramCache]: Analyzing trace with hash 622250076, now seen corresponding path program 1 times [2023-12-05 21:04:59,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:04:59,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696705414] [2023-12-05 21:04:59,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:04:59,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:04:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:04:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:04:59,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:04:59,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696705414] [2023-12-05 21:04:59,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696705414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:04:59,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:04:59,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:04:59,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976614013] [2023-12-05 21:04:59,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:04:59,226 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:04:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:04:59,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:04:59,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:04:59,227 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 238 [2023-12-05 21:04:59,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 238 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:04:59,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:04:59,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 238 [2023-12-05 21:04:59,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:09,581 INFO L124 PetriNetUnfolderBase]: 14847/65555 cut-off events. [2023-12-05 21:05:09,581 INFO L125 PetriNetUnfolderBase]: For 6748/6748 co-relation queries the response was YES. [2023-12-05 21:05:10,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84910 conditions, 65555 events. 14847/65555 cut-off events. For 6748/6748 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 988120 event pairs, 13314 based on Foata normal form. 5657/66872 useless extension candidates. Maximal degree in co-relation 19623. Up to 17409 conditions per place. [2023-12-05 21:05:10,985 INFO L140 encePairwiseOnDemand]: 229/238 looper letters, 27 selfloop transitions, 1 changer transitions 0/225 dead transitions. [2023-12-05 21:05:10,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 225 transitions, 546 flow [2023-12-05 21:05:10,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2023-12-05 21:05:10,987 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8865546218487395 [2023-12-05 21:05:10,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 633 transitions. [2023-12-05 21:05:10,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 633 transitions. [2023-12-05 21:05:10,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:10,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 633 transitions. [2023-12-05 21:05:10,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:10,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:10,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:10,992 INFO L308 CegarLoopForPetriNet]: 238 programPoint places, -5 predicate places. [2023-12-05 21:05:10,993 INFO L500 AbstractCegarLoop]: Abstraction has has 233 places, 225 transitions, 546 flow [2023-12-05 21:05:10,993 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:10,993 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:10,993 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:10,993 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:05:10,993 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:10,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 622250077, now seen corresponding path program 1 times [2023-12-05 21:05:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:10,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325561579] [2023-12-05 21:05:10,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:05:11,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325561579] [2023-12-05 21:05:11,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325561579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:11,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:11,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816564786] [2023-12-05 21:05:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:11,047 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:11,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:11,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:11,048 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 238 [2023-12-05 21:05:11,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 225 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:11,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:11,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 238 [2023-12-05 21:05:11,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:18,024 INFO L124 PetriNetUnfolderBase]: 9557/44081 cut-off events. [2023-12-05 21:05:18,024 INFO L125 PetriNetUnfolderBase]: For 9098/17994 co-relation queries the response was YES. [2023-12-05 21:05:18,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68562 conditions, 44081 events. 9557/44081 cut-off events. For 9098/17994 co-relation queries the response was YES. Maximal size of possible extension queue 1176. Compared 630147 event pairs, 8535 based on Foata normal form. 0/42077 useless extension candidates. Maximal degree in co-relation 15557. Up to 11265 conditions per place. [2023-12-05 21:05:18,879 INFO L140 encePairwiseOnDemand]: 236/238 looper letters, 25 selfloop transitions, 1 changer transitions 0/224 dead transitions. [2023-12-05 21:05:18,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 224 transitions, 594 flow [2023-12-05 21:05:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2023-12-05 21:05:18,884 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8781512605042017 [2023-12-05 21:05:18,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2023-12-05 21:05:18,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2023-12-05 21:05:18,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:18,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2023-12-05 21:05:18,886 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:18,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:18,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:18,891 INFO L308 CegarLoopForPetriNet]: 238 programPoint places, -4 predicate places. [2023-12-05 21:05:18,891 INFO L500 AbstractCegarLoop]: Abstraction has has 234 places, 224 transitions, 594 flow [2023-12-05 21:05:18,891 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:18,891 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:18,891 INFO L233 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] [2023-12-05 21:05:18,891 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:05:18,892 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:18,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:18,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1085838120, now seen corresponding path program 1 times [2023-12-05 21:05:18,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:18,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753647897] [2023-12-05 21:05:18,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:18,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:18,923 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:18,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:18,964 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:18,964 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:18,964 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:18,965 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:18,965 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:05:18,965 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:18,966 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:18,966 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:05:19,021 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:19,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 279 transitions, 612 flow [2023-12-05 21:05:19,072 INFO L124 PetriNetUnfolderBase]: 19/367 cut-off events. [2023-12-05 21:05:19,072 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:05:19,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 367 events. 19/367 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1268 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 330. Up to 14 conditions per place. [2023-12-05 21:05:19,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 279 places, 279 transitions, 612 flow [2023-12-05 21:05:19,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 279 transitions, 612 flow [2023-12-05 21:05:19,082 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:19,082 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;@1c294943, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:19,082 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:19,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:19,084 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:05:19,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:19,084 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:19,084 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:19,084 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:19,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:19,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1151804237, now seen corresponding path program 1 times [2023-12-05 21:05:19,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:19,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296776913] [2023-12-05 21:05:19,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:19,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:05:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:19,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296776913] [2023-12-05 21:05:19,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296776913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:19,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:19,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098207845] [2023-12-05 21:05:19,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:19,233 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:19,234 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 279 [2023-12-05 21:05:19,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:19,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:19,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 279 [2023-12-05 21:05:19,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:29,195 INFO L124 PetriNetUnfolderBase]: 71679/274707 cut-off events. [2023-12-05 21:06:29,195 INFO L125 PetriNetUnfolderBase]: For 39516/39516 co-relation queries the response was YES. [2023-12-05 21:06:34,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365743 conditions, 274707 events. 71679/274707 cut-off events. For 39516/39516 co-relation queries the response was YES. Maximal size of possible extension queue 6803. Compared 4767333 event pairs, 65538 based on Foata normal form. 26713/283996 useless extension candidates. Maximal degree in co-relation 85223. Up to 81921 conditions per place. [2023-12-05 21:06:37,110 INFO L140 encePairwiseOnDemand]: 269/279 looper letters, 31 selfloop transitions, 1 changer transitions 0/265 dead transitions. [2023-12-05 21:06:37,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 265 transitions, 648 flow [2023-12-05 21:06:37,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:37,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2023-12-05 21:06:37,113 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8912783751493429 [2023-12-05 21:06:37,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 746 transitions. [2023-12-05 21:06:37,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 746 transitions. [2023-12-05 21:06:37,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:37,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 746 transitions. [2023-12-05 21:06:37,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:37,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:37,117 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:37,117 INFO L308 CegarLoopForPetriNet]: 279 programPoint places, -5 predicate places. [2023-12-05 21:06:37,118 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 265 transitions, 648 flow [2023-12-05 21:06:37,118 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:37,118 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:37,118 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:37,118 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:06:37,118 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:37,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:37,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1151804236, now seen corresponding path program 1 times [2023-12-05 21:06:37,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:37,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342383043] [2023-12-05 21:06:37,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:37,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:37,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342383043] [2023-12-05 21:06:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342383043] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:37,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379771913] [2023-12-05 21:06:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:37,161 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:37,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:37,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:37,163 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 279 [2023-12-05 21:06:37,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 265 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:37,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:37,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 279 [2023-12-05 21:06:37,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand