/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:38:40,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:38:40,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:38:40,480 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:38:40,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:38:40,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:38:40,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:38:40,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:38:40,482 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:38:40,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:38:40,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:38:40,483 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:38:40,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:38:40,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:38:40,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:38:40,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:38:40,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:38:40,491 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:38:40,491 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:38:40,492 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:38:40,493 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:38:40,493 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:38:40,493 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:38:40,494 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:38:40,494 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:38:40,494 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:38:40,494 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:38:40,494 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:38:40,495 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:38:40,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:38:40,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:38:40,495 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:38:40,495 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:38:40,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:38:40,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:38:40,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:38:40,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:38:40,756 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:38:40,756 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:38:40,757 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-11-30 04:38:41,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:38:42,219 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:38:42,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/40_barrier_vf.i [2023-11-30 04:38:42,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bb715140/4ec5f39d149a4e47a90b7a752e6ff3f2/FLAG84f60380f [2023-11-30 04:38:42,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bb715140/4ec5f39d149a4e47a90b7a752e6ff3f2 [2023-11-30 04:38:42,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:38:42,247 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:38:42,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:38:42,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:38:42,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:38:42,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b02001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42, skipping insertion in model container [2023-11-30 04:38:42,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,303 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:38:42,592 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:38:42,603 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:38:42,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:38:42,694 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:38:42,694 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:38:42,701 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:38:42,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42 WrapperNode [2023-11-30 04:38:42,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:38:42,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:38:42,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:38:42,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:38:42,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,732 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,764 INFO L138 Inliner]: procedures = 173, calls = 25, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 80 [2023-11-30 04:38:42,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:38:42,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:38:42,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:38:42,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:38:42,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,793 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:38:42,801 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:38:42,801 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:38:42,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:38:42,802 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (1/1) ... [2023-11-30 04:38:42,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:38:42,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:38:42,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:38:42,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:38:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 04:38:42,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 04:38:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:38:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:38:42,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:38:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:38:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:38:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:38:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:38:42,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:38:42,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:38:42,871 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:38:42,981 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:38:42,983 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:38:43,141 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:38:43,223 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:38:43,223 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-30 04:38:43,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:38:43 BoogieIcfgContainer [2023-11-30 04:38:43,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:38:43,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:38:43,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:38:43,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:38:43,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:38:42" (1/3) ... [2023-11-30 04:38:43,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b6c4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:38:43, skipping insertion in model container [2023-11-30 04:38:43,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:38:42" (2/3) ... [2023-11-30 04:38:43,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b6c4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:38:43, skipping insertion in model container [2023-11-30 04:38:43,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:38:43" (3/3) ... [2023-11-30 04:38:43,233 INFO L112 eAbstractionObserver]: Analyzing ICFG 40_barrier_vf.i [2023-11-30 04:38:43,247 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:38:43,247 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-30 04:38:43,247 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:38:43,280 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:38:43,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 55 transitions, 114 flow [2023-11-30 04:38:43,335 INFO L124 PetriNetUnfolderBase]: 5/68 cut-off events. [2023-11-30 04:38:43,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:43,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 68 events. 5/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 96 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 41. Up to 4 conditions per place. [2023-11-30 04:38:43,340 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 55 transitions, 114 flow [2023-11-30 04:38:43,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 55 transitions, 114 flow [2023-11-30 04:38:43,352 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:38:43,358 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;@2e272942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:38:43,359 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:38:43,404 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:38:43,404 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:38:43,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:43,405 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:43,405 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:43,406 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:43,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:43,411 INFO L85 PathProgramCache]: Analyzing trace with hash 742727004, now seen corresponding path program 1 times [2023-11-30 04:38:43,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:43,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224837563] [2023-11-30 04:38:43,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:43,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:43,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:43,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224837563] [2023-11-30 04:38:43,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224837563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:43,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:43,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:43,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251937169] [2023-11-30 04:38:43,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:43,746 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:43,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:43,778 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 55 [2023-11-30 04:38:43,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 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-11-30 04:38:43,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:43,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 55 [2023-11-30 04:38:43,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:43,827 INFO L124 PetriNetUnfolderBase]: 11/84 cut-off events. [2023-11-30 04:38:43,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:43,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 84 events. 11/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 233 event pairs, 8 based on Foata normal form. 15/89 useless extension candidates. Maximal degree in co-relation 90. Up to 29 conditions per place. [2023-11-30 04:38:43,830 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 12 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-11-30 04:38:43,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 108 flow [2023-11-30 04:38:43,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-30 04:38:43,842 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-30 04:38:43,843 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-30 04:38:43,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-30 04:38:43,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:43,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-30 04:38:43,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:43,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:43,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:43,853 INFO L307 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-30 04:38:43,853 INFO L500 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 108 flow [2023-11-30 04:38:43,854 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-11-30 04:38:43,854 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:43,854 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:43,854 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:38:43,854 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:43,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 742727005, now seen corresponding path program 1 times [2023-11-30 04:38:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:43,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265069843] [2023-11-30 04:38:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:43,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:43,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:43,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:43,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265069843] [2023-11-30 04:38:43,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265069843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:43,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:43,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:43,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188911212] [2023-11-30 04:38:43,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:43,984 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:43,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:43,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:43,986 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 55 [2023-11-30 04:38:43,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:43,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:43,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 55 [2023-11-30 04:38:43,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:44,017 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2023-11-30 04:38:44,018 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2023-11-30 04:38:44,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 62 events. 6/62 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 104 event pairs, 4 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 74. Up to 18 conditions per place. [2023-11-30 04:38:44,018 INFO L140 encePairwiseOnDemand]: 53/55 looper letters, 10 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-11-30 04:38:44,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 126 flow [2023-11-30 04:38:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-30 04:38:44,020 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6727272727272727 [2023-11-30 04:38:44,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-30 04:38:44,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-30 04:38:44,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:44,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-30 04:38:44,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,024 INFO L307 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-11-30 04:38:44,024 INFO L500 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 126 flow [2023-11-30 04:38:44,024 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,024 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:44,025 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:44,025 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:38:44,025 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-11-30 04:38:44,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash -709334880, now seen corresponding path program 1 times [2023-11-30 04:38:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:44,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831280399] [2023-11-30 04:38:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:44,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:38:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:44,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:38:44,066 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:38:44,067 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:38:44,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:38:44,069 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:38:44,069 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:38:44,070 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:38:44,072 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:38:44,072 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 04:38:44,103 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:38:44,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 82 transitions, 174 flow [2023-11-30 04:38:44,133 INFO L124 PetriNetUnfolderBase]: 9/110 cut-off events. [2023-11-30 04:38:44,133 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:38:44,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 110 events. 9/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 257 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 69. Up to 6 conditions per place. [2023-11-30 04:38:44,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 82 transitions, 174 flow [2023-11-30 04:38:44,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 80 places, 82 transitions, 174 flow [2023-11-30 04:38:44,139 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:38:44,145 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;@2e272942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:38:44,147 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:38:44,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:38:44,157 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:38:44,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:44,157 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:44,157 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:44,157 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:44,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1571180708, now seen corresponding path program 1 times [2023-11-30 04:38:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:44,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117466374] [2023-11-30 04:38:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:44,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:44,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:44,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117466374] [2023-11-30 04:38:44,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117466374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:44,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289930812] [2023-11-30 04:38:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:44,219 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:44,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:44,221 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 82 [2023-11-30 04:38:44,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:44,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 82 [2023-11-30 04:38:44,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:44,388 INFO L124 PetriNetUnfolderBase]: 172/552 cut-off events. [2023-11-30 04:38:44,388 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-30 04:38:44,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 552 events. 172/552 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3432 event pairs, 131 based on Foata normal form. 138/617 useless extension candidates. Maximal degree in co-relation 348. Up to 282 conditions per place. [2023-11-30 04:38:44,396 INFO L140 encePairwiseOnDemand]: 72/82 looper letters, 18 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-11-30 04:38:44,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 164 flow [2023-11-30 04:38:44,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2023-11-30 04:38:44,400 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7113821138211383 [2023-11-30 04:38:44,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 175 transitions. [2023-11-30 04:38:44,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 175 transitions. [2023-11-30 04:38:44,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:44,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 175 transitions. [2023-11-30 04:38:44,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,404 INFO L307 CegarLoopForPetriNet]: 80 programPoint places, -17 predicate places. [2023-11-30 04:38:44,404 INFO L500 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 164 flow [2023-11-30 04:38:44,404 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,404 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:44,404 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:44,405 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:38:44,405 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:44,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1571180707, now seen corresponding path program 1 times [2023-11-30 04:38:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:44,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347525483] [2023-11-30 04:38:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347525483] [2023-11-30 04:38:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347525483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:44,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668464345] [2023-11-30 04:38:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:44,464 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:44,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:44,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:44,465 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 82 [2023-11-30 04:38:44,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:44,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 82 [2023-11-30 04:38:44,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:44,529 INFO L124 PetriNetUnfolderBase]: 105/371 cut-off events. [2023-11-30 04:38:44,529 INFO L125 PetriNetUnfolderBase]: For 90/140 co-relation queries the response was YES. [2023-11-30 04:38:44,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 371 events. 105/371 cut-off events. For 90/140 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1966 event pairs, 78 based on Foata normal form. 0/343 useless extension candidates. Maximal degree in co-relation 301. Up to 179 conditions per place. [2023-11-30 04:38:44,533 INFO L140 encePairwiseOnDemand]: 80/82 looper letters, 16 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2023-11-30 04:38:44,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 194 flow [2023-11-30 04:38:44,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2023-11-30 04:38:44,534 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6829268292682927 [2023-11-30 04:38:44,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 168 transitions. [2023-11-30 04:38:44,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 168 transitions. [2023-11-30 04:38:44,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:44,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 168 transitions. [2023-11-30 04:38:44,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,538 INFO L307 CegarLoopForPetriNet]: 80 programPoint places, -16 predicate places. [2023-11-30 04:38:44,538 INFO L500 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 194 flow [2023-11-30 04:38:44,538 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,538 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:44,539 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:44,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:38:44,539 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:44,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:44,540 INFO L85 PathProgramCache]: Analyzing trace with hash -293042147, now seen corresponding path program 1 times [2023-11-30 04:38:44,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:44,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369837947] [2023-11-30 04:38:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:44,554 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:38:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:44,575 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:38:44,575 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:38:44,575 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:38:44,575 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:38:44,576 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:38:44,576 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:38:44,576 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:38:44,577 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:38:44,577 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 04:38:44,624 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:38:44,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 109 transitions, 236 flow [2023-11-30 04:38:44,644 INFO L124 PetriNetUnfolderBase]: 13/152 cut-off events. [2023-11-30 04:38:44,645 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:38:44,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 152 events. 13/152 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 418 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 114. Up to 8 conditions per place. [2023-11-30 04:38:44,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 109 transitions, 236 flow [2023-11-30 04:38:44,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 109 transitions, 236 flow [2023-11-30 04:38:44,649 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:38:44,654 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;@2e272942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:38:44,657 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:38:44,658 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:38:44,658 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-11-30 04:38:44,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:44,658 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:44,659 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:44,659 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:44,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:44,659 INFO L85 PathProgramCache]: Analyzing trace with hash -90129316, now seen corresponding path program 1 times [2023-11-30 04:38:44,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:44,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346203228] [2023-11-30 04:38:44,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:44,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:44,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:44,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346203228] [2023-11-30 04:38:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346203228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:44,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:44,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:44,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132327088] [2023-11-30 04:38:44,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:44,707 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:44,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:44,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:44,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:44,708 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 109 [2023-11-30 04:38:44,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 109 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:44,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:44,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 109 [2023-11-30 04:38:44,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:45,194 INFO L124 PetriNetUnfolderBase]: 1690/3914 cut-off events. [2023-11-30 04:38:45,194 INFO L125 PetriNetUnfolderBase]: For 253/253 co-relation queries the response was YES. [2023-11-30 04:38:45,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6412 conditions, 3914 events. 1690/3914 cut-off events. For 253/253 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 33089 event pairs, 1329 based on Foata normal form. 1152/4615 useless extension candidates. Maximal degree in co-relation 851. Up to 2352 conditions per place. [2023-11-30 04:38:45,220 INFO L140 encePairwiseOnDemand]: 96/109 looper letters, 24 selfloop transitions, 1 changer transitions 0/77 dead transitions. [2023-11-30 04:38:45,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 77 transitions, 222 flow [2023-11-30 04:38:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2023-11-30 04:38:45,221 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7186544342507645 [2023-11-30 04:38:45,221 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 235 transitions. [2023-11-30 04:38:45,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 235 transitions. [2023-11-30 04:38:45,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:45,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 235 transitions. [2023-11-30 04:38:45,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,227 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, -23 predicate places. [2023-11-30 04:38:45,227 INFO L500 AbstractCegarLoop]: Abstraction has has 83 places, 77 transitions, 222 flow [2023-11-30 04:38:45,227 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,227 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:45,228 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:45,228 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:38:45,228 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:45,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash -90129315, now seen corresponding path program 1 times [2023-11-30 04:38:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:45,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001037778] [2023-11-30 04:38:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:45,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:45,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:45,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001037778] [2023-11-30 04:38:45,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001037778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:45,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:45,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:45,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331621258] [2023-11-30 04:38:45,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:45,303 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:45,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:45,304 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 109 [2023-11-30 04:38:45,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 77 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:45,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 109 [2023-11-30 04:38:45,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:45,657 INFO L124 PetriNetUnfolderBase]: 1071/2599 cut-off events. [2023-11-30 04:38:45,658 INFO L125 PetriNetUnfolderBase]: For 686/1024 co-relation queries the response was YES. [2023-11-30 04:38:45,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5783 conditions, 2599 events. 1071/2599 cut-off events. For 686/1024 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 20414 event pairs, 832 based on Foata normal form. 0/2421 useless extension candidates. Maximal degree in co-relation 749. Up to 1517 conditions per place. [2023-11-30 04:38:45,680 INFO L140 encePairwiseOnDemand]: 107/109 looper letters, 22 selfloop transitions, 1 changer transitions 0/76 dead transitions. [2023-11-30 04:38:45,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 264 flow [2023-11-30 04:38:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-11-30 04:38:45,682 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6880733944954128 [2023-11-30 04:38:45,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-11-30 04:38:45,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-11-30 04:38:45,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:45,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-11-30 04:38:45,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,687 INFO L307 CegarLoopForPetriNet]: 106 programPoint places, -22 predicate places. [2023-11-30 04:38:45,687 INFO L500 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 264 flow [2023-11-30 04:38:45,687 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,687 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:45,687 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:45,688 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:38:45,688 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-11-30 04:38:45,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:45,688 INFO L85 PathProgramCache]: Analyzing trace with hash -308127489, now seen corresponding path program 1 times [2023-11-30 04:38:45,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:45,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897180732] [2023-11-30 04:38:45,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:45,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:45,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:38:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:45,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:38:45,737 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:38:45,737 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:38:45,737 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:38:45,737 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:38:45,737 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:38:45,738 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:38:45,738 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:38:45,739 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 04:38:45,784 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:38:45,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 136 transitions, 300 flow [2023-11-30 04:38:45,810 INFO L124 PetriNetUnfolderBase]: 17/194 cut-off events. [2023-11-30 04:38:45,810 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 04:38:45,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 194 events. 17/194 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 571 event pairs, 0 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 160. Up to 10 conditions per place. [2023-11-30 04:38:45,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 136 transitions, 300 flow [2023-11-30 04:38:45,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 136 transitions, 300 flow [2023-11-30 04:38:45,816 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:38:45,817 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;@2e272942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:38:45,817 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:38:45,821 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:38:45,822 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-11-30 04:38:45,822 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:45,822 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:45,822 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:45,822 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:45,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:45,822 INFO L85 PathProgramCache]: Analyzing trace with hash 890913884, now seen corresponding path program 1 times [2023-11-30 04:38:45,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:45,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953384338] [2023-11-30 04:38:45,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:45,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:45,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:45,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953384338] [2023-11-30 04:38:45,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953384338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:45,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627313241] [2023-11-30 04:38:45,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:45,861 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:45,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:45,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:45,863 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 136 [2023-11-30 04:38:45,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 136 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:45,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:45,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 136 [2023-11-30 04:38:45,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:49,115 INFO L124 PetriNetUnfolderBase]: 14110/27398 cut-off events. [2023-11-30 04:38:49,115 INFO L125 PetriNetUnfolderBase]: For 2749/2749 co-relation queries the response was YES. [2023-11-30 04:38:49,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46529 conditions, 27398 events. 14110/27398 cut-off events. For 2749/2749 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 272040 event pairs, 11277 based on Foata normal form. 8892/33571 useless extension candidates. Maximal degree in co-relation 6428. Up to 18084 conditions per place. [2023-11-30 04:38:49,368 INFO L140 encePairwiseOnDemand]: 120/136 looper letters, 30 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2023-11-30 04:38:49,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 96 transitions, 282 flow [2023-11-30 04:38:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-11-30 04:38:49,370 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7230392156862745 [2023-11-30 04:38:49,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-11-30 04:38:49,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-11-30 04:38:49,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:49,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-11-30 04:38:49,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:49,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:49,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:49,374 INFO L307 CegarLoopForPetriNet]: 132 programPoint places, -29 predicate places. [2023-11-30 04:38:49,374 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 282 flow [2023-11-30 04:38:49,374 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:49,374 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:49,374 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:49,374 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:38:49,374 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:49,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:49,375 INFO L85 PathProgramCache]: Analyzing trace with hash 890913885, now seen corresponding path program 1 times [2023-11-30 04:38:49,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:49,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616648036] [2023-11-30 04:38:49,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:49,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:49,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:49,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616648036] [2023-11-30 04:38:49,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616648036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:49,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:49,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795526426] [2023-11-30 04:38:49,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:49,415 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:49,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:49,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:49,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:49,416 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 136 [2023-11-30 04:38:49,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:49,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:49,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 136 [2023-11-30 04:38:49,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:38:51,198 INFO L124 PetriNetUnfolderBase]: 9099/18199 cut-off events. [2023-11-30 04:38:51,199 INFO L125 PetriNetUnfolderBase]: For 5342/7408 co-relation queries the response was YES. [2023-11-30 04:38:51,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42804 conditions, 18199 events. 9099/18199 cut-off events. For 5342/7408 co-relation queries the response was YES. Maximal size of possible extension queue 837. Compared 174319 event pairs, 7216 based on Foata normal form. 0/17121 useless extension candidates. Maximal degree in co-relation 5794. Up to 11777 conditions per place. [2023-11-30 04:38:51,362 INFO L140 encePairwiseOnDemand]: 134/136 looper letters, 28 selfloop transitions, 1 changer transitions 0/95 dead transitions. [2023-11-30 04:38:51,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 95 transitions, 336 flow [2023-11-30 04:38:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:38:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:38:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 282 transitions. [2023-11-30 04:38:51,364 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2023-11-30 04:38:51,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 282 transitions. [2023-11-30 04:38:51,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 282 transitions. [2023-11-30 04:38:51,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:38:51,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 282 transitions. [2023-11-30 04:38:51,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:51,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:51,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:51,367 INFO L307 CegarLoopForPetriNet]: 132 programPoint places, -28 predicate places. [2023-11-30 04:38:51,368 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 95 transitions, 336 flow [2023-11-30 04:38:51,368 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:51,368 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:51,368 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:51,368 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:38:51,368 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-11-30 04:38:51,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash 319042341, now seen corresponding path program 1 times [2023-11-30 04:38:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:51,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521412043] [2023-11-30 04:38:51,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:51,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:51,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:38:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:38:51,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:38:51,412 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:38:51,412 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:38:51,413 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:38:51,413 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:38:51,413 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:38:51,413 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:38:51,413 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:38:51,414 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 04:38:51,446 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:38:51,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 163 transitions, 366 flow [2023-11-30 04:38:51,467 INFO L124 PetriNetUnfolderBase]: 21/236 cut-off events. [2023-11-30 04:38:51,467 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 04:38:51,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 236 events. 21/236 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 729 event pairs, 0 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 207. Up to 12 conditions per place. [2023-11-30 04:38:51,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 163 transitions, 366 flow [2023-11-30 04:38:51,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 163 transitions, 366 flow [2023-11-30 04:38:51,473 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:38:51,476 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;@2e272942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:38:51,477 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:38:51,478 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:38:51,478 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-11-30 04:38:51,478 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:38:51,478 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:38:51,478 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:38:51,478 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:38:51,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:38:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1371948892, now seen corresponding path program 1 times [2023-11-30 04:38:51,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:38:51,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142778950] [2023-11-30 04:38:51,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:38:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:38:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:38:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:38:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:38:51,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142778950] [2023-11-30 04:38:51,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142778950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:38:51,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:38:51,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:38:51,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547475359] [2023-11-30 04:38:51,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:38:51,503 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:38:51,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:38:51,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:38:51,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:38:51,505 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 163 [2023-11-30 04:38:51,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 163 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:38:51,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:38:51,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 163 [2023-11-30 04:38:51,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:39:10,596 INFO L124 PetriNetUnfolderBase]: 108502/188174 cut-off events. [2023-11-30 04:39:10,597 INFO L125 PetriNetUnfolderBase]: For 26005/26005 co-relation queries the response was YES. [2023-11-30 04:39:11,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328050 conditions, 188174 events. 108502/188174 cut-off events. For 26005/26005 co-relation queries the response was YES. Maximal size of possible extension queue 7504. Compared 2069466 event pairs, 87525 based on Foata normal form. 65268/237115 useless extension candidates. Maximal degree in co-relation 46724. Up to 132348 conditions per place. [2023-11-30 04:39:12,548 INFO L140 encePairwiseOnDemand]: 144/163 looper letters, 36 selfloop transitions, 1 changer transitions 0/115 dead transitions. [2023-11-30 04:39:12,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 115 transitions, 344 flow [2023-11-30 04:39:12,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:39:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:39:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-30 04:39:12,549 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7259713701431493 [2023-11-30 04:39:12,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-30 04:39:12,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-30 04:39:12,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:39:12,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-30 04:39:12,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:12,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:12,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:12,552 INFO L307 CegarLoopForPetriNet]: 158 programPoint places, -35 predicate places. [2023-11-30 04:39:12,552 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 115 transitions, 344 flow [2023-11-30 04:39:12,552 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:12,552 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:39:12,552 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:39:12,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:39:12,553 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:39:12,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:39:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1371948893, now seen corresponding path program 1 times [2023-11-30 04:39:12,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:39:12,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997219306] [2023-11-30 04:39:12,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:39:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:39:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:39:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:39:12,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:39:12,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997219306] [2023-11-30 04:39:12,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997219306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:39:12,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:39:12,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:39:12,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599513812] [2023-11-30 04:39:12,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:39:12,591 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:39:12,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:39:12,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:39:12,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:39:12,592 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 163 [2023-11-30 04:39:12,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:12,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:39:12,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 163 [2023-11-30 04:39:12,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:39:25,492 INFO L124 PetriNetUnfolderBase]: 70659/125191 cut-off events. [2023-11-30 04:39:25,492 INFO L125 PetriNetUnfolderBase]: For 41558/53992 co-relation queries the response was YES. [2023-11-30 04:39:26,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306181 conditions, 125191 events. 70659/125191 cut-off events. For 41558/53992 co-relation queries the response was YES. Maximal size of possible extension queue 4989. Compared 1344215 event pairs, 56680 based on Foata normal form. 0/118713 useless extension candidates. Maximal degree in co-relation 42994. Up to 86729 conditions per place. [2023-11-30 04:39:26,824 INFO L140 encePairwiseOnDemand]: 161/163 looper letters, 34 selfloop transitions, 1 changer transitions 0/114 dead transitions. [2023-11-30 04:39:26,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 410 flow [2023-11-30 04:39:26,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:39:26,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:39:26,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-11-30 04:39:26,826 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6932515337423313 [2023-11-30 04:39:26,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-11-30 04:39:26,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-11-30 04:39:26,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:39:26,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-11-30 04:39:26,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:26,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:26,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:26,846 INFO L307 CegarLoopForPetriNet]: 158 programPoint places, -34 predicate places. [2023-11-30 04:39:26,846 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 114 transitions, 410 flow [2023-11-30 04:39:26,846 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:26,846 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:39:26,847 INFO L232 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:39:26,847 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:39:26,847 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-11-30 04:39:26,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:39:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash 609527198, now seen corresponding path program 1 times [2023-11-30 04:39:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:39:26,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809694674] [2023-11-30 04:39:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:39:26,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:39:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:39:26,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:39:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:39:26,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:39:26,890 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:39:26,890 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:39:26,890 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:39:26,891 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:39:26,891 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:39:26,891 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:39:26,891 WARN L227 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:39:26,891 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2023-11-30 04:39:26,920 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:39:26,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 190 transitions, 434 flow [2023-11-30 04:39:26,947 INFO L124 PetriNetUnfolderBase]: 25/278 cut-off events. [2023-11-30 04:39:26,947 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-11-30 04:39:26,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 278 events. 25/278 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 882 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 255. Up to 14 conditions per place. [2023-11-30 04:39:26,950 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 190 transitions, 434 flow [2023-11-30 04:39:26,952 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 190 transitions, 434 flow [2023-11-30 04:39:26,953 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:39:26,953 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;@2e272942, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:39:26,953 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:39:26,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:39:26,954 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-11-30 04:39:26,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:39:26,954 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:39:26,955 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:39:26,955 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:39:26,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:39:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1352975708, now seen corresponding path program 1 times [2023-11-30 04:39:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:39:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542290731] [2023-11-30 04:39:26,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:39:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:39:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:39:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:39:26,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:39:26,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542290731] [2023-11-30 04:39:26,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542290731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:39:26,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:39:26,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:39:26,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326367087] [2023-11-30 04:39:26,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:39:26,983 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:39:26,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:39:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:39:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:39:26,984 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 190 [2023-11-30 04:39:26,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 190 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:39:26,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:39:26,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 190 [2023-11-30 04:39:26,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand