/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/25_stack_longest-2-pthread.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:02:55,647 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:02:55,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:02:55,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:02:55,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:02:55,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:02:55,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:02:55,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:02:55,738 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:02:55,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:02:55,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:02:55,741 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:02:55,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:02:55,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:02:55,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:02:55,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:02:55,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:02:55,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:02:55,743 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:02:55,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:02:55,744 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:02:55,744 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:02:55,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:02:55,745 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:02:55,745 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:02:55,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:02:55,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:02:55,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:02:55,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:02:55,746 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:02:55,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:02:55,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:02:55,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:02:55,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:02:55,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:02:55,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:02:55,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:02:55,966 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:02:55,966 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:02:55,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/25_stack_longest-2-pthread.i [2023-12-05 21:02:57,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:02:57,227 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:02:57,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/25_stack_longest-2-pthread.i [2023-12-05 21:02:57,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60fc1853/32f1c32d7bbf4229a0e30bc56c6bd119/FLAG02df3e04a [2023-12-05 21:02:57,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a60fc1853/32f1c32d7bbf4229a0e30bc56c6bd119 [2023-12-05 21:02:57,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:02:57,254 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:02:57,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:02:57,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:02:57,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:02:57,258 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d7c4da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57, skipping insertion in model container [2023-12-05 21:02:57,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,296 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:02:57,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:02:57,497 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:02:57,545 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:02:57,572 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:02:57,572 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:02:57,577 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:02:57,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57 WrapperNode [2023-12-05 21:02:57,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:02:57,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:02:57,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:02:57,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:02:57,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,663 INFO L138 Inliner]: procedures = 172, calls = 39, calls flagged for inlining = 10, calls inlined = 9, statements flattened = 138 [2023-12-05 21:02:57,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:02:57,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:02:57,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:02:57,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:02:57,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,681 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:02:57,685 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:02:57,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:02:57,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:02:57,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (1/1) ... [2023-12-05 21:02:57,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:02:57,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:02:57,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:02:57,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:02:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:02:57,736 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:02:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:02:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:02:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:02:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:02:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:02:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:02:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:02:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:02:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:02:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:02:57,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:02:57,738 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:02:57,829 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:02:57,831 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:02:58,012 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:02:58,069 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:02:58,069 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-05 21:02:58,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:02:58 BoogieIcfgContainer [2023-12-05 21:02:58,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:02:58,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:02:58,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:02:58,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:02:58,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:02:57" (1/3) ... [2023-12-05 21:02:58,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33636889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:02:58, skipping insertion in model container [2023-12-05 21:02:58,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:02:57" (2/3) ... [2023-12-05 21:02:58,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33636889 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:02:58, skipping insertion in model container [2023-12-05 21:02:58,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:02:58" (3/3) ... [2023-12-05 21:02:58,077 INFO L112 eAbstractionObserver]: Analyzing ICFG 25_stack_longest-2-pthread.i [2023-12-05 21:02:58,089 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:02:58,090 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:02:58,090 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:02:58,151 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:58,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 119 transitions, 242 flow [2023-12-05 21:02:58,245 INFO L124 PetriNetUnfolderBase]: 8/132 cut-off events. [2023-12-05 21:02:58,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:58,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 132 events. 8/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 139 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 90. Up to 4 conditions per place. [2023-12-05 21:02:58,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 119 transitions, 242 flow [2023-12-05 21:02:58,257 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 119 transitions, 242 flow [2023-12-05 21:02:58,270 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:58,275 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;@4ce530a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:58,276 INFO L363 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-05 21:02:58,285 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:58,285 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-12-05 21:02:58,285 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:58,285 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:58,286 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:58,286 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-05 21:02:58,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 389655535, now seen corresponding path program 1 times [2023-12-05 21:02:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840278247] [2023-12-05 21:02:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:02:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:58,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840278247] [2023-12-05 21:02:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840278247] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:58,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:58,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573867327] [2023-12-05 21:02:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:58,549 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:58,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:58,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:58,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:58,573 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 119 [2023-12-05 21:02:58,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:58,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 119 [2023-12-05 21:02:58,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:58,676 INFO L124 PetriNetUnfolderBase]: 26/269 cut-off events. [2023-12-05 21:02:58,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:58,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 269 events. 26/269 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 836 event pairs, 14 based on Foata normal form. 12/253 useless extension candidates. Maximal degree in co-relation 275. Up to 44 conditions per place. [2023-12-05 21:02:58,681 INFO L140 encePairwiseOnDemand]: 113/119 looper letters, 17 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2023-12-05 21:02:58,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 108 transitions, 256 flow [2023-12-05 21:02:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-12-05 21:02:58,698 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.84593837535014 [2023-12-05 21:02:58,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-12-05 21:02:58,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-12-05 21:02:58,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:58,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-12-05 21:02:58,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,719 INFO L308 CegarLoopForPetriNet]: 115 programPoint places, -6 predicate places. [2023-12-05 21:02:58,719 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 256 flow [2023-12-05 21:02:58,720 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,720 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:58,720 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:58,720 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:02:58,721 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-05 21:02:58,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:58,721 INFO L85 PathProgramCache]: Analyzing trace with hash 389655536, now seen corresponding path program 1 times [2023-12-05 21:02:58,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:58,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021087829] [2023-12-05 21:02:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:58,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:02:58,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:58,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021087829] [2023-12-05 21:02:58,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021087829] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:58,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:58,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:58,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983215216] [2023-12-05 21:02:58,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:58,896 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:58,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:58,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:58,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:58,897 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 119 [2023-12-05 21:02:58,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:58,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 119 [2023-12-05 21:02:58,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:58,943 INFO L124 PetriNetUnfolderBase]: 15/189 cut-off events. [2023-12-05 21:02:58,943 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2023-12-05 21:02:58,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 189 events. 15/189 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 375 event pairs, 7 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 204. Up to 27 conditions per place. [2023-12-05 21:02:58,946 INFO L140 encePairwiseOnDemand]: 117/119 looper letters, 15 selfloop transitions, 1 changer transitions 0/107 dead transitions. [2023-12-05 21:02:58,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 107 transitions, 284 flow [2023-12-05 21:02:58,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-12-05 21:02:58,948 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8375350140056023 [2023-12-05 21:02:58,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-12-05 21:02:58,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-12-05 21:02:58,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:58,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-12-05 21:02:58,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,952 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,952 INFO L308 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2023-12-05 21:02:58,952 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 284 flow [2023-12-05 21:02:58,953 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:58,953 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:58,953 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:58,953 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:02:58,954 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-05 21:02:58,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1142889730, now seen corresponding path program 1 times [2023-12-05 21:02:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:58,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426891426] [2023-12-05 21:02:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:58,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:02:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:02:59,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:02:59,027 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:02:59,029 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-12-05 21:02:59,031 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (5 of 7 remaining) [2023-12-05 21:02:59,031 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (4 of 7 remaining) [2023-12-05 21:02:59,031 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 7 remaining) [2023-12-05 21:02:59,032 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 7 remaining) [2023-12-05 21:02:59,032 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (1 of 7 remaining) [2023-12-05 21:02:59,034 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 7 remaining) [2023-12-05 21:02:59,035 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:02:59,035 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:02:59,038 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:02:59,038 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:02:59,105 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:02:59,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 195 transitions, 400 flow [2023-12-05 21:02:59,137 INFO L124 PetriNetUnfolderBase]: 15/223 cut-off events. [2023-12-05 21:02:59,142 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:02:59,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 223 events. 15/223 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 443 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 165. Up to 6 conditions per place. [2023-12-05 21:02:59,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 195 transitions, 400 flow [2023-12-05 21:02:59,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 195 transitions, 400 flow [2023-12-05 21:02:59,151 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:02:59,155 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;@4ce530a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:02:59,156 INFO L363 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-12-05 21:02:59,159 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:02:59,159 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2023-12-05 21:02:59,159 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:02:59,159 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:59,159 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:59,159 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:02:59,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash 208882450, now seen corresponding path program 1 times [2023-12-05 21:02:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:59,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470053596] [2023-12-05 21:02:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:02:59,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:59,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470053596] [2023-12-05 21:02:59,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470053596] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:59,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:59,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:59,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284515983] [2023-12-05 21:02:59,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:59,259 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:59,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:59,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:59,286 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 195 [2023-12-05 21:02:59,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 195 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:59,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:59,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 195 [2023-12-05 21:02:59,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:59,621 INFO L124 PetriNetUnfolderBase]: 475/2620 cut-off events. [2023-12-05 21:02:59,622 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-12-05 21:02:59,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 2620 events. 475/2620 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 21312 event pairs, 331 based on Foata normal form. 154/2466 useless extension candidates. Maximal degree in co-relation 718. Up to 628 conditions per place. [2023-12-05 21:02:59,645 INFO L140 encePairwiseOnDemand]: 187/195 looper letters, 26 selfloop transitions, 1 changer transitions 0/181 dead transitions. [2023-12-05 21:02:59,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 181 transitions, 426 flow [2023-12-05 21:02:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:59,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2023-12-05 21:02:59,647 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8683760683760684 [2023-12-05 21:02:59,647 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2023-12-05 21:02:59,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2023-12-05 21:02:59,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:59,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2023-12-05 21:02:59,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:59,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:59,650 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:59,652 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -7 predicate places. [2023-12-05 21:02:59,652 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 181 transitions, 426 flow [2023-12-05 21:02:59,653 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:59,653 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:02:59,653 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:02:59,653 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:02:59,653 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:02:59,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:02:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash 208882451, now seen corresponding path program 1 times [2023-12-05 21:02:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:02:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687938516] [2023-12-05 21:02:59,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:02:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:02:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:02:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:02:59,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:02:59,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687938516] [2023-12-05 21:02:59,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687938516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:02:59,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:02:59,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:02:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280591760] [2023-12-05 21:02:59,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:02:59,795 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:02:59,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:02:59,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:02:59,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:02:59,797 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 195 [2023-12-05 21:02:59,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 181 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:02:59,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:02:59,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 195 [2023-12-05 21:02:59,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:02:59,982 INFO L124 PetriNetUnfolderBase]: 293/1757 cut-off events. [2023-12-05 21:02:59,983 INFO L125 PetriNetUnfolderBase]: For 233/405 co-relation queries the response was YES. [2023-12-05 21:02:59,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 1757 events. 293/1757 cut-off events. For 233/405 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12752 event pairs, 197 based on Foata normal form. 0/1600 useless extension candidates. Maximal degree in co-relation 576. Up to 395 conditions per place. [2023-12-05 21:02:59,996 INFO L140 encePairwiseOnDemand]: 193/195 looper letters, 24 selfloop transitions, 1 changer transitions 0/180 dead transitions. [2023-12-05 21:02:59,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 180 transitions, 472 flow [2023-12-05 21:02:59,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:02:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:02:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-12-05 21:02:59,998 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8598290598290599 [2023-12-05 21:02:59,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-12-05 21:02:59,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-12-05 21:02:59,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:02:59,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-12-05 21:02:59,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:00,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:00,002 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:00,003 INFO L308 CegarLoopForPetriNet]: 187 programPoint places, -6 predicate places. [2023-12-05 21:03:00,003 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 180 transitions, 472 flow [2023-12-05 21:03:00,003 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:00,003 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:03:00,004 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:03:00,004 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:03:00,007 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-12-05 21:03:00,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:03:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1861547134, now seen corresponding path program 1 times [2023-12-05 21:03:00,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:03:00,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173917448] [2023-12-05 21:03:00,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:03:00,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:03:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:03:00,026 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:03:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:03:00,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:03:00,048 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:03:00,049 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2023-12-05 21:03:00,051 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (7 of 9 remaining) [2023-12-05 21:03:00,052 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (6 of 9 remaining) [2023-12-05 21:03:00,052 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-12-05 21:03:00,052 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-12-05 21:03:00,052 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (3 of 9 remaining) [2023-12-05 21:03:00,052 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (2 of 9 remaining) [2023-12-05 21:03:00,052 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (1 of 9 remaining) [2023-12-05 21:03:00,052 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 9 remaining) [2023-12-05 21:03:00,053 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:03:00,053 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:03:00,054 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:03:00,054 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:03:00,114 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:03:00,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 259 places, 271 transitions, 560 flow [2023-12-05 21:03:00,188 INFO L124 PetriNetUnfolderBase]: 22/314 cut-off events. [2023-12-05 21:03:00,189 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:03:00,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 314 events. 22/314 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 858 event pairs, 0 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 240. Up to 8 conditions per place. [2023-12-05 21:03:00,193 INFO L82 GeneralOperation]: Start removeDead. Operand has 259 places, 271 transitions, 560 flow [2023-12-05 21:03:00,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 259 places, 271 transitions, 560 flow [2023-12-05 21:03:00,196 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:03:00,197 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;@4ce530a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:03:00,197 INFO L363 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-12-05 21:03:00,199 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:03:00,199 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2023-12-05 21:03:00,199 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:03:00,199 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:03:00,199 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:03:00,199 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-12-05 21:03:00,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:03:00,200 INFO L85 PathProgramCache]: Analyzing trace with hash 948800513, now seen corresponding path program 1 times [2023-12-05 21:03:00,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:03:00,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873284281] [2023-12-05 21:03:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:03:00,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:03:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:03:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:03:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:03:00,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873284281] [2023-12-05 21:03:00,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873284281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:03:00,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:03:00,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:03:00,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678422553] [2023-12-05 21:03:00,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:03:00,227 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:03:00,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:03:00,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:03:00,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:03:00,228 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 271 [2023-12-05 21:03:00,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 271 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:00,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:03:00,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 271 [2023-12-05 21:03:00,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:03:03,442 INFO L124 PetriNetUnfolderBase]: 6460/25723 cut-off events. [2023-12-05 21:03:03,442 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2023-12-05 21:03:03,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33876 conditions, 25723 events. 6460/25723 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 317472 event pairs, 4912 based on Foata normal form. 1874/24739 useless extension candidates. Maximal degree in co-relation 3271. Up to 7828 conditions per place. [2023-12-05 21:03:03,769 INFO L140 encePairwiseOnDemand]: 261/271 looper letters, 35 selfloop transitions, 1 changer transitions 0/254 dead transitions. [2023-12-05 21:03:03,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 254 transitions, 598 flow [2023-12-05 21:03:03,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:03:03,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:03:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2023-12-05 21:03:03,771 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8782287822878229 [2023-12-05 21:03:03,771 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 714 transitions. [2023-12-05 21:03:03,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 714 transitions. [2023-12-05 21:03:03,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:03:03,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 714 transitions. [2023-12-05 21:03:03,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:03,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:03,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:03,878 INFO L308 CegarLoopForPetriNet]: 259 programPoint places, -8 predicate places. [2023-12-05 21:03:03,878 INFO L500 AbstractCegarLoop]: Abstraction has has 251 places, 254 transitions, 598 flow [2023-12-05 21:03:03,879 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.66666666666666) internal successors, (677), 3 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:03,879 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:03:03,879 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:03:03,879 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:03:03,879 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-12-05 21:03:03,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:03:03,880 INFO L85 PathProgramCache]: Analyzing trace with hash 948800514, now seen corresponding path program 1 times [2023-12-05 21:03:03,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:03:03,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741061942] [2023-12-05 21:03:03,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:03:03,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:03:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:03:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:03:03,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:03:03,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741061942] [2023-12-05 21:03:03,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741061942] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:03:03,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:03:03,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:03:03,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504521597] [2023-12-05 21:03:03,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:03:03,925 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:03:03,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:03:03,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:03:03,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:03:03,927 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 271 [2023-12-05 21:03:03,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 254 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:03,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:03:03,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 271 [2023-12-05 21:03:03,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:03:06,021 INFO L124 PetriNetUnfolderBase]: 4091/17165 cut-off events. [2023-12-05 21:03:06,022 INFO L125 PetriNetUnfolderBase]: For 2507/4683 co-relation queries the response was YES. [2023-12-05 21:03:06,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27502 conditions, 17165 events. 4091/17165 cut-off events. For 2507/4683 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 199894 event pairs, 3059 based on Foata normal form. 0/15688 useless extension candidates. Maximal degree in co-relation 2575. Up to 5003 conditions per place. [2023-12-05 21:03:06,187 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 33 selfloop transitions, 1 changer transitions 0/253 dead transitions. [2023-12-05 21:03:06,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 253 transitions, 662 flow [2023-12-05 21:03:06,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:03:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:03:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions. [2023-12-05 21:03:06,189 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8696186961869619 [2023-12-05 21:03:06,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 707 transitions. [2023-12-05 21:03:06,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions. [2023-12-05 21:03:06,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:03:06,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions. [2023-12-05 21:03:06,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:06,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:06,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:06,193 INFO L308 CegarLoopForPetriNet]: 259 programPoint places, -7 predicate places. [2023-12-05 21:03:06,193 INFO L500 AbstractCegarLoop]: Abstraction has has 252 places, 253 transitions, 662 flow [2023-12-05 21:03:06,193 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:06,193 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:03:06,193 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:03:06,193 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:03:06,194 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-12-05 21:03:06,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:03:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash -356960241, now seen corresponding path program 1 times [2023-12-05 21:03:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:03:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59795672] [2023-12-05 21:03:06,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:03:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:03:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:03:06,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:03:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:03:06,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:03:06,233 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:03:06,233 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2023-12-05 21:03:06,233 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (9 of 11 remaining) [2023-12-05 21:03:06,233 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (8 of 11 remaining) [2023-12-05 21:03:06,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2023-12-05 21:03:06,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2023-12-05 21:03:06,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (5 of 11 remaining) [2023-12-05 21:03:06,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (4 of 11 remaining) [2023-12-05 21:03:06,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (3 of 11 remaining) [2023-12-05 21:03:06,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (2 of 11 remaining) [2023-12-05 21:03:06,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONARRAY_INDEX (1 of 11 remaining) [2023-12-05 21:03:06,234 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONARRAY_INDEX (0 of 11 remaining) [2023-12-05 21:03:06,234 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:03:06,234 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:03:06,235 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:03:06,235 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:03:06,286 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:03:06,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 347 transitions, 722 flow [2023-12-05 21:03:06,345 INFO L124 PetriNetUnfolderBase]: 29/405 cut-off events. [2023-12-05 21:03:06,345 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-12-05 21:03:06,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 405 events. 29/405 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1332 event pairs, 0 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 322. Up to 10 conditions per place. [2023-12-05 21:03:06,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 347 transitions, 722 flow [2023-12-05 21:03:06,358 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 331 places, 347 transitions, 722 flow [2023-12-05 21:03:06,360 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:03:06,361 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;@4ce530a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:03:06,361 INFO L363 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-12-05 21:03:06,362 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:03:06,362 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2023-12-05 21:03:06,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:03:06,363 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:03:06,363 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:03:06,363 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-05 21:03:06,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:03:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1685557572, now seen corresponding path program 1 times [2023-12-05 21:03:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:03:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895435712] [2023-12-05 21:03:06,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:03:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:03:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:03:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:03:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:03:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895435712] [2023-12-05 21:03:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895435712] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:03:06,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:03:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:03:06,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811461868] [2023-12-05 21:03:06,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:03:06,421 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:03:06,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:03:06,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:03:06,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:03:06,423 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 347 [2023-12-05 21:03:06,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 347 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:06,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:03:06,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 347 [2023-12-05 21:03:06,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:03:51,676 INFO L124 PetriNetUnfolderBase]: 77821/251146 cut-off events. [2023-12-05 21:03:51,676 INFO L125 PetriNetUnfolderBase]: For 10957/10957 co-relation queries the response was YES. [2023-12-05 21:03:55,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344836 conditions, 251146 events. 77821/251146 cut-off events. For 10957/10957 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 3966700 event pairs, 61693 based on Foata normal form. 21232/246565 useless extension candidates. Maximal degree in co-relation 33920. Up to 90124 conditions per place. [2023-12-05 21:03:57,750 INFO L140 encePairwiseOnDemand]: 335/347 looper letters, 44 selfloop transitions, 1 changer transitions 0/327 dead transitions. [2023-12-05 21:03:57,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 327 transitions, 772 flow [2023-12-05 21:03:57,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:03:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:03:57,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 920 transitions. [2023-12-05 21:03:57,753 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8837656099903939 [2023-12-05 21:03:57,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 920 transitions. [2023-12-05 21:03:57,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 920 transitions. [2023-12-05 21:03:57,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:03:57,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 920 transitions. [2023-12-05 21:03:57,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 306.6666666666667) internal successors, (920), 3 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:57,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:57,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 347.0) internal successors, (1388), 4 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:57,757 INFO L308 CegarLoopForPetriNet]: 331 programPoint places, -9 predicate places. [2023-12-05 21:03:57,757 INFO L500 AbstractCegarLoop]: Abstraction has has 322 places, 327 transitions, 772 flow [2023-12-05 21:03:57,758 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:57,758 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:03:57,758 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:03:57,758 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:03:57,758 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0ASSERT_VIOLATIONARRAY_INDEX, thr1Err1ASSERT_VIOLATIONARRAY_INDEX, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-12-05 21:03:57,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:03:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1685557571, now seen corresponding path program 1 times [2023-12-05 21:03:57,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:03:57,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722376352] [2023-12-05 21:03:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:03:57,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:03:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:03:57,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:03:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:03:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722376352] [2023-12-05 21:03:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722376352] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:03:57,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:03:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:03:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099124745] [2023-12-05 21:03:57,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:03:57,803 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:03:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:03:57,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:03:57,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:03:57,804 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 347 [2023-12-05 21:03:57,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 327 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:03:57,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:03:57,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 347 [2023-12-05 21:03:57,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand