/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-atomic/read_write_lock-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 20:59:36,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 20:59:36,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 20:59:36,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 20:59:36,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 20:59:36,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 20:59:36,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 20:59:36,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 20:59:36,333 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 20:59:36,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 20:59:36,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 20:59:36,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 20:59:36,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 20:59:36,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 20:59:36,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 20:59:36,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 20:59:36,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 20:59:36,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 20:59:36,338 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 20:59:36,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 20:59:36,338 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 20:59:36,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 20:59:36,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 20:59:36,339 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 20:59:36,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 20:59:36,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:59:36,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 20:59:36,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 20:59:36,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 20:59:36,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 20:59:36,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 20:59:36,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 20:59:36,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 20:59:36,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 20:59:36,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 20:59:36,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 20:59:36,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 20:59:36,558 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 20:59:36,558 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 20:59:36,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2023-12-05 20:59:37,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 20:59:37,811 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 20:59:37,811 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2023-12-05 20:59:37,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a28fc42/fe7b74ea1f5341c3b799fc14ccea22fb/FLAG4275127d3 [2023-12-05 20:59:37,832 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96a28fc42/fe7b74ea1f5341c3b799fc14ccea22fb [2023-12-05 20:59:37,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 20:59:37,835 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 20:59:37,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 20:59:37,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 20:59:37,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 20:59:37,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:59:37" (1/1) ... [2023-12-05 20:59:37,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffa9bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:37, skipping insertion in model container [2023-12-05 20:59:37,842 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:59:37" (1/1) ... [2023-12-05 20:59:37,880 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 20:59:38,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:59:38,143 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 20:59:38,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:59:38,205 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 20:59:38,205 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 20:59:38,210 INFO L206 MainTranslator]: Completed translation [2023-12-05 20:59:38,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38 WrapperNode [2023-12-05 20:59:38,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 20:59:38,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 20:59:38,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 20:59:38,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 20:59:38,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,249 INFO L138 Inliner]: procedures = 174, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-12-05 20:59:38,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 20:59:38,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 20:59:38,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 20:59:38,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 20:59:38,256 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,270 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 20:59:38,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 20:59:38,281 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 20:59:38,281 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 20:59:38,281 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (1/1) ... [2023-12-05 20:59:38,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:59:38,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:38,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 20:59:38,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 20:59:38,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 20:59:38,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 20:59:38,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 20:59:38,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 20:59:38,331 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-12-05 20:59:38,331 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-12-05 20:59:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 20:59:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 20:59:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 20:59:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 20:59:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 20:59:38,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 20:59:38,332 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-12-05 20:59:38,332 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-12-05 20:59:38,333 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 20:59:38,414 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 20:59:38,415 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 20:59:38,615 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 20:59:38,647 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 20:59:38,647 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 20:59:38,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:59:38 BoogieIcfgContainer [2023-12-05 20:59:38,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 20:59:38,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 20:59:38,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 20:59:38,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 20:59:38,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:59:37" (1/3) ... [2023-12-05 20:59:38,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3265d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:59:38, skipping insertion in model container [2023-12-05 20:59:38,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:38" (2/3) ... [2023-12-05 20:59:38,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3265d8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:59:38, skipping insertion in model container [2023-12-05 20:59:38,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:59:38" (3/3) ... [2023-12-05 20:59:38,655 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2023-12-05 20:59:38,667 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 20:59:38,667 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-05 20:59:38,667 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 20:59:38,746 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 20:59:38,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 132 transitions, 292 flow [2023-12-05 20:59:38,829 INFO L124 PetriNetUnfolderBase]: 4/128 cut-off events. [2023-12-05 20:59:38,829 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-05 20:59:38,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 128 events. 4/128 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 191 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-12-05 20:59:38,833 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 132 transitions, 292 flow [2023-12-05 20:59:38,839 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 114 transitions, 249 flow [2023-12-05 20:59:38,850 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:59:38,855 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;@7d4d3588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:59:38,855 INFO L363 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-12-05 20:59:38,863 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:59:38,863 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-12-05 20:59:38,863 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:59:38,864 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:38,864 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:38,864 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 20:59:38,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2070448961, now seen corresponding path program 1 times [2023-12-05 20:59:38,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:38,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364910780] [2023-12-05 20:59:38,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:38,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:39,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:39,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364910780] [2023-12-05 20:59:39,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364910780] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:39,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:39,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:39,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345130069] [2023-12-05 20:59:39,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:39,298 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:39,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:39,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:39,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:39,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 132 [2023-12-05 20:59:39,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:39,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:39,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 132 [2023-12-05 20:59:39,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:39,678 INFO L124 PetriNetUnfolderBase]: 427/1358 cut-off events. [2023-12-05 20:59:39,678 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-12-05 20:59:39,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 1358 events. 427/1358 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 9859 event pairs, 427 based on Foata normal form. 234/1447 useless extension candidates. Maximal degree in co-relation 1584. Up to 682 conditions per place. [2023-12-05 20:59:39,693 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 35 selfloop transitions, 1 changer transitions 1/104 dead transitions. [2023-12-05 20:59:39,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 104 transitions, 303 flow [2023-12-05 20:59:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:39,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-12-05 20:59:39,709 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7297979797979798 [2023-12-05 20:59:39,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-12-05 20:59:39,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-12-05 20:59:39,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:39,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-12-05 20:59:39,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 20:59:39,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:39,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:39,729 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 20:59:39,729 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 104 transitions, 303 flow [2023-12-05 20:59:39,730 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:39,730 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:39,730 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:39,730 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 20:59:39,730 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 20:59:39,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2070448962, now seen corresponding path program 1 times [2023-12-05 20:59:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:39,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619972022] [2023-12-05 20:59:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:39,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:39,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:39,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:39,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619972022] [2023-12-05 20:59:39,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619972022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:39,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:39,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:59:39,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827421055] [2023-12-05 20:59:39,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:39,987 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:59:39,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:39,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:59:39,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:59:39,989 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 132 [2023-12-05 20:59:39,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 104 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:39,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:39,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 132 [2023-12-05 20:59:39,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:40,184 INFO L124 PetriNetUnfolderBase]: 413/1246 cut-off events. [2023-12-05 20:59:40,184 INFO L125 PetriNetUnfolderBase]: For 245/287 co-relation queries the response was YES. [2023-12-05 20:59:40,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2639 conditions, 1246 events. 413/1246 cut-off events. For 245/287 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 8733 event pairs, 413 based on Foata normal form. 0/1139 useless extension candidates. Maximal degree in co-relation 1735. Up to 678 conditions per place. [2023-12-05 20:59:40,195 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 39 selfloop transitions, 1 changer transitions 1/102 dead transitions. [2023-12-05 20:59:40,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 102 transitions, 377 flow [2023-12-05 20:59:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:40,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:40,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-12-05 20:59:40,197 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6843434343434344 [2023-12-05 20:59:40,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-12-05 20:59:40,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-12-05 20:59:40,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:40,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-12-05 20:59:40,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,201 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 20:59:40,201 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 102 transitions, 377 flow [2023-12-05 20:59:40,201 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,202 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:40,202 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] [2023-12-05 20:59:40,202 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 20:59:40,203 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 20:59:40,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1281532467, now seen corresponding path program 1 times [2023-12-05 20:59:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687893948] [2023-12-05 20:59:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:40,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:40,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:40,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:40,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687893948] [2023-12-05 20:59:40,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687893948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:40,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:40,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785136250] [2023-12-05 20:59:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:40,306 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:40,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:40,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:40,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:40,309 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 132 [2023-12-05 20:59:40,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 102 transitions, 377 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:40,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 132 [2023-12-05 20:59:40,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:40,450 INFO L124 PetriNetUnfolderBase]: 379/1188 cut-off events. [2023-12-05 20:59:40,451 INFO L125 PetriNetUnfolderBase]: For 563/649 co-relation queries the response was YES. [2023-12-05 20:59:40,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 1188 events. 379/1188 cut-off events. For 563/649 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 8317 event pairs, 379 based on Foata normal form. 0/1101 useless extension candidates. Maximal degree in co-relation 2097. Up to 624 conditions per place. [2023-12-05 20:59:40,460 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 33 selfloop transitions, 1 changer transitions 1/100 dead transitions. [2023-12-05 20:59:40,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 100 transitions, 435 flow [2023-12-05 20:59:40,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-12-05 20:59:40,461 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7146464646464646 [2023-12-05 20:59:40,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-12-05 20:59:40,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-12-05 20:59:40,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:40,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-12-05 20:59:40,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,464 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 20:59:40,465 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 100 transitions, 435 flow [2023-12-05 20:59:40,465 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,465 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:40,465 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] [2023-12-05 20:59:40,465 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 20:59:40,465 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 20:59:40,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:40,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1281532466, now seen corresponding path program 1 times [2023-12-05 20:59:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:40,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535438646] [2023-12-05 20:59:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:40,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:40,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:40,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535438646] [2023-12-05 20:59:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535438646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:40,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:40,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:59:40,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957311395] [2023-12-05 20:59:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:40,565 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:59:40,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:40,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:59:40,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:59:40,566 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 132 [2023-12-05 20:59:40,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 100 transitions, 435 flow. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:40,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 132 [2023-12-05 20:59:40,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:40,708 INFO L124 PetriNetUnfolderBase]: 345/1130 cut-off events. [2023-12-05 20:59:40,708 INFO L125 PetriNetUnfolderBase]: For 966/1112 co-relation queries the response was YES. [2023-12-05 20:59:40,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3450 conditions, 1130 events. 345/1130 cut-off events. For 966/1112 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7874 event pairs, 345 based on Foata normal form. 19/1063 useless extension candidates. Maximal degree in co-relation 2473. Up to 570 conditions per place. [2023-12-05 20:59:40,717 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 35 selfloop transitions, 1 changer transitions 1/98 dead transitions. [2023-12-05 20:59:40,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 98 transitions, 497 flow [2023-12-05 20:59:40,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:40,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2023-12-05 20:59:40,719 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2023-12-05 20:59:40,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 267 transitions. [2023-12-05 20:59:40,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 267 transitions. [2023-12-05 20:59:40,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:40,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 267 transitions. [2023-12-05 20:59:40,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,722 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 20:59:40,722 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 98 transitions, 497 flow [2023-12-05 20:59:40,723 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,723 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:40,723 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 20:59:40,723 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 20:59:40,723 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 20:59:40,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash -982307733, now seen corresponding path program 1 times [2023-12-05 20:59:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144400906] [2023-12-05 20:59:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:40,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144400906] [2023-12-05 20:59:40,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144400906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:40,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736023845] [2023-12-05 20:59:40,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:40,798 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:40,800 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 132 [2023-12-05 20:59:40,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 98 transitions, 497 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:40,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 132 [2023-12-05 20:59:40,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:40,917 INFO L124 PetriNetUnfolderBase]: 331/1084 cut-off events. [2023-12-05 20:59:40,917 INFO L125 PetriNetUnfolderBase]: For 1447/1635 co-relation queries the response was YES. [2023-12-05 20:59:40,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3834 conditions, 1084 events. 331/1084 cut-off events. For 1447/1635 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7502 event pairs, 331 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 2753. Up to 544 conditions per place. [2023-12-05 20:59:40,927 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 31 selfloop transitions, 1 changer transitions 1/96 dead transitions. [2023-12-05 20:59:40,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 96 transitions, 543 flow [2023-12-05 20:59:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-12-05 20:59:40,928 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7095959595959596 [2023-12-05 20:59:40,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-12-05 20:59:40,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-12-05 20:59:40,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:40,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-12-05 20:59:40,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,930 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 20:59:40,931 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 96 transitions, 543 flow [2023-12-05 20:59:40,931 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:40,931 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:40,931 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 20:59:40,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 20:59:40,931 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 20:59:40,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash -982307732, now seen corresponding path program 1 times [2023-12-05 20:59:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549158518] [2023-12-05 20:59:40,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:41,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:41,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549158518] [2023-12-05 20:59:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549158518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:41,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653332571] [2023-12-05 20:59:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:41,036 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:41,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:41,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:41,037 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 132 [2023-12-05 20:59:41,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 96 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:41,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 132 [2023-12-05 20:59:41,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:41,146 INFO L124 PetriNetUnfolderBase]: 317/1038 cut-off events. [2023-12-05 20:59:41,146 INFO L125 PetriNetUnfolderBase]: For 2222/2516 co-relation queries the response was YES. [2023-12-05 20:59:41,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4189 conditions, 1038 events. 317/1038 cut-off events. For 2222/2516 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 7052 event pairs, 317 based on Foata normal form. 10/989 useless extension candidates. Maximal degree in co-relation 3019. Up to 518 conditions per place. [2023-12-05 20:59:41,156 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 28 selfloop transitions, 1 changer transitions 1/94 dead transitions. [2023-12-05 20:59:41,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 94 transitions, 587 flow [2023-12-05 20:59:41,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:41,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:41,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2023-12-05 20:59:41,157 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7323232323232324 [2023-12-05 20:59:41,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 290 transitions. [2023-12-05 20:59:41,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 290 transitions. [2023-12-05 20:59:41,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:41,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 290 transitions. [2023-12-05 20:59:41,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,159 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 20:59:41,159 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 94 transitions, 587 flow [2023-12-05 20:59:41,160 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,160 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:41,160 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, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:41,160 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 20:59:41,160 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 20:59:41,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1269661119, now seen corresponding path program 1 times [2023-12-05 20:59:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:41,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994293822] [2023-12-05 20:59:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:41,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:41,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:41,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:41,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994293822] [2023-12-05 20:59:41,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994293822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:41,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:41,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:41,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074545842] [2023-12-05 20:59:41,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:41,195 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:41,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:41,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:41,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:41,196 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 132 [2023-12-05 20:59:41,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 94 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:41,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 132 [2023-12-05 20:59:41,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:41,329 INFO L124 PetriNetUnfolderBase]: 295/977 cut-off events. [2023-12-05 20:59:41,329 INFO L125 PetriNetUnfolderBase]: For 2987/3335 co-relation queries the response was YES. [2023-12-05 20:59:41,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4407 conditions, 977 events. 295/977 cut-off events. For 2987/3335 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6523 event pairs, 295 based on Foata normal form. 9/933 useless extension candidates. Maximal degree in co-relation 3115. Up to 481 conditions per place. [2023-12-05 20:59:41,338 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 29 selfloop transitions, 1 changer transitions 1/92 dead transitions. [2023-12-05 20:59:41,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 92 transitions, 625 flow [2023-12-05 20:59:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-12-05 20:59:41,339 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-12-05 20:59:41,339 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-12-05 20:59:41,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-12-05 20:59:41,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:41,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-12-05 20:59:41,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,341 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 20:59:41,342 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 92 transitions, 625 flow [2023-12-05 20:59:41,342 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,342 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:41,342 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, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:41,342 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 20:59:41,342 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 17 more)] === [2023-12-05 20:59:41,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:41,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1269661120, now seen corresponding path program 1 times [2023-12-05 20:59:41,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:41,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470938938] [2023-12-05 20:59:41,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:41,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:41,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:41,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470938938] [2023-12-05 20:59:41,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470938938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:41,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408734928] [2023-12-05 20:59:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:41,404 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:41,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:41,405 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 132 [2023-12-05 20:59:41,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 92 transitions, 625 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:41,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 132 [2023-12-05 20:59:41,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:41,508 INFO L124 PetriNetUnfolderBase]: 273/916 cut-off events. [2023-12-05 20:59:41,508 INFO L125 PetriNetUnfolderBase]: For 3572/3914 co-relation queries the response was YES. [2023-12-05 20:59:41,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4580 conditions, 916 events. 273/916 cut-off events. For 3572/3914 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5984 event pairs, 273 based on Foata normal form. 9/878 useless extension candidates. Maximal degree in co-relation 3171. Up to 444 conditions per place. [2023-12-05 20:59:41,513 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 0 selfloop transitions, 0 changer transitions 90/90 dead transitions. [2023-12-05 20:59:41,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 90 transitions, 661 flow [2023-12-05 20:59:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-12-05 20:59:41,514 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-12-05 20:59:41,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-12-05 20:59:41,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-12-05 20:59:41,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:41,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-12-05 20:59:41,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,517 INFO L308 CegarLoopForPetriNet]: 123 programPoint places, -4 predicate places. [2023-12-05 20:59:41,517 INFO L500 AbstractCegarLoop]: Abstraction has has 119 places, 90 transitions, 661 flow [2023-12-05 20:59:41,517 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:41,522 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/read_write_lock-1.i_BEv2_AllErrorsAtOnce [2023-12-05 20:59:41,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 20 remaining) [2023-12-05 20:59:41,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-12-05 20:59:41,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-12-05 20:59:41,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-12-05 20:59:41,542 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-12-05 20:59:41,543 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-12-05 20:59:41,544 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 20 remaining) [2023-12-05 20:59:41,544 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 20 remaining) [2023-12-05 20:59:41,544 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 20 remaining) [2023-12-05 20:59:41,544 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 20 remaining) [2023-12-05 20:59:41,544 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 20:59:41,545 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:41,547 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 20:59:41,547 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 20:59:41,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:59:41 BasicIcfg [2023-12-05 20:59:41,552 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 20:59:41,552 INFO L158 Benchmark]: Toolchain (without parser) took 3717.68ms. Allocated memory was 170.9MB in the beginning and 297.8MB in the end (delta: 126.9MB). Free memory was 124.8MB in the beginning and 150.3MB in the end (delta: -25.4MB). Peak memory consumption was 102.6MB. Max. memory is 8.0GB. [2023-12-05 20:59:41,553 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 20:59:41,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.02ms. Allocated memory is still 170.9MB. Free memory was 124.8MB in the beginning and 104.5MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-05 20:59:41,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.54ms. Allocated memory is still 170.9MB. Free memory was 104.5MB in the beginning and 102.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 20:59:41,553 INFO L158 Benchmark]: Boogie Preprocessor took 30.64ms. Allocated memory is still 170.9MB. Free memory was 102.5MB in the beginning and 100.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 20:59:41,554 INFO L158 Benchmark]: RCFGBuilder took 368.41ms. Allocated memory is still 170.9MB. Free memory was 100.7MB in the beginning and 140.5MB in the end (delta: -39.8MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. [2023-12-05 20:59:41,554 INFO L158 Benchmark]: TraceAbstraction took 2901.59ms. Allocated memory was 170.9MB in the beginning and 297.8MB in the end (delta: 126.9MB). Free memory was 139.9MB in the beginning and 150.3MB in the end (delta: -10.3MB). Peak memory consumption was 117.1MB. Max. memory is 8.0GB. [2023-12-05 20:59:41,555 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 170.9MB. Free memory is still 129.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 374.02ms. Allocated memory is still 170.9MB. Free memory was 124.8MB in the beginning and 104.5MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.54ms. Allocated memory is still 170.9MB. Free memory was 104.5MB in the beginning and 102.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.64ms. Allocated memory is still 170.9MB. Free memory was 102.5MB in the beginning and 100.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 368.41ms. Allocated memory is still 170.9MB. Free memory was 100.7MB in the beginning and 140.5MB in the end (delta: -39.8MB). Peak memory consumption was 20.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2901.59ms. Allocated memory was 170.9MB in the beginning and 297.8MB in the end (delta: 126.9MB). Free memory was 139.9MB in the beginning and 150.3MB in the end (delta: -10.3MB). Peak memory consumption was 117.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 157 locations, 20 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 262 IncrementalHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 50 mSDtfsCounter, 262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=661occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 20:59:41,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...