/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/01b_inc-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 20:59:55,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 20:59:55,122 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 20:59:55,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 20:59:55,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 20:59:55,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 20:59:55,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 20:59:55,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 20:59:55,162 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 20:59:55,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 20:59:55,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 20:59:55,166 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 20:59:55,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 20:59:55,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 20:59:55,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 20:59:55,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 20:59:55,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 20:59:55,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 20:59:55,169 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 20:59:55,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 20:59:55,169 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 20:59:55,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 20:59:55,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 20:59:55,170 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 20:59:55,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 20:59:55,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:59:55,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 20:59:55,170 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 20:59:55,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 20:59:55,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 20:59:55,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 20:59:55,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 20:59:55,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 20:59:55,171 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 20:59:55,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 20:59:55,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 20:59:55,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 20:59:55,437 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 20:59:55,438 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 20:59:55,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/01b_inc-pthread.i [2023-12-05 20:59:56,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 20:59:56,790 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 20:59:56,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/01b_inc-pthread.i [2023-12-05 20:59:56,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a6068a0/65d1f830e03b41bcb94e273515fd0ab5/FLAG163df5cc0 [2023-12-05 20:59:56,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4a6068a0/65d1f830e03b41bcb94e273515fd0ab5 [2023-12-05 20:59:56,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 20:59:56,820 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 20:59:56,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 20:59:56,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 20:59:56,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 20:59:56,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:59:56" (1/1) ... [2023-12-05 20:59:56,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9fe792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:56, skipping insertion in model container [2023-12-05 20:59:56,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:59:56" (1/1) ... [2023-12-05 20:59:56,864 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 20:59:57,133 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:59:57,146 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 20:59:57,181 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:59:57,209 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 20:59:57,209 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 20:59:57,216 INFO L206 MainTranslator]: Completed translation [2023-12-05 20:59:57,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57 WrapperNode [2023-12-05 20:59:57,216 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 20:59:57,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 20:59:57,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 20:59:57,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 20:59:57,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,255 INFO L138 Inliner]: procedures = 164, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2023-12-05 20:59:57,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 20:59:57,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 20:59:57,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 20:59:57,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 20:59:57,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,272 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 20:59:57,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 20:59:57,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 20:59:57,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 20:59:57,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (1/1) ... [2023-12-05 20:59:57,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:59:57,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:57,317 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 20:59:57,343 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 20:59:57,349 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 20:59:57,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 20:59:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 20:59:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 20:59:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 20:59:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 20:59:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 20:59:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 20:59:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 20:59:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 20:59:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 20:59:57,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 20:59:57,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 20:59:57,354 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 20:59:57,493 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 20:59:57,496 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 20:59:57,660 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 20:59:57,707 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 20:59:57,707 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-05 20:59:57,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:59:57 BoogieIcfgContainer [2023-12-05 20:59:57,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 20:59:57,712 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 20:59:57,712 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 20:59:57,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 20:59:57,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:59:56" (1/3) ... [2023-12-05 20:59:57,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f19ed7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:59:57, skipping insertion in model container [2023-12-05 20:59:57,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:57" (2/3) ... [2023-12-05 20:59:57,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f19ed7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:59:57, skipping insertion in model container [2023-12-05 20:59:57,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:59:57" (3/3) ... [2023-12-05 20:59:57,717 INFO L112 eAbstractionObserver]: Analyzing ICFG 01b_inc-pthread.i [2023-12-05 20:59:57,733 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 20:59:57,733 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 20:59:57,734 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 20:59:57,783 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 20:59:57,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 50 transitions, 104 flow [2023-12-05 20:59:57,838 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2023-12-05 20:59:57,838 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:59:57,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 63 events. 3/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 98 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 31. Up to 4 conditions per place. [2023-12-05 20:59:57,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 50 transitions, 104 flow [2023-12-05 20:59:57,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 50 transitions, 104 flow [2023-12-05 20:59:57,853 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:59:57,859 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;@21ee671d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:59:57,860 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 20:59:57,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:59:57,867 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 20:59:57,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:59:57,867 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:57,868 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:57,868 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 20:59:57,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 407052292, now seen corresponding path program 1 times [2023-12-05 20:59:57,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:57,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096498932] [2023-12-05 20:59:57,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:57,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:58,111 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 20:59:58,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:58,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096498932] [2023-12-05 20:59:58,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096498932] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:58,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:58,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000898859] [2023-12-05 20:59:58,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:58,124 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:58,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:58,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:58,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:58,156 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 50 [2023-12-05 20:59:58,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 20:59:58,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:58,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 50 [2023-12-05 20:59:58,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:58,209 INFO L124 PetriNetUnfolderBase]: 11/83 cut-off events. [2023-12-05 20:59:58,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:59:58,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 83 events. 11/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 225 event pairs, 8 based on Foata normal form. 6/79 useless extension candidates. Maximal degree in co-relation 81. Up to 26 conditions per place. [2023-12-05 20:59:58,212 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 12 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-12-05 20:59:58,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 114 flow [2023-12-05 20:59:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2023-12-05 20:59:58,230 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7266666666666667 [2023-12-05 20:59:58,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 109 transitions. [2023-12-05 20:59:58,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 109 transitions. [2023-12-05 20:59:58,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:58,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 109 transitions. [2023-12-05 20:59:58,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,241 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,246 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-12-05 20:59:58,246 INFO L500 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 114 flow [2023-12-05 20:59:58,246 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 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 20:59:58,247 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:58,247 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:58,247 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 20:59:58,247 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 20:59:58,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:58,249 INFO L85 PathProgramCache]: Analyzing trace with hash 407052293, now seen corresponding path program 1 times [2023-12-05 20:59:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:58,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247499324] [2023-12-05 20:59:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:58,389 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 20:59:58,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:58,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247499324] [2023-12-05 20:59:58,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247499324] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:58,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:58,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:58,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730196220] [2023-12-05 20:59:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:58,392 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:58,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:58,393 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 50 [2023-12-05 20:59:58,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 20:59:58,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:58,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 50 [2023-12-05 20:59:58,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:58,435 INFO L124 PetriNetUnfolderBase]: 6/63 cut-off events. [2023-12-05 20:59:58,435 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2023-12-05 20:59:58,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 63 events. 6/63 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 4 based on Foata normal form. 0/60 useless extension candidates. Maximal degree in co-relation 66. Up to 16 conditions per place. [2023-12-05 20:59:58,436 INFO L140 encePairwiseOnDemand]: 48/50 looper letters, 10 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-12-05 20:59:58,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 132 flow [2023-12-05 20:59:58,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:58,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:58,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2023-12-05 20:59:58,438 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.72 [2023-12-05 20:59:58,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 108 transitions. [2023-12-05 20:59:58,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 108 transitions. [2023-12-05 20:59:58,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:58,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 108 transitions. [2023-12-05 20:59:58,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 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 20:59:58,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:58,442 INFO L308 CegarLoopForPetriNet]: 51 programPoint places, -4 predicate places. [2023-12-05 20:59:58,442 INFO L500 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 132 flow [2023-12-05 20:59:58,442 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 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 20:59:58,442 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:58,443 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:58,443 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 20:59:58,443 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 20:59:58,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:58,444 INFO L85 PathProgramCache]: Analyzing trace with hash -116149667, now seen corresponding path program 1 times [2023-12-05 20:59:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:58,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569797449] [2023-12-05 20:59:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 20:59:58,480 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 20:59:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 20:59:58,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 20:59:58,509 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 20:59:58,510 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 20:59:58,512 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 20:59:58,512 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 20:59:58,512 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 20:59:58,513 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 20:59:58,515 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 20:59:58,515 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 20:59:58,538 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 20:59:58,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 67 transitions, 144 flow [2023-12-05 20:59:58,572 INFO L124 PetriNetUnfolderBase]: 5/95 cut-off events. [2023-12-05 20:59:58,572 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 20:59:58,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 95 events. 5/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 202 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 64. Up to 6 conditions per place. [2023-12-05 20:59:58,573 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 67 transitions, 144 flow [2023-12-05 20:59:58,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 67 transitions, 144 flow [2023-12-05 20:59:58,576 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:59:58,577 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;@21ee671d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:59:58,577 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 20:59:58,581 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:59:58,581 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 20:59:58,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:59:58,581 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:58,581 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:58,581 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 20:59:58,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1281295225, now seen corresponding path program 1 times [2023-12-05 20:59:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:58,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998856198] [2023-12-05 20:59:58,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:58,627 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 20:59:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:58,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998856198] [2023-12-05 20:59:58,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998856198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:58,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:58,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:58,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194069544] [2023-12-05 20:59:58,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:58,629 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:58,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:58,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:58,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:58,630 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 67 [2023-12-05 20:59:58,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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 20:59:58,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:58,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 67 [2023-12-05 20:59:58,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:58,725 INFO L124 PetriNetUnfolderBase]: 126/447 cut-off events. [2023-12-05 20:59:58,725 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-12-05 20:59:58,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 447 events. 126/447 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2658 event pairs, 108 based on Foata normal form. 31/420 useless extension candidates. Maximal degree in co-relation 146. Up to 201 conditions per place. [2023-12-05 20:59:58,732 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 17 selfloop transitions, 1 changer transitions 0/59 dead transitions. [2023-12-05 20:59:58,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 164 flow [2023-12-05 20:59:58,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-12-05 20:59:58,739 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-12-05 20:59:58,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-12-05 20:59:58,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-12-05 20:59:58,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:58,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-12-05 20:59:58,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 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 20:59:58,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 20:59:58,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 20:59:58,744 INFO L308 CegarLoopForPetriNet]: 69 programPoint places, -5 predicate places. [2023-12-05 20:59:58,745 INFO L500 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 164 flow [2023-12-05 20:59:58,745 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 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 20:59:58,745 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:58,745 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:58,745 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 20:59:58,745 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 20:59:58,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:58,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1281295224, now seen corresponding path program 1 times [2023-12-05 20:59:58,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:58,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684011027] [2023-12-05 20:59:58,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:58,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:58,857 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 20:59:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:58,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684011027] [2023-12-05 20:59:58,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684011027] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:58,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715634830] [2023-12-05 20:59:58,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:58,859 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:58,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:58,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:58,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:58,862 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 67 [2023-12-05 20:59:58,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 20:59:58,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:58,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 67 [2023-12-05 20:59:58,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:58,927 INFO L124 PetriNetUnfolderBase]: 76/312 cut-off events. [2023-12-05 20:59:58,928 INFO L125 PetriNetUnfolderBase]: For 80/98 co-relation queries the response was YES. [2023-12-05 20:59:58,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 312 events. 76/312 cut-off events. For 80/98 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1625 event pairs, 64 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 131. Up to 126 conditions per place. [2023-12-05 20:59:58,930 INFO L140 encePairwiseOnDemand]: 65/67 looper letters, 15 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-12-05 20:59:58,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 58 transitions, 192 flow [2023-12-05 20:59:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-12-05 20:59:58,933 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-12-05 20:59:58,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-12-05 20:59:58,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-12-05 20:59:58,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:58,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-12-05 20:59:58,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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 20:59:58,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 20:59:58,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 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 20:59:58,938 INFO L308 CegarLoopForPetriNet]: 69 programPoint places, -4 predicate places. [2023-12-05 20:59:58,938 INFO L500 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 192 flow [2023-12-05 20:59:58,938 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 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 20:59:58,938 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:58,939 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:58,939 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 20:59:58,939 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 20:59:58,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash 377195444, now seen corresponding path program 1 times [2023-12-05 20:59:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71439170] [2023-12-05 20:59:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 20:59:58,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 20:59:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 20:59:58,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 20:59:58,984 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 20:59:58,984 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 20:59:58,984 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 20:59:58,984 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 20:59:58,984 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 20:59:58,985 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 20:59:58,985 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 20:59:58,985 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 20:59:59,007 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 20:59:59,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 84 transitions, 186 flow [2023-12-05 20:59:59,022 INFO L124 PetriNetUnfolderBase]: 7/127 cut-off events. [2023-12-05 20:59:59,022 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 20:59:59,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 7/127 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 306 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 99. Up to 8 conditions per place. [2023-12-05 20:59:59,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 84 transitions, 186 flow [2023-12-05 20:59:59,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 84 transitions, 186 flow [2023-12-05 20:59:59,025 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:59:59,026 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;@21ee671d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:59:59,026 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 20:59:59,029 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:59:59,029 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 20:59:59,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:59:59,029 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:59,030 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:59,030 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 20:59:59,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1602081755, now seen corresponding path program 1 times [2023-12-05 20:59:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:59,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751139912] [2023-12-05 20:59:59,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:59,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:59,081 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 20:59:59,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:59,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751139912] [2023-12-05 20:59:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751139912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:59,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43728287] [2023-12-05 20:59:59,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:59,083 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:59,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:59,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:59,086 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 84 [2023-12-05 20:59:59,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:59,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:59,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 84 [2023-12-05 20:59:59,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:59,448 INFO L124 PetriNetUnfolderBase]: 1001/2567 cut-off events. [2023-12-05 20:59:59,449 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2023-12-05 20:59:59,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 2567 events. 1001/2567 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 21101 event pairs, 908 based on Foata normal form. 156/2425 useless extension candidates. Maximal degree in co-relation 665. Up to 1376 conditions per place. [2023-12-05 20:59:59,474 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 22 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2023-12-05 20:59:59,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 76 transitions, 216 flow [2023-12-05 20:59:59,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:59,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2023-12-05 20:59:59,476 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7579365079365079 [2023-12-05 20:59:59,476 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 191 transitions. [2023-12-05 20:59:59,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 191 transitions. [2023-12-05 20:59:59,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:59,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 191 transitions. [2023-12-05 20:59:59,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 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 20:59:59,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 20:59:59,479 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 20:59:59,481 INFO L308 CegarLoopForPetriNet]: 87 programPoint places, -5 predicate places. [2023-12-05 20:59:59,481 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 216 flow [2023-12-05 20:59:59,482 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:59,482 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:59,482 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:59,482 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 20:59:59,482 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 20:59:59,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1602081756, now seen corresponding path program 1 times [2023-12-05 20:59:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:59,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058727392] [2023-12-05 20:59:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:59,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:59,562 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 20:59:59,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:59,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058727392] [2023-12-05 20:59:59,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058727392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:59,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:59,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:59,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374508241] [2023-12-05 20:59:59,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:59,566 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:59,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:59,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:59,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:59,569 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 84 [2023-12-05 20:59:59,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:59,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:59,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 84 [2023-12-05 20:59:59,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:59,859 INFO L124 PetriNetUnfolderBase]: 626/1757 cut-off events. [2023-12-05 20:59:59,859 INFO L125 PetriNetUnfolderBase]: For 525/623 co-relation queries the response was YES. [2023-12-05 20:59:59,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3641 conditions, 1757 events. 626/1757 cut-off events. For 525/623 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13601 event pairs, 564 based on Foata normal form. 0/1646 useless extension candidates. Maximal degree in co-relation 585. Up to 876 conditions per place. [2023-12-05 20:59:59,875 INFO L140 encePairwiseOnDemand]: 82/84 looper letters, 20 selfloop transitions, 1 changer transitions 0/75 dead transitions. [2023-12-05 20:59:59,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 254 flow [2023-12-05 20:59:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:59,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 190 transitions. [2023-12-05 20:59:59,876 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.753968253968254 [2023-12-05 20:59:59,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 190 transitions. [2023-12-05 20:59:59,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 190 transitions. [2023-12-05 20:59:59,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:59,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 190 transitions. [2023-12-05 20:59:59,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 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 20:59:59,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 20:59:59,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 0 states have call successors, (0), 0 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 20:59:59,879 INFO L308 CegarLoopForPetriNet]: 87 programPoint places, -4 predicate places. [2023-12-05 20:59:59,879 INFO L500 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 254 flow [2023-12-05 20:59:59,879 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:59,879 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:59,879 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:59,879 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 20:59:59,880 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 20:59:59,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:59,880 INFO L85 PathProgramCache]: Analyzing trace with hash -183062125, now seen corresponding path program 1 times [2023-12-05 20:59:59,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:59,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586310197] [2023-12-05 20:59:59,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:59,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 20:59:59,900 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 20:59:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 20:59:59,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 20:59:59,922 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 20:59:59,922 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 20:59:59,922 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 20:59:59,923 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 20:59:59,923 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 20:59:59,923 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 20:59:59,923 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 20:59:59,924 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 20:59:59,971 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 20:59:59,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 101 transitions, 230 flow [2023-12-05 20:59:59,991 INFO L124 PetriNetUnfolderBase]: 9/159 cut-off events. [2023-12-05 20:59:59,991 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 20:59:59,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 159 events. 9/159 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 394 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 135. Up to 10 conditions per place. [2023-12-05 20:59:59,992 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 101 transitions, 230 flow [2023-12-05 20:59:59,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 101 transitions, 230 flow [2023-12-05 20:59:59,996 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:59:59,998 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;@21ee671d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:59:59,998 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:00:00,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:00:00,002 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 21:00:00,002 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:00,002 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:00,002 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:00,006 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:00,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash 467248640, now seen corresponding path program 1 times [2023-12-05 21:00:00,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:00,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748664963] [2023-12-05 21:00:00,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:00,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:00,050 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:00,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:00,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748664963] [2023-12-05 21:00:00,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748664963] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:00,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:00,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:00,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879249101] [2023-12-05 21:00:00,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:00,052 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:00,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:00,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:00,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:00,053 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 101 [2023-12-05 21:00:00,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 101 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:00,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:00,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 101 [2023-12-05 21:00:00,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:01,815 INFO L124 PetriNetUnfolderBase]: 6876/14667 cut-off events. [2023-12-05 21:00:01,815 INFO L125 PetriNetUnfolderBase]: For 2048/2048 co-relation queries the response was YES. [2023-12-05 21:00:01,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24171 conditions, 14667 events. 6876/14667 cut-off events. For 2048/2048 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 143300 event pairs, 6408 based on Foata normal form. 781/13950 useless extension candidates. Maximal degree in co-relation 4075. Up to 8751 conditions per place. [2023-12-05 21:00:01,984 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 27 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-12-05 21:00:01,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 270 flow [2023-12-05 21:00:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:01,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2023-12-05 21:00:01,986 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7656765676567657 [2023-12-05 21:00:01,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 232 transitions. [2023-12-05 21:00:01,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 232 transitions. [2023-12-05 21:00:01,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:01,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 232 transitions. [2023-12-05 21:00:01,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:01,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 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:01,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 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:01,990 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, -5 predicate places. [2023-12-05 21:00:01,990 INFO L500 AbstractCegarLoop]: Abstraction has has 100 places, 93 transitions, 270 flow [2023-12-05 21:00:01,991 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:01,991 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:01,991 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:01,991 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:00:01,991 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:01,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:01,994 INFO L85 PathProgramCache]: Analyzing trace with hash 467248641, now seen corresponding path program 1 times [2023-12-05 21:00:01,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:01,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099083716] [2023-12-05 21:00:01,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:01,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:02,049 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:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099083716] [2023-12-05 21:00:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099083716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:02,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:02,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:02,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372742929] [2023-12-05 21:00:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:02,050 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:02,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:02,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:02,052 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 101 [2023-12-05 21:00:02,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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:02,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:02,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 101 [2023-12-05 21:00:02,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:03,228 INFO L124 PetriNetUnfolderBase]: 4376/9982 cut-off events. [2023-12-05 21:00:03,228 INFO L125 PetriNetUnfolderBase]: For 3550/4048 co-relation queries the response was YES. [2023-12-05 21:00:03,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21992 conditions, 9982 events. 4376/9982 cut-off events. For 3550/4048 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 95380 event pairs, 4064 based on Foata normal form. 0/9421 useless extension candidates. Maximal degree in co-relation 3640. Up to 5626 conditions per place. [2023-12-05 21:00:03,332 INFO L140 encePairwiseOnDemand]: 99/101 looper letters, 25 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-12-05 21:00:03,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 318 flow [2023-12-05 21:00:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 231 transitions. [2023-12-05 21:00:03,333 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7623762376237624 [2023-12-05 21:00:03,333 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 231 transitions. [2023-12-05 21:00:03,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 231 transitions. [2023-12-05 21:00:03,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:03,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 231 transitions. [2023-12-05 21:00:03,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:03,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 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:03,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 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:03,336 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, -4 predicate places. [2023-12-05 21:00:03,336 INFO L500 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 318 flow [2023-12-05 21:00:03,336 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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:03,337 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:03,337 INFO L233 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:03,337 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:00:03,337 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:03,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:03,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1527091315, now seen corresponding path program 1 times [2023-12-05 21:00:03,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:03,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105667452] [2023-12-05 21:00:03,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:03,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:03,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:00:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:03,369 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:00:03,369 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:00:03,370 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:00:03,370 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:00:03,370 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:00:03,370 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:00:03,370 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:00:03,371 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:00:03,371 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-12-05 21:00:03,410 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:00:03,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 118 transitions, 276 flow [2023-12-05 21:00:03,428 INFO L124 PetriNetUnfolderBase]: 11/191 cut-off events. [2023-12-05 21:00:03,429 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-12-05 21:00:03,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 191 events. 11/191 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 496 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 12 conditions per place. [2023-12-05 21:00:03,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 118 transitions, 276 flow [2023-12-05 21:00:03,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 118 transitions, 276 flow [2023-12-05 21:00:03,435 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:00:03,435 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;@21ee671d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:00:03,435 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:00:03,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:00:03,436 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 21:00:03,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:03,437 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:03,437 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:03,437 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:03,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash -390827274, now seen corresponding path program 1 times [2023-12-05 21:00:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:03,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157886707] [2023-12-05 21:00:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:03,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:03,468 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:03,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:03,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157886707] [2023-12-05 21:00:03,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157886707] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:03,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:03,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:03,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277323657] [2023-12-05 21:00:03,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:03,469 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:03,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:03,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:03,470 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 118 [2023-12-05 21:00:03,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:03,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:03,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 118 [2023-12-05 21:00:03,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:12,113 INFO L124 PetriNetUnfolderBase]: 43751/82667 cut-off events. [2023-12-05 21:00:12,113 INFO L125 PetriNetUnfolderBase]: For 16298/16298 co-relation queries the response was YES. [2023-12-05 21:00:12,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140297 conditions, 82667 events. 43751/82667 cut-off events. For 16298/16298 co-relation queries the response was YES. Maximal size of possible extension queue 3457. Compared 901990 event pairs, 41408 based on Foata normal form. 3906/79075 useless extension candidates. Maximal degree in co-relation 24300. Up to 53126 conditions per place. [2023-12-05 21:00:13,279 INFO L140 encePairwiseOnDemand]: 114/118 looper letters, 32 selfloop transitions, 1 changer transitions 0/110 dead transitions. [2023-12-05 21:00:13,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 110 transitions, 326 flow [2023-12-05 21:00:13,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:13,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-12-05 21:00:13,281 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7711864406779662 [2023-12-05 21:00:13,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-12-05 21:00:13,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-12-05 21:00:13,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:13,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-12-05 21:00:13,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 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,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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,283 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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,284 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -5 predicate places. [2023-12-05 21:00:13,284 INFO L500 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 326 flow [2023-12-05 21:00:13,284 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:13,284 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:13,284 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:13,284 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:00:13,285 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:13,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:13,285 INFO L85 PathProgramCache]: Analyzing trace with hash -390827273, now seen corresponding path program 1 times [2023-12-05 21:00:13,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:13,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553471670] [2023-12-05 21:00:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:13,328 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,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553471670] [2023-12-05 21:00:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553471670] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:13,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:13,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:13,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890495746] [2023-12-05 21:00:13,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:13,329 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:13,330 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 118 [2023-12-05 21:00:13,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:13,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 118 [2023-12-05 21:00:13,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:19,313 INFO L124 PetriNetUnfolderBase]: 28126/56107 cut-off events. [2023-12-05 21:00:19,314 INFO L125 PetriNetUnfolderBase]: For 23800/26298 co-relation queries the response was YES. [2023-12-05 21:00:19,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129368 conditions, 56107 events. 28126/56107 cut-off events. For 23800/26298 co-relation queries the response was YES. Maximal size of possible extension queue 2306. Compared 610681 event pairs, 26564 based on Foata normal form. 0/53296 useless extension candidates. Maximal degree in co-relation 22115. Up to 34376 conditions per place. [2023-12-05 21:00:20,148 INFO L140 encePairwiseOnDemand]: 116/118 looper letters, 30 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2023-12-05 21:00:20,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 384 flow [2023-12-05 21:00:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:20,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2023-12-05 21:00:20,150 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.768361581920904 [2023-12-05 21:00:20,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 272 transitions. [2023-12-05 21:00:20,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 272 transitions. [2023-12-05 21:00:20,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:20,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 272 transitions. [2023-12-05 21:00:20,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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:20,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:20,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:20,153 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 21:00:20,153 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 109 transitions, 384 flow [2023-12-05 21:00:20,153 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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:20,153 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:20,153 INFO L233 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:20,153 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:00:20,153 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:20,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1991245517, now seen corresponding path program 1 times [2023-12-05 21:00:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570251507] [2023-12-05 21:00:20,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:20,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:00:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:00:20,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:00:20,183 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:00:20,183 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:00:20,184 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:00:20,184 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:00:20,184 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:00:20,184 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:00:20,185 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:00:20,185 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-12-05 21:00:20,212 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:00:20,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 135 transitions, 324 flow [2023-12-05 21:00:20,230 INFO L124 PetriNetUnfolderBase]: 13/223 cut-off events. [2023-12-05 21:00:20,230 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-12-05 21:00:20,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 223 events. 13/223 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 590 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 210. Up to 14 conditions per place. [2023-12-05 21:00:20,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 135 transitions, 324 flow [2023-12-05 21:00:20,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 135 transitions, 324 flow [2023-12-05 21:00:20,234 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:00:20,234 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;@21ee671d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:00:20,234 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:00:20,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:00:20,236 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-12-05 21:00:20,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:00:20,236 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:20,236 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:20,236 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:20,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:20,236 INFO L85 PathProgramCache]: Analyzing trace with hash -972145987, now seen corresponding path program 1 times [2023-12-05 21:00:20,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:20,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089884689] [2023-12-05 21:00:20,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:20,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:20,261 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:20,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:20,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089884689] [2023-12-05 21:00:20,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089884689] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:20,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:20,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:00:20,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820987427] [2023-12-05 21:00:20,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:20,262 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:20,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:20,263 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 135 [2023-12-05 21:00:20,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 135 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:20,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:20,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 135 [2023-12-05 21:00:20,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand