/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/03_incdec-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:00:06,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:00:06,310 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:00:06,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:00:06,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:00:06,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:00:06,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:00:06,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:00:06,332 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:00:06,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:00:06,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:00:06,335 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:00:06,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:00:06,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:00:06,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:00:06,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:00:06,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:00:06,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:00:06,337 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:00:06,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:00:06,337 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:00:06,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:00:06,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:00:06,341 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:00:06,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:00:06,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:00:06,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:00:06,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:00:06,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:00:06,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:00:06,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:00:06,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:00:06,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:00:06,343 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:00:06,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:00:06,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:00:06,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:00:06,547 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:00:06,548 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:00:06,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/03_incdec-pthread.i [2023-12-05 21:00:07,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:00:07,698 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:00:07,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/03_incdec-pthread.i [2023-12-05 21:00:07,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb0f5e76/31a911ba7cb54eb88ad705215b93553b/FLAGf7df6e652 [2023-12-05 21:00:07,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fb0f5e76/31a911ba7cb54eb88ad705215b93553b [2023-12-05 21:00:07,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:00:07,730 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:00:07,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:00:07,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:00:07,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:00:07,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:00:07" (1/1) ... [2023-12-05 21:00:07,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d77c6a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:07, skipping insertion in model container [2023-12-05 21:00:07,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:00:07" (1/1) ... [2023-12-05 21:00:07,773 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:00:08,011 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:00:08,020 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:00:08,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:00:08,065 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:00:08,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08 WrapperNode [2023-12-05 21:00:08,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:00:08,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:00:08,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:00:08,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:00:08,071 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:00:08" (1/1) ... [2023-12-05 21:00:08,080 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:00:08" (1/1) ... [2023-12-05 21:00:08,093 INFO L138 Inliner]: procedures = 165, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 105 [2023-12-05 21:00:08,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:00:08,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:00:08,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:00:08,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:00:08,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:00:08,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:00:08,111 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:00:08,111 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:00:08,112 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (1/1) ... [2023-12-05 21:00:08,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:00:08,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:00:08,134 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:00:08,147 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:00:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:00:08,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:00:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:00:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:00:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:00:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:00:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:00:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:00:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:00:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:00:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:00:08,160 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:00:08,245 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:00:08,246 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:00:08,394 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:00:08,429 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:00:08,429 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-05 21:00:08,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:00:08 BoogieIcfgContainer [2023-12-05 21:00:08,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:00:08,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:00:08,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:00:08,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:00:08,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:00:07" (1/3) ... [2023-12-05 21:00:08,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d3dfc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:00:08, skipping insertion in model container [2023-12-05 21:00:08,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:00:08" (2/3) ... [2023-12-05 21:00:08,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74d3dfc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:00:08, skipping insertion in model container [2023-12-05 21:00:08,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:00:08" (3/3) ... [2023-12-05 21:00:08,437 INFO L112 eAbstractionObserver]: Analyzing ICFG 03_incdec-pthread.i [2023-12-05 21:00:08,448 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:00:08,448 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 21:00:08,448 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:00:08,493 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:00:08,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 109 transitions, 222 flow [2023-12-05 21:00:08,545 INFO L124 PetriNetUnfolderBase]: 9/122 cut-off events. [2023-12-05 21:00:08,545 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:08,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 122 events. 9/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 256 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. [2023-12-05 21:00:08,550 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 109 transitions, 222 flow [2023-12-05 21:00:08,567 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 109 transitions, 222 flow [2023-12-05 21:00:08,574 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:00:08,578 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;@3693321b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:00:08,579 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:00:08,589 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:00:08,590 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-12-05 21:00:08,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:08,590 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:08,591 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, 1, 1] [2023-12-05 21:00:08,591 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:00:08,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:08,596 INFO L85 PathProgramCache]: Analyzing trace with hash 587139909, now seen corresponding path program 1 times [2023-12-05 21:00:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:08,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299018963] [2023-12-05 21:00:08,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:08,851 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:00:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299018963] [2023-12-05 21:00:08,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299018963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:08,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:08,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:08,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742266986] [2023-12-05 21:00:08,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:08,859 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:08,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:08,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:08,879 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2023-12-05 21:00:08,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 109 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:00:08,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:08,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2023-12-05 21:00:08,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:08,935 INFO L124 PetriNetUnfolderBase]: 23/146 cut-off events. [2023-12-05 21:00:08,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:08,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 146 events. 23/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 518 event pairs, 20 based on Foata normal form. 24/149 useless extension candidates. Maximal degree in co-relation 162. Up to 56 conditions per place. [2023-12-05 21:00:08,937 INFO L140 encePairwiseOnDemand]: 101/109 looper letters, 18 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-12-05 21:00:08,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 224 flow [2023-12-05 21:00:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:08,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-12-05 21:00:08,946 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7951070336391437 [2023-12-05 21:00:08,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-12-05 21:00:08,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-12-05 21:00:08,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:08,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-12-05 21:00:08,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 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:00:08,954 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:00:08,954 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:00:08,957 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, -11 predicate places. [2023-12-05 21:00:08,957 INFO L500 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 224 flow [2023-12-05 21:00:08,957 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 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:00:08,957 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:08,958 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, 1, 1] [2023-12-05 21:00:08,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:00:08,958 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:00:08,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:08,958 INFO L85 PathProgramCache]: Analyzing trace with hash 587139910, now seen corresponding path program 1 times [2023-12-05 21:00:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414984294] [2023-12-05 21:00:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:09,039 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:00:09,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414984294] [2023-12-05 21:00:09,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414984294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680417396] [2023-12-05 21:00:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:09,043 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:09,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:09,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:09,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:09,044 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 109 [2023-12-05 21:00:09,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:00:09,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:09,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 109 [2023-12-05 21:00:09,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:09,108 INFO L124 PetriNetUnfolderBase]: 13/124 cut-off events. [2023-12-05 21:00:09,108 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2023-12-05 21:00:09,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 124 events. 13/124 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 373 event pairs, 10 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 151. Up to 34 conditions per place. [2023-12-05 21:00:09,109 INFO L140 encePairwiseOnDemand]: 107/109 looper letters, 16 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-12-05 21:00:09,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 254 flow [2023-12-05 21:00:09,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:09,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2023-12-05 21:00:09,114 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7798165137614679 [2023-12-05 21:00:09,115 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 255 transitions. [2023-12-05 21:00:09,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 255 transitions. [2023-12-05 21:00:09,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:09,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 255 transitions. [2023-12-05 21:00:09,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:00:09,117 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:00:09,117 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:00:09,118 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, -10 predicate places. [2023-12-05 21:00:09,118 INFO L500 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 254 flow [2023-12-05 21:00:09,118 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 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:00:09,118 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:09,118 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, 1, 1] [2023-12-05 21:00:09,118 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:00:09,118 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:00:09,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1430446647, now seen corresponding path program 1 times [2023-12-05 21:00:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:09,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284445352] [2023-12-05 21:00:09,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:09,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:00:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:09,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:00:09,158 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:00:09,159 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:00:09,160 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:00:09,161 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:00:09,161 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:00:09,161 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:00:09,163 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:00:09,163 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:00:09,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:00:09,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 183 transitions, 376 flow [2023-12-05 21:00:09,234 INFO L124 PetriNetUnfolderBase]: 17/211 cut-off events. [2023-12-05 21:00:09,236 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:00:09,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 211 events. 17/211 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 715 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 161. Up to 6 conditions per place. [2023-12-05 21:00:09,240 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 183 transitions, 376 flow [2023-12-05 21:00:09,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 183 transitions, 376 flow [2023-12-05 21:00:09,245 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:00:09,245 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;@3693321b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:00:09,245 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:00:09,247 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:00:09,247 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-12-05 21:00:09,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:09,248 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:09,248 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, 1, 1] [2023-12-05 21:00:09,248 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:00:09,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1896385628, now seen corresponding path program 1 times [2023-12-05 21:00:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907479304] [2023-12-05 21:00:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:09,318 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:00:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907479304] [2023-12-05 21:00:09,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907479304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:09,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:09,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803325225] [2023-12-05 21:00:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:09,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:09,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:09,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:09,322 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 183 [2023-12-05 21:00:09,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 183 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:00:09,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:09,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 183 [2023-12-05 21:00:09,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:09,526 INFO L124 PetriNetUnfolderBase]: 606/1807 cut-off events. [2023-12-05 21:00:09,526 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-12-05 21:00:09,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1807 events. 606/1807 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14934 event pairs, 570 based on Foata normal form. 409/1973 useless extension candidates. Maximal degree in co-relation 307. Up to 969 conditions per place. [2023-12-05 21:00:09,541 INFO L140 encePairwiseOnDemand]: 171/183 looper letters, 29 selfloop transitions, 1 changer transitions 0/155 dead transitions. [2023-12-05 21:00:09,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 155 transitions, 380 flow [2023-12-05 21:00:09,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:09,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:09,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-12-05 21:00:09,542 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8123861566484517 [2023-12-05 21:00:09,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-12-05 21:00:09,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-12-05 21:00:09,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:09,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-12-05 21:00:09,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 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:00:09,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:00:09,547 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:00:09,548 INFO L308 CegarLoopForPetriNet]: 173 programPoint places, -17 predicate places. [2023-12-05 21:00:09,548 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 380 flow [2023-12-05 21:00:09,549 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 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:00:09,549 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:09,549 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, 1, 1] [2023-12-05 21:00:09,549 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:00:09,550 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:00:09,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1896385629, now seen corresponding path program 1 times [2023-12-05 21:00:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549638195] [2023-12-05 21:00:09,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:09,626 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:00:09,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:09,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549638195] [2023-12-05 21:00:09,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549638195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:09,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:09,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:09,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699540999] [2023-12-05 21:00:09,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:09,628 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:09,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:09,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:09,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:09,629 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 183 [2023-12-05 21:00:09,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 155 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:00:09,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:09,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 183 [2023-12-05 21:00:09,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:09,814 INFO L124 PetriNetUnfolderBase]: 376/1444 cut-off events. [2023-12-05 21:00:09,815 INFO L125 PetriNetUnfolderBase]: For 295/351 co-relation queries the response was YES. [2023-12-05 21:00:09,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 1444 events. 376/1444 cut-off events. For 295/351 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 11973 event pairs, 340 based on Foata normal form. 0/1358 useless extension candidates. Maximal degree in co-relation 296. Up to 606 conditions per place. [2023-12-05 21:00:09,830 INFO L140 encePairwiseOnDemand]: 181/183 looper letters, 27 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2023-12-05 21:00:09,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 154 transitions, 432 flow [2023-12-05 21:00:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-12-05 21:00:09,831 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7959927140255009 [2023-12-05 21:00:09,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-12-05 21:00:09,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-12-05 21:00:09,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:09,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-12-05 21:00:09,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:00:09,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:00:09,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 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:00:09,836 INFO L308 CegarLoopForPetriNet]: 173 programPoint places, -16 predicate places. [2023-12-05 21:00:09,836 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 154 transitions, 432 flow [2023-12-05 21:00:09,836 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:00:09,836 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:09,836 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, 1, 1] [2023-12-05 21:00:09,837 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:00:09,837 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:00:09,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:09,837 INFO L85 PathProgramCache]: Analyzing trace with hash 535728758, now seen corresponding path program 1 times [2023-12-05 21:00:09,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:09,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121285068] [2023-12-05 21:00:09,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:09,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:09,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:00:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:09,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:00:09,881 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:00:09,881 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:00:09,884 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:00:09,885 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:00:09,885 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:00:09,885 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:00:09,885 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:00:09,885 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:00:09,945 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:00:09,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 242 places, 257 transitions, 532 flow [2023-12-05 21:00:09,981 INFO L124 PetriNetUnfolderBase]: 25/300 cut-off events. [2023-12-05 21:00:09,982 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:00:09,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313 conditions, 300 events. 25/300 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1198 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 234. Up to 8 conditions per place. [2023-12-05 21:00:09,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 242 places, 257 transitions, 532 flow [2023-12-05 21:00:09,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 257 transitions, 532 flow [2023-12-05 21:00:09,990 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:00:09,992 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;@3693321b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:00:09,992 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:00:09,995 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:00:09,998 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-12-05 21:00:09,998 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:09,998 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:09,998 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, 1, 1] [2023-12-05 21:00:09,998 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:00:09,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:09,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1036029949, now seen corresponding path program 1 times [2023-12-05 21:00:09,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:09,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932271785] [2023-12-05 21:00:09,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:09,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:10,030 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:00:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932271785] [2023-12-05 21:00:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932271785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:10,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55416818] [2023-12-05 21:00:10,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:10,032 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:10,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:10,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:10,033 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 257 [2023-12-05 21:00:10,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 257 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 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:00:10,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:10,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 257 [2023-12-05 21:00:10,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:12,732 INFO L124 PetriNetUnfolderBase]: 10649/23708 cut-off events. [2023-12-05 21:00:12,732 INFO L125 PetriNetUnfolderBase]: For 4367/4367 co-relation queries the response was YES. [2023-12-05 21:00:12,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38879 conditions, 23708 events. 10649/23708 cut-off events. For 4367/4367 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 260479 event pairs, 10250 based on Foata normal form. 6096/27119 useless extension candidates. Maximal degree in co-relation 2805. Up to 14642 conditions per place. [2023-12-05 21:00:12,949 INFO L140 encePairwiseOnDemand]: 241/257 looper letters, 40 selfloop transitions, 1 changer transitions 0/219 dead transitions. [2023-12-05 21:00:12,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 219 transitions, 538 flow [2023-12-05 21:00:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 632 transitions. [2023-12-05 21:00:12,951 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8197146562905318 [2023-12-05 21:00:12,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 632 transitions. [2023-12-05 21:00:12,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 632 transitions. [2023-12-05 21:00:12,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:12,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 632 transitions. [2023-12-05 21:00:12,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 0 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:00:12,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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:00:12,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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:00:12,956 INFO L308 CegarLoopForPetriNet]: 242 programPoint places, -23 predicate places. [2023-12-05 21:00:12,956 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 219 transitions, 538 flow [2023-12-05 21:00:12,956 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 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:00:12,956 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:12,956 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, 1, 1] [2023-12-05 21:00:12,957 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:00:12,957 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:00:12,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1036029950, now seen corresponding path program 1 times [2023-12-05 21:00:12,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:12,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475946013] [2023-12-05 21:00:12,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:13,012 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:00:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475946013] [2023-12-05 21:00:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475946013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:13,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582575433] [2023-12-05 21:00:13,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:13,015 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:13,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:13,016 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 257 [2023-12-05 21:00:13,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 219 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:00:13,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:13,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 257 [2023-12-05 21:00:13,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:14,667 INFO L124 PetriNetUnfolderBase]: 6789/18384 cut-off events. [2023-12-05 21:00:14,667 INFO L125 PetriNetUnfolderBase]: For 6125/6753 co-relation queries the response was YES. [2023-12-05 21:00:14,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37554 conditions, 18384 events. 6789/18384 cut-off events. For 6125/6753 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 215418 event pairs, 6390 based on Foata normal form. 0/17429 useless extension candidates. Maximal degree in co-relation 2684. Up to 9318 conditions per place. [2023-12-05 21:00:14,819 INFO L140 encePairwiseOnDemand]: 255/257 looper letters, 38 selfloop transitions, 1 changer transitions 0/218 dead transitions. [2023-12-05 21:00:14,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 612 flow [2023-12-05 21:00:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:14,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2023-12-05 21:00:14,821 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8028534370946823 [2023-12-05 21:00:14,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2023-12-05 21:00:14,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2023-12-05 21:00:14,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:14,821 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2023-12-05 21:00:14,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 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:00:14,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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:00:14,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 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:00:14,824 INFO L308 CegarLoopForPetriNet]: 242 programPoint places, -22 predicate places. [2023-12-05 21:00:14,825 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 612 flow [2023-12-05 21:00:14,825 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:00:14,825 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:14,825 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, 1, 1] [2023-12-05 21:00:14,825 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:00:14,825 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:00:14,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:14,826 INFO L85 PathProgramCache]: Analyzing trace with hash 807685518, now seen corresponding path program 1 times [2023-12-05 21:00:14,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:14,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703552473] [2023-12-05 21:00:14,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:14,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:14,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:00:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:14,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:00:14,845 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:00:14,845 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:00:14,845 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:00:14,845 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:00:14,845 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:00:14,845 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:00:14,846 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:00:14,846 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:00:14,875 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:00:14,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 311 places, 331 transitions, 690 flow [2023-12-05 21:00:14,913 INFO L124 PetriNetUnfolderBase]: 33/389 cut-off events. [2023-12-05 21:00:14,914 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:00:14,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 389 events. 33/389 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1719 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 308. Up to 10 conditions per place. [2023-12-05 21:00:14,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 311 places, 331 transitions, 690 flow [2023-12-05 21:00:14,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 331 transitions, 690 flow [2023-12-05 21:00:14,923 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:00:14,923 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;@3693321b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:00:14,923 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:00:14,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:00:14,925 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2023-12-05 21:00:14,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:14,925 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:14,925 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, 1, 1] [2023-12-05 21:00:14,926 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:00:14,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:14,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1993927128, now seen corresponding path program 1 times [2023-12-05 21:00:14,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:14,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198409504] [2023-12-05 21:00:14,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:14,952 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:00:14,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:14,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198409504] [2023-12-05 21:00:14,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198409504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:14,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:14,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:14,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034433594] [2023-12-05 21:00:14,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:14,952 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:14,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:14,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:14,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:14,955 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 331 [2023-12-05 21:00:14,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 331 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 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:00:14,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:14,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 331 [2023-12-05 21:00:14,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:49,501 INFO L124 PetriNetUnfolderBase]: 161052/304549 cut-off events. [2023-12-05 21:00:49,501 INFO L125 PetriNetUnfolderBase]: For 96206/96206 co-relation queries the response was YES. [2023-12-05 21:00:53,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516709 conditions, 304549 events. 161052/304549 cut-off events. For 96206/96206 co-relation queries the response was YES. Maximal size of possible extension queue 14400. Compared 3910361 event pairs, 156660 based on Foata normal form. 84625/359627 useless extension candidates. Maximal degree in co-relation 38984. Up to 204975 conditions per place. [2023-12-05 21:00:55,906 INFO L140 encePairwiseOnDemand]: 311/331 looper letters, 51 selfloop transitions, 1 changer transitions 0/283 dead transitions. [2023-12-05 21:00:55,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 283 transitions, 698 flow [2023-12-05 21:00:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:55,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 818 transitions. [2023-12-05 21:00:55,909 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.823766364551863 [2023-12-05 21:00:55,909 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 818 transitions. [2023-12-05 21:00:55,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 818 transitions. [2023-12-05 21:00:55,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:55,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 818 transitions. [2023-12-05 21:00:55,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 272.6666666666667) internal successors, (818), 3 states have internal predecessors, (818), 0 states have call successors, (0), 0 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:00:55,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:00:55,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 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:00:55,913 INFO L308 CegarLoopForPetriNet]: 311 programPoint places, -29 predicate places. [2023-12-05 21:00:55,913 INFO L500 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 698 flow [2023-12-05 21:00:55,913 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 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:00:55,913 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:55,928 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, 1, 1] [2023-12-05 21:00:55,928 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:00:55,928 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:00:55,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1993927127, now seen corresponding path program 1 times [2023-12-05 21:00:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:55,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292279356] [2023-12-05 21:00:55,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:55,977 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:00:55,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:55,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292279356] [2023-12-05 21:00:55,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292279356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:55,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:55,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964281152] [2023-12-05 21:00:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:55,978 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:55,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:55,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:55,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:55,979 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 331 [2023-12-05 21:00:55,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 698 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 0 states have call successors, (0), 0 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:00:55,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:55,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 331 [2023-12-05 21:00:55,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand