/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/14_spin2003-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:02:21,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:02:21,857 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:02:21,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:02:21,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:02:21,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:02:21,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:02:21,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:02:21,874 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:02:21,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:02:21,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:02:21,874 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:02:21,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:02:21,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:02:21,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:02:21,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:02:21,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:02:21,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:02:21,876 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:02:21,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:02:21,876 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:02:21,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:02:21,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:02:21,877 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:02:21,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:02:21,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:02:21,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:02:21,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:02:21,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:02:21,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:02:21,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:02:21,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:02:21,879 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:02:21,879 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:02:22,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:02:22,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:02:22,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:02:22,083 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:02:22,083 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:02:22,084 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i [2023-12-05 21:02:23,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:02:23,258 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:02:23,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/14_spin2003-pthread.i [2023-12-05 21:02:23,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20bb8dd2/e93653f4e4de42dbb06749cfae1cb2ad/FLAG03c9790c6 [2023-12-05 21:02:23,277 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e20bb8dd2/e93653f4e4de42dbb06749cfae1cb2ad [2023-12-05 21:02:23,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:02:23,280 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:02:23,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:02:23,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:02:23,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:02:23,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378b8ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23, skipping insertion in model container [2023-12-05 21:02:23,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,315 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:02:23,582 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:02:23,592 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:02:23,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:02:23,653 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:02:23,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23 WrapperNode [2023-12-05 21:02:23,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:02:23,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:02:23,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:02:23,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:02:23,661 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:02:23" (1/1) ... [2023-12-05 21:02:23,682 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:02:23" (1/1) ... [2023-12-05 21:02:23,709 INFO L138 Inliner]: procedures = 162, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 47 [2023-12-05 21:02:23,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:02:23,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:02:23,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:02:23,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:02:23,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,729 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,730 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:02:23,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:02:23,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:02:23,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:02:23,733 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (1/1) ... [2023-12-05 21:02:23,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:02:23,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:02:23,759 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:02:23,765 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:02:23,780 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:02:23,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:02:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:02:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:02:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:02:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:02:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:02:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:02:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:02:23,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:02:23,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:02:23,782 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:02:23,884 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:02:23,887 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:02:24,026 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:02:24,037 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:02:24,037 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-05 21:02:24,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:02:24 BoogieIcfgContainer [2023-12-05 21:02:24,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:02:24,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:02:24,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:02:24,042 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:02:24,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:02:23" (1/3) ... [2023-12-05 21:02:24,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c834b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:02:24, skipping insertion in model container [2023-12-05 21:02:24,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:23" (2/3) ... [2023-12-05 21:02:24,043 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c834b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:02:24, skipping insertion in model container [2023-12-05 21:02:24,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:02:24" (3/3) ... [2023-12-05 21:02:24,044 INFO L112 eAbstractionObserver]: Analyzing ICFG 14_spin2003-pthread.i [2023-12-05 21:02:24,056 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:02:24,056 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 21:02:24,057 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:02:24,115 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:24,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 52 transitions, 108 flow [2023-12-05 21:02:24,182 INFO L124 PetriNetUnfolderBase]: 4/65 cut-off events. [2023-12-05 21:02:24,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:24,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 65 events. 4/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 98 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2023-12-05 21:02:24,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 52 transitions, 108 flow [2023-12-05 21:02:24,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 52 transitions, 108 flow [2023-12-05 21:02:24,228 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:24,233 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;@23b4f297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:24,233 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:02:24,238 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:24,238 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:02:24,238 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:24,238 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:24,244 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:02:24,245 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:02:24,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -233101064, now seen corresponding path program 1 times [2023-12-05 21:02:24,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:24,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048811214] [2023-12-05 21:02:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:24,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:24,443 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:02:24,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:24,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048811214] [2023-12-05 21:02:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048811214] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:24,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:24,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:24,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456328094] [2023-12-05 21:02:24,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:24,451 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:24,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:24,471 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2023-12-05 21:02:24,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:02:24,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:24,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2023-12-05 21:02:24,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:24,498 INFO L124 PetriNetUnfolderBase]: 4/72 cut-off events. [2023-12-05 21:02:24,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:24,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 72 events. 4/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 4 based on Foata normal form. 10/74 useless extension candidates. Maximal degree in co-relation 60. Up to 16 conditions per place. [2023-12-05 21:02:24,500 INFO L140 encePairwiseOnDemand]: 46/52 looper letters, 10 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-12-05 21:02:24,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 104 flow [2023-12-05 21:02:24,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:24,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-12-05 21:02:24,508 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-12-05 21:02:24,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-12-05 21:02:24,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-12-05 21:02:24,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:24,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-12-05 21:02:24,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:24,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:02:24,514 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:02:24,517 INFO L308 CegarLoopForPetriNet]: 52 programPoint places, -8 predicate places. [2023-12-05 21:02:24,517 INFO L500 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 104 flow [2023-12-05 21:02:24,517 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:02:24,517 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:24,517 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:02:24,518 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:02:24,518 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:02:24,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:24,518 INFO L85 PathProgramCache]: Analyzing trace with hash -233101063, now seen corresponding path program 1 times [2023-12-05 21:02:24,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:24,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120126448] [2023-12-05 21:02:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:24,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:24,622 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:02:24,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:24,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120126448] [2023-12-05 21:02:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120126448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:24,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:24,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:24,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729889783] [2023-12-05 21:02:24,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:24,624 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:24,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:24,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:24,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:24,625 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 52 [2023-12-05 21:02:24,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:02:24,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:24,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 52 [2023-12-05 21:02:24,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:24,649 INFO L124 PetriNetUnfolderBase]: 2/56 cut-off events. [2023-12-05 21:02:24,649 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2023-12-05 21:02:24,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 56 events. 2/56 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 2 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2023-12-05 21:02:24,649 INFO L140 encePairwiseOnDemand]: 50/52 looper letters, 8 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-12-05 21:02:24,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 118 flow [2023-12-05 21:02:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:24,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-12-05 21:02:24,654 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2023-12-05 21:02:24,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-12-05 21:02:24,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-12-05 21:02:24,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:24,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-12-05 21:02:24,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:02:24,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:02:24,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 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:02:24,656 INFO L308 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-12-05 21:02:24,656 INFO L500 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 118 flow [2023-12-05 21:02:24,656 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 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:02:24,656 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:24,657 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:02:24,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:02:24,657 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:02:24,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1910737222, now seen corresponding path program 1 times [2023-12-05 21:02:24,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:24,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351351993] [2023-12-05 21:02:24,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:24,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:24,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:24,706 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:24,706 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:02:24,707 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:02:24,708 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:02:24,708 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:02:24,708 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:24,710 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:24,710 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:02:24,725 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:24,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 71 transitions, 152 flow [2023-12-05 21:02:24,750 INFO L124 PetriNetUnfolderBase]: 7/99 cut-off events. [2023-12-05 21:02:24,752 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:02:24,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 99 events. 7/99 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 201 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 66. Up to 6 conditions per place. [2023-12-05 21:02:24,753 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 71 transitions, 152 flow [2023-12-05 21:02:24,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 71 transitions, 152 flow [2023-12-05 21:02:24,760 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:24,761 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;@23b4f297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:24,761 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:02:24,764 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:24,764 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:02:24,764 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:24,764 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:24,764 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:02:24,764 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:02:24,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash 670122111, now seen corresponding path program 1 times [2023-12-05 21:02:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:24,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145291710] [2023-12-05 21:02:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:24,832 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:02:24,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145291710] [2023-12-05 21:02:24,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145291710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:24,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997448510] [2023-12-05 21:02:24,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:24,834 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:24,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:24,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:24,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:24,836 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 71 [2023-12-05 21:02:24,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:02:24,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:24,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 71 [2023-12-05 21:02:24,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:24,908 INFO L124 PetriNetUnfolderBase]: 34/239 cut-off events. [2023-12-05 21:02:24,908 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-12-05 21:02:24,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 239 events. 34/239 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1157 event pairs, 34 based on Foata normal form. 50/258 useless extension candidates. Maximal degree in co-relation 94. Up to 73 conditions per place. [2023-12-05 21:02:24,913 INFO L140 encePairwiseOnDemand]: 63/71 looper letters, 13 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2023-12-05 21:02:24,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 53 transitions, 144 flow [2023-12-05 21:02:24,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2023-12-05 21:02:24,917 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7323943661971831 [2023-12-05 21:02:24,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 156 transitions. [2023-12-05 21:02:24,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 156 transitions. [2023-12-05 21:02:24,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:24,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 156 transitions. [2023-12-05 21:02:24,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:24,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:02:24,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:02:24,923 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2023-12-05 21:02:24,923 INFO L500 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 144 flow [2023-12-05 21:02:24,924 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 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:02:24,924 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:24,924 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:02:24,924 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:02:24,924 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:02:24,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:24,925 INFO L85 PathProgramCache]: Analyzing trace with hash 670122112, now seen corresponding path program 1 times [2023-12-05 21:02:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170819811] [2023-12-05 21:02:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:25,017 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:02:25,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:25,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170819811] [2023-12-05 21:02:25,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170819811] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:25,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:25,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:25,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800194306] [2023-12-05 21:02:25,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:25,019 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:25,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:25,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:25,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:25,021 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 71 [2023-12-05 21:02:25,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:02:25,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:25,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 71 [2023-12-05 21:02:25,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:25,060 INFO L124 PetriNetUnfolderBase]: 20/172 cut-off events. [2023-12-05 21:02:25,060 INFO L125 PetriNetUnfolderBase]: For 37/51 co-relation queries the response was YES. [2023-12-05 21:02:25,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 172 events. 20/172 cut-off events. For 37/51 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 663 event pairs, 20 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 86. Up to 46 conditions per place. [2023-12-05 21:02:25,062 INFO L140 encePairwiseOnDemand]: 69/71 looper letters, 11 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-12-05 21:02:25,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 164 flow [2023-12-05 21:02:25,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2023-12-05 21:02:25,063 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7089201877934272 [2023-12-05 21:02:25,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 151 transitions. [2023-12-05 21:02:25,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 151 transitions. [2023-12-05 21:02:25,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:25,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 151 transitions. [2023-12-05 21:02:25,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:02:25,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:02:25,066 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:02:25,067 INFO L308 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2023-12-05 21:02:25,067 INFO L500 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 164 flow [2023-12-05 21:02:25,068 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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:02:25,068 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:25,068 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:02:25,068 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:02:25,069 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:02:25,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash -734632114, now seen corresponding path program 1 times [2023-12-05 21:02:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250952145] [2023-12-05 21:02:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:25,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:25,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:25,116 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:25,116 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:02:25,119 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:02:25,119 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:02:25,119 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:02:25,119 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:25,120 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:25,120 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:02:25,141 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:25,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 90 transitions, 198 flow [2023-12-05 21:02:25,160 INFO L124 PetriNetUnfolderBase]: 10/133 cut-off events. [2023-12-05 21:02:25,160 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:02:25,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 10/133 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 312 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 103. Up to 8 conditions per place. [2023-12-05 21:02:25,161 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 90 transitions, 198 flow [2023-12-05 21:02:25,162 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 90 transitions, 198 flow [2023-12-05 21:02:25,163 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:25,165 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;@23b4f297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:25,165 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:02:25,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:25,172 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:02:25,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:25,172 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:25,172 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:02:25,173 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:02:25,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1149079463, now seen corresponding path program 1 times [2023-12-05 21:02:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042572633] [2023-12-05 21:02:25,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:25,209 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:02:25,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042572633] [2023-12-05 21:02:25,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042572633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:25,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:25,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:25,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277754702] [2023-12-05 21:02:25,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:25,211 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:25,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:25,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:25,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:25,212 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 90 [2023-12-05 21:02:25,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 90 transitions, 198 flow. Second operand has 3 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:02:25,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:25,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 90 [2023-12-05 21:02:25,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:25,322 INFO L124 PetriNetUnfolderBase]: 178/794 cut-off events. [2023-12-05 21:02:25,323 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-12-05 21:02:25,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 794 events. 178/794 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5635 event pairs, 178 based on Foata normal form. 228/922 useless extension candidates. Maximal degree in co-relation 325. Up to 298 conditions per place. [2023-12-05 21:02:25,329 INFO L140 encePairwiseOnDemand]: 80/90 looper letters, 16 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2023-12-05 21:02:25,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 67 transitions, 186 flow [2023-12-05 21:02:25,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 200 transitions. [2023-12-05 21:02:25,330 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2023-12-05 21:02:25,331 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 200 transitions. [2023-12-05 21:02:25,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 200 transitions. [2023-12-05 21:02:25,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:25,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 200 transitions. [2023-12-05 21:02:25,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:25,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:02:25,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:02:25,334 INFO L308 CegarLoopForPetriNet]: 90 programPoint places, -14 predicate places. [2023-12-05 21:02:25,334 INFO L500 AbstractCegarLoop]: Abstraction has has 76 places, 67 transitions, 186 flow [2023-12-05 21:02:25,335 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:02:25,335 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:25,335 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:02:25,335 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:02:25,335 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:02:25,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:25,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1149079462, now seen corresponding path program 1 times [2023-12-05 21:02:25,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837378449] [2023-12-05 21:02:25,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:25,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:25,385 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:02:25,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:25,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837378449] [2023-12-05 21:02:25,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837378449] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:25,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:25,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:25,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896157458] [2023-12-05 21:02:25,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:25,390 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:25,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:25,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:25,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:25,391 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 90 [2023-12-05 21:02:25,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 67 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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:02:25,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:25,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 90 [2023-12-05 21:02:25,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:25,472 INFO L124 PetriNetUnfolderBase]: 110/556 cut-off events. [2023-12-05 21:02:25,472 INFO L125 PetriNetUnfolderBase]: For 157/207 co-relation queries the response was YES. [2023-12-05 21:02:25,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 556 events. 110/556 cut-off events. For 157/207 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3508 event pairs, 110 based on Foata normal form. 0/509 useless extension candidates. Maximal degree in co-relation 281. Up to 190 conditions per place. [2023-12-05 21:02:25,476 INFO L140 encePairwiseOnDemand]: 88/90 looper letters, 14 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-12-05 21:02:25,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 212 flow [2023-12-05 21:02:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2023-12-05 21:02:25,477 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7148148148148148 [2023-12-05 21:02:25,477 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 193 transitions. [2023-12-05 21:02:25,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 193 transitions. [2023-12-05 21:02:25,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:25,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 193 transitions. [2023-12-05 21:02:25,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 0 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:02:25,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:02:25,478 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 90.0) internal successors, (360), 4 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:02:25,479 INFO L308 CegarLoopForPetriNet]: 90 programPoint places, -13 predicate places. [2023-12-05 21:02:25,479 INFO L500 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 212 flow [2023-12-05 21:02:25,479 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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:02:25,479 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:25,480 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:02:25,480 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:02:25,480 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:02:25,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1238601114, now seen corresponding path program 1 times [2023-12-05 21:02:25,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:25,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938313673] [2023-12-05 21:02:25,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:25,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:25,495 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:25,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:25,514 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:25,514 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:02:25,514 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:02:25,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:02:25,515 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:02:25,515 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:25,515 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:25,515 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:02:25,535 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:25,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 109 transitions, 246 flow [2023-12-05 21:02:25,554 INFO L124 PetriNetUnfolderBase]: 13/167 cut-off events. [2023-12-05 21:02:25,554 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:02:25,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 167 events. 13/167 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 402 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 141. Up to 10 conditions per place. [2023-12-05 21:02:25,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 109 transitions, 246 flow [2023-12-05 21:02:25,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 109 transitions, 246 flow [2023-12-05 21:02:25,558 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:25,559 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;@23b4f297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:25,559 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:02:25,562 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:25,562 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:02:25,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:25,562 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:25,562 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:02:25,562 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:02:25,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:25,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1395738490, now seen corresponding path program 1 times [2023-12-05 21:02:25,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:25,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64172550] [2023-12-05 21:02:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:25,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:25,589 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:02:25,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64172550] [2023-12-05 21:02:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64172550] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:25,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:25,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:25,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761640343] [2023-12-05 21:02:25,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:25,590 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:25,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:25,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:25,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:25,592 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 109 [2023-12-05 21:02:25,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:25,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:25,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 109 [2023-12-05 21:02:25,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:25,848 INFO L124 PetriNetUnfolderBase]: 772/2621 cut-off events. [2023-12-05 21:02:25,848 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2023-12-05 21:02:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 2621 events. 772/2621 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 23257 event pairs, 772 based on Foata normal form. 920/3234 useless extension candidates. Maximal degree in co-relation 1136. Up to 1135 conditions per place. [2023-12-05 21:02:25,869 INFO L140 encePairwiseOnDemand]: 97/109 looper letters, 19 selfloop transitions, 1 changer transitions 0/81 dead transitions. [2023-12-05 21:02:25,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 81 transitions, 230 flow [2023-12-05 21:02:25,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-12-05 21:02:25,870 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.746177370030581 [2023-12-05 21:02:25,870 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-12-05 21:02:25,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-12-05 21:02:25,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:25,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-12-05 21:02:25,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:25,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 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:02:25,872 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 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:02:25,872 INFO L308 CegarLoopForPetriNet]: 109 programPoint places, -17 predicate places. [2023-12-05 21:02:25,872 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 230 flow [2023-12-05 21:02:25,873 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:25,873 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:25,873 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:02:25,873 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:02:25,873 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:02:25,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1395738489, now seen corresponding path program 1 times [2023-12-05 21:02:25,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100318413] [2023-12-05 21:02:25,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:25,914 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:02:25,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:25,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100318413] [2023-12-05 21:02:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100318413] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:25,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423122708] [2023-12-05 21:02:25,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:25,916 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:25,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:25,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:25,916 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 109 [2023-12-05 21:02:25,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:25,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:25,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 109 [2023-12-05 21:02:25,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:26,188 INFO L124 PetriNetUnfolderBase]: 488/1816 cut-off events. [2023-12-05 21:02:26,188 INFO L125 PetriNetUnfolderBase]: For 679/837 co-relation queries the response was YES. [2023-12-05 21:02:26,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3474 conditions, 1816 events. 488/1816 cut-off events. For 679/837 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 15036 event pairs, 488 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 983. Up to 730 conditions per place. [2023-12-05 21:02:26,203 INFO L140 encePairwiseOnDemand]: 107/109 looper letters, 17 selfloop transitions, 1 changer transitions 0/80 dead transitions. [2023-12-05 21:02:26,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 80 transitions, 262 flow [2023-12-05 21:02:26,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2023-12-05 21:02:26,205 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7186544342507645 [2023-12-05 21:02:26,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 235 transitions. [2023-12-05 21:02:26,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 235 transitions. [2023-12-05 21:02:26,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:26,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 235 transitions. [2023-12-05 21:02:26,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:02:26,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 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:02:26,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 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:02:26,207 INFO L308 CegarLoopForPetriNet]: 109 programPoint places, -16 predicate places. [2023-12-05 21:02:26,207 INFO L500 AbstractCegarLoop]: Abstraction has has 93 places, 80 transitions, 262 flow [2023-12-05 21:02:26,207 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:26,208 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:26,208 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:02:26,208 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:02:26,208 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:02:26,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2108212879, now seen corresponding path program 1 times [2023-12-05 21:02:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:26,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033165702] [2023-12-05 21:02:26,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:26,224 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:26,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:26,248 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:26,249 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:02:26,249 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:02:26,249 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:02:26,249 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:02:26,249 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:26,249 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:26,250 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:02:26,271 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:26,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 128 transitions, 296 flow [2023-12-05 21:02:26,288 INFO L124 PetriNetUnfolderBase]: 16/201 cut-off events. [2023-12-05 21:02:26,288 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:02:26,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 201 events. 16/201 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 514 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 180. Up to 12 conditions per place. [2023-12-05 21:02:26,290 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 128 transitions, 296 flow [2023-12-05 21:02:26,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 128 transitions, 296 flow [2023-12-05 21:02:26,294 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:26,294 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;@23b4f297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:26,294 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:02:26,296 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:26,296 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:02:26,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:26,296 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:26,296 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:02:26,296 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:02:26,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -69854970, now seen corresponding path program 1 times [2023-12-05 21:02:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:26,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576603288] [2023-12-05 21:02:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:26,320 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:02:26,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:26,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576603288] [2023-12-05 21:02:26,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576603288] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:26,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:26,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:26,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481808811] [2023-12-05 21:02:26,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:26,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:26,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:26,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:26,322 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 128 [2023-12-05 21:02:26,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 128 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:02:26,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:26,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 128 [2023-12-05 21:02:26,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:27,294 INFO L124 PetriNetUnfolderBase]: 3040/8588 cut-off events. [2023-12-05 21:02:27,295 INFO L125 PetriNetUnfolderBase]: For 2176/2176 co-relation queries the response was YES. [2023-12-05 21:02:27,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13400 conditions, 8588 events. 3040/8588 cut-off events. For 2176/2176 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 88284 event pairs, 3040 based on Foata normal form. 3486/11146 useless extension candidates. Maximal degree in co-relation 3962. Up to 4132 conditions per place. [2023-12-05 21:02:27,375 INFO L140 encePairwiseOnDemand]: 114/128 looper letters, 22 selfloop transitions, 1 changer transitions 0/95 dead transitions. [2023-12-05 21:02:27,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 95 transitions, 276 flow [2023-12-05 21:02:27,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:27,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-12-05 21:02:27,376 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.75 [2023-12-05 21:02:27,376 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-12-05 21:02:27,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-12-05 21:02:27,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:27,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-12-05 21:02:27,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:27,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:27,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:27,379 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, -20 predicate places. [2023-12-05 21:02:27,379 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 95 transitions, 276 flow [2023-12-05 21:02:27,379 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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:02:27,379 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:27,379 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:02:27,380 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:02:27,380 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:02:27,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash -69854969, now seen corresponding path program 1 times [2023-12-05 21:02:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:27,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870910531] [2023-12-05 21:02:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:27,464 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:02:27,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:27,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870910531] [2023-12-05 21:02:27,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870910531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:27,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:27,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617154840] [2023-12-05 21:02:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:27,465 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:27,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:27,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:27,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:27,466 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 128 [2023-12-05 21:02:27,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 95 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:02:27,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:27,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 128 [2023-12-05 21:02:27,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:27,998 INFO L124 PetriNetUnfolderBase]: 1946/5920 cut-off events. [2023-12-05 21:02:27,998 INFO L125 PetriNetUnfolderBase]: For 2866/3348 co-relation queries the response was YES. [2023-12-05 21:02:28,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11953 conditions, 5920 events. 1946/5920 cut-off events. For 2866/3348 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 58429 event pairs, 1946 based on Foata normal form. 0/5477 useless extension candidates. Maximal degree in co-relation 3481. Up to 2674 conditions per place. [2023-12-05 21:02:28,096 INFO L140 encePairwiseOnDemand]: 126/128 looper letters, 20 selfloop transitions, 1 changer transitions 0/94 dead transitions. [2023-12-05 21:02:28,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 94 transitions, 314 flow [2023-12-05 21:02:28,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:28,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-12-05 21:02:28,098 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7213541666666666 [2023-12-05 21:02:28,098 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-12-05 21:02:28,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-12-05 21:02:28,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:28,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-12-05 21:02:28,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:02:28,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:28,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:28,100 INFO L308 CegarLoopForPetriNet]: 128 programPoint places, -19 predicate places. [2023-12-05 21:02:28,100 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 94 transitions, 314 flow [2023-12-05 21:02:28,100 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 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:02:28,100 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:28,100 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:02:28,100 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:02:28,100 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:02:28,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1775363310, now seen corresponding path program 1 times [2023-12-05 21:02:28,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:28,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231080485] [2023-12-05 21:02:28,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:28,112 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:28,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:28,121 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:28,121 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:02:28,121 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:02:28,121 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:02:28,121 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:02:28,121 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:28,122 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:28,122 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:02:28,147 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:28,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 147 transitions, 348 flow [2023-12-05 21:02:28,162 INFO L124 PetriNetUnfolderBase]: 19/235 cut-off events. [2023-12-05 21:02:28,163 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:02:28,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 235 events. 19/235 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 609 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 220. Up to 14 conditions per place. [2023-12-05 21:02:28,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 147 transitions, 348 flow [2023-12-05 21:02:28,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 147 transitions, 348 flow [2023-12-05 21:02:28,168 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:28,168 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;@23b4f297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:28,168 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:02:28,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:28,169 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:02:28,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:28,169 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:28,170 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:02:28,170 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:02:28,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1466396199, now seen corresponding path program 1 times [2023-12-05 21:02:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:28,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876026876] [2023-12-05 21:02:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:28,196 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:02:28,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:28,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876026876] [2023-12-05 21:02:28,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876026876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:28,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:28,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:28,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412497966] [2023-12-05 21:02:28,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:28,198 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:28,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:28,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:28,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:28,199 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 147 [2023-12-05 21:02:28,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 147 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:02:28,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:28,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 147 [2023-12-05 21:02:28,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:31,323 INFO L124 PetriNetUnfolderBase]: 11302/27947 cut-off events. [2023-12-05 21:02:31,324 INFO L125 PetriNetUnfolderBase]: For 9628/9628 co-relation queries the response was YES. [2023-12-05 21:02:31,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44910 conditions, 27947 events. 11302/27947 cut-off events. For 9628/9628 co-relation queries the response was YES. Maximal size of possible extension queue 1270. Compared 318990 event pairs, 11302 based on Foata normal form. 12638/37794 useless extension candidates. Maximal degree in co-relation 13493. Up to 14581 conditions per place. [2023-12-05 21:02:31,741 INFO L140 encePairwiseOnDemand]: 131/147 looper letters, 25 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2023-12-05 21:02:31,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 109 transitions, 324 flow [2023-12-05 21:02:31,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:31,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-12-05 21:02:31,742 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7528344671201814 [2023-12-05 21:02:31,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-12-05 21:02:31,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-12-05 21:02:31,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:31,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-12-05 21:02:31,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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:02:31,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 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:02:31,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 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:02:31,745 INFO L308 CegarLoopForPetriNet]: 147 programPoint places, -23 predicate places. [2023-12-05 21:02:31,745 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 109 transitions, 324 flow [2023-12-05 21:02:31,745 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:02:31,745 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:31,745 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:02:31,745 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:02:31,746 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:02:31,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:31,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1466396198, now seen corresponding path program 1 times [2023-12-05 21:02:31,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:31,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508496147] [2023-12-05 21:02:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:31,784 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:02:31,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:31,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508496147] [2023-12-05 21:02:31,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508496147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:31,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:31,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:31,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177126794] [2023-12-05 21:02:31,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:31,786 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:31,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:31,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:31,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:31,787 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 147 [2023-12-05 21:02:31,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 109 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:31,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:31,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 147 [2023-12-05 21:02:31,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:33,906 INFO L124 PetriNetUnfolderBase]: 7292/19204 cut-off events. [2023-12-05 21:02:33,906 INFO L125 PetriNetUnfolderBase]: For 11695/13149 co-relation queries the response was YES. [2023-12-05 21:02:33,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40547 conditions, 19204 events. 7292/19204 cut-off events. For 11695/13149 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 214085 event pairs, 7292 based on Foata normal form. 0/17870 useless extension candidates. Maximal degree in co-relation 12040. Up to 9478 conditions per place. [2023-12-05 21:02:34,085 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 23 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2023-12-05 21:02:34,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 108 transitions, 368 flow [2023-12-05 21:02:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:34,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:34,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-12-05 21:02:34,086 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7233560090702947 [2023-12-05 21:02:34,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-12-05 21:02:34,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-12-05 21:02:34,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:34,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-12-05 21:02:34,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:02:34,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 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:02:34,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 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:02:34,088 INFO L308 CegarLoopForPetriNet]: 147 programPoint places, -22 predicate places. [2023-12-05 21:02:34,089 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 108 transitions, 368 flow [2023-12-05 21:02:34,089 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:34,089 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:34,089 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:34,089 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:02:34,089 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:02:34,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1494721748, now seen corresponding path program 1 times [2023-12-05 21:02:34,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422121866] [2023-12-05 21:02:34,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:34,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:34,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:34,119 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:34,119 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:02:34,119 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:02:34,119 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:02:34,120 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:02:34,120 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:34,121 WARN L227 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:34,121 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2023-12-05 21:02:34,143 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:34,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 166 transitions, 402 flow [2023-12-05 21:02:34,165 INFO L124 PetriNetUnfolderBase]: 22/269 cut-off events. [2023-12-05 21:02:34,166 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-12-05 21:02:34,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 269 events. 22/269 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 732 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 261. Up to 16 conditions per place. [2023-12-05 21:02:34,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 166 transitions, 402 flow [2023-12-05 21:02:34,170 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 166 transitions, 402 flow [2023-12-05 21:02:34,171 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:34,171 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;@23b4f297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:34,172 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:02:34,173 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:34,173 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:02:34,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:34,173 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:34,173 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:02:34,173 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:02:34,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1290394881, now seen corresponding path program 1 times [2023-12-05 21:02:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379594861] [2023-12-05 21:02:34,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:34,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:34,204 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:02:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379594861] [2023-12-05 21:02:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379594861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:34,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269849600] [2023-12-05 21:02:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:34,205 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:34,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:34,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:34,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:34,207 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 166 [2023-12-05 21:02:34,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 166 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 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:02:34,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:34,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 166 [2023-12-05 21:02:34,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:44,603 INFO L124 PetriNetUnfolderBase]: 40462/90398 cut-off events. [2023-12-05 21:02:44,603 INFO L125 PetriNetUnfolderBase]: For 40003/40003 co-relation queries the response was YES. [2023-12-05 21:02:45,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148915 conditions, 90398 events. 40462/90398 cut-off events. For 40003/40003 co-relation queries the response was YES. Maximal size of possible extension queue 3612. Compared 1120214 event pairs, 40462 based on Foata normal form. 44472/126490 useless extension candidates. Maximal degree in co-relation 45245. Up to 50302 conditions per place. [2023-12-05 21:02:46,398 INFO L140 encePairwiseOnDemand]: 148/166 looper letters, 28 selfloop transitions, 1 changer transitions 0/123 dead transitions. [2023-12-05 21:02:46,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 123 transitions, 374 flow [2023-12-05 21:02:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-12-05 21:02:46,399 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7550200803212851 [2023-12-05 21:02:46,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-12-05 21:02:46,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-12-05 21:02:46,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:46,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-12-05 21:02:46,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:02:46,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 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:02:46,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 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:02:46,402 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -26 predicate places. [2023-12-05 21:02:46,402 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 123 transitions, 374 flow [2023-12-05 21:02:46,402 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 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:02:46,402 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:46,402 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:02:46,402 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 21:02:46,402 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:02:46,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1290394880, now seen corresponding path program 1 times [2023-12-05 21:02:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:46,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123000458] [2023-12-05 21:02:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:46,430 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:02:46,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123000458] [2023-12-05 21:02:46,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123000458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:46,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:46,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:46,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841830668] [2023-12-05 21:02:46,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:46,431 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:46,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:46,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:46,432 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 166 [2023-12-05 21:02:46,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 123 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:02:46,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:46,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 166 [2023-12-05 21:02:46,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:54,224 INFO L124 PetriNetUnfolderBase]: 26246/61972 cut-off events. [2023-12-05 21:02:54,224 INFO L125 PetriNetUnfolderBase]: For 46201/50571 co-relation queries the response was YES. [2023-12-05 21:02:54,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135804 conditions, 61972 events. 26246/61972 cut-off events. For 46201/50571 co-relation queries the response was YES. Maximal size of possible extension queue 2523. Compared 757623 event pairs, 26246 based on Foata normal form. 0/57965 useless extension candidates. Maximal degree in co-relation 40876. Up to 32806 conditions per place. [2023-12-05 21:02:55,531 INFO L140 encePairwiseOnDemand]: 164/166 looper letters, 26 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2023-12-05 21:02:55,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 122 transitions, 424 flow [2023-12-05 21:02:55,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-12-05 21:02:55,533 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7248995983935743 [2023-12-05 21:02:55,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-12-05 21:02:55,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-12-05 21:02:55,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:55,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-12-05 21:02:55,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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:02:55,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 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:02:55,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 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:02:55,535 INFO L308 CegarLoopForPetriNet]: 166 programPoint places, -25 predicate places. [2023-12-05 21:02:55,535 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 122 transitions, 424 flow [2023-12-05 21:02:55,536 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:02:55,536 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:55,536 INFO L233 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:55,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-05 21:02:55,539 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:02:55,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:55,539 INFO L85 PathProgramCache]: Analyzing trace with hash -2065071158, now seen corresponding path program 1 times [2023-12-05 21:02:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:55,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164783311] [2023-12-05 21:02:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:55,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:55,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:55,566 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:55,566 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:02:55,566 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:02:55,566 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:02:55,566 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-05 21:02:55,566 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:55,567 WARN L227 ceAbstractionStarter]: 7 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:55,567 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 8 thread instances. [2023-12-05 21:02:55,597 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:55,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 185 places, 185 transitions, 458 flow [2023-12-05 21:02:55,619 INFO L124 PetriNetUnfolderBase]: 25/303 cut-off events. [2023-12-05 21:02:55,619 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-12-05 21:02:55,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 303 events. 25/303 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 816 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 303. Up to 18 conditions per place. [2023-12-05 21:02:55,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 185 places, 185 transitions, 458 flow [2023-12-05 21:02:55,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 185 transitions, 458 flow [2023-12-05 21:02:55,628 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:55,628 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;@23b4f297, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:55,628 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:02:55,629 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:55,630 INFO L124 PetriNetUnfolderBase]: 1/26 cut-off events. [2023-12-05 21:02:55,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:55,630 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:55,630 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:02:55,630 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:02:55,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:55,630 INFO L85 PathProgramCache]: Analyzing trace with hash 458148984, now seen corresponding path program 1 times [2023-12-05 21:02:55,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:55,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036322349] [2023-12-05 21:02:55,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:55,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:55,651 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:02:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:55,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036322349] [2023-12-05 21:02:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036322349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:55,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:55,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:55,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152627040] [2023-12-05 21:02:55,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:55,652 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:55,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:55,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:55,653 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 185 [2023-12-05 21:02:55,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 185 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:02:55,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:55,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 185 [2023-12-05 21:02:55,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:03:38,670 INFO L124 PetriNetUnfolderBase]: 141064/290873 cut-off events. [2023-12-05 21:03:38,671 INFO L125 PetriNetUnfolderBase]: For 158830/158830 co-relation queries the response was YES. [2023-12-05 21:03:43,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489359 conditions, 290873 events. 141064/290873 cut-off events. For 158830/158830 co-relation queries the response was YES. Maximal size of possible extension queue 10185. Compared 3846805 event pairs, 141064 based on Foata normal form. 153093/418819 useless extension candidates. Maximal degree in co-relation 149978. Up to 170587 conditions per place. [2023-12-05 21:03:46,515 INFO L140 encePairwiseOnDemand]: 165/185 looper letters, 31 selfloop transitions, 1 changer transitions 0/137 dead transitions. [2023-12-05 21:03:46,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 137 transitions, 426 flow [2023-12-05 21:03:46,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:03:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:03:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-12-05 21:03:46,518 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7567567567567568 [2023-12-05 21:03:46,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-12-05 21:03:46,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-12-05 21:03:46,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:03:46,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-12-05 21:03:46,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:46,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 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:03:46,532 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 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:03:46,532 INFO L308 CegarLoopForPetriNet]: 185 programPoint places, -29 predicate places. [2023-12-05 21:03:46,532 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 137 transitions, 426 flow [2023-12-05 21:03:46,533 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 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:03:46,533 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:03:46,533 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:03:46,533 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-05 21:03:46,533 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:03:46,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:03:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash 458148985, now seen corresponding path program 1 times [2023-12-05 21:03:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:03:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362538764] [2023-12-05 21:03:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:03:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:03:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:03:46,645 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:03:46,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:03:46,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362538764] [2023-12-05 21:03:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362538764] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:03:46,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:03:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:03:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555426252] [2023-12-05 21:03:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:03:46,646 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:03:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:03:46,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:03:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:03:46,647 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 185 [2023-12-05 21:03:46,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 137 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 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:03:46,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:03:46,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 185 [2023-12-05 21:03:46,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand