/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 20:59:44,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 20:59:44,664 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:44,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 20:59:44,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 20:59:44,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 20:59:44,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 20:59:44,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 20:59:44,690 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 20:59:44,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 20:59:44,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 20:59:44,694 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 20:59:44,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 20:59:44,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 20:59:44,696 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 20:59:44,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 20:59:44,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 20:59:44,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 20:59:44,696 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 20:59:44,696 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 20:59:44,696 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 20:59:44,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 20:59:44,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 20:59:44,697 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 20:59:44,697 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 20:59:44,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:59:44,698 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 20:59:44,698 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 20:59:44,698 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 20:59:44,698 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 20:59:44,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 20:59:44,699 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 20:59:44,699 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 20:59:44,699 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:44,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 20:59:44,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 20:59:44,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 20:59:44,915 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 20:59:44,915 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 20:59:44,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-12-05 20:59:46,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 20:59:46,258 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 20:59:46,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2023-12-05 20:59:46,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f6f3a0b4/74ecef19c43e43a4b0675dd4e3e40d00/FLAG4a3a89874 [2023-12-05 20:59:46,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f6f3a0b4/74ecef19c43e43a4b0675dd4e3e40d00 [2023-12-05 20:59:46,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 20:59:46,293 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 20:59:46,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 20:59:46,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 20:59:46,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 20:59:46,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:59:46" (1/1) ... [2023-12-05 20:59:46,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505574a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:46, skipping insertion in model container [2023-12-05 20:59:46,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:59:46" (1/1) ... [2023-12-05 20:59:46,343 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 20:59:46,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:59:46,622 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 20:59:46,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:59:46,690 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 20:59:46,690 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 20:59:46,695 INFO L206 MainTranslator]: Completed translation [2023-12-05 20:59:46,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:46 WrapperNode [2023-12-05 20:59:46,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 20:59:46,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 20:59:46,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 20:59:46,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 20:59:46,701 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:46" (1/1) ... [2023-12-05 20:59:46,720 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:46" (1/1) ... [2023-12-05 20:59:46,743 INFO L138 Inliner]: procedures = 173, calls = 51, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2023-12-05 20:59:46,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 20:59:46,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 20:59:46,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 20:59:46,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 20:59:46,752 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:46" (1/1) ... [2023-12-05 20:59:46,753 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:46" (1/1) ... [2023-12-05 20:59:46,766 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:46" (1/1) ... [2023-12-05 20:59:46,766 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:46" (1/1) ... [2023-12-05 20:59:46,771 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:46" (1/1) ... [2023-12-05 20:59:46,772 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:46" (1/1) ... [2023-12-05 20:59:46,773 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:46" (1/1) ... [2023-12-05 20:59:46,774 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:46" (1/1) ... [2023-12-05 20:59:46,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 20:59:46,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 20:59:46,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 20:59:46,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 20:59:46,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:46" (1/1) ... [2023-12-05 20:59:46,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:59:46,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:59:46,835 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:46,843 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:46,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 20:59:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 20:59:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 20:59:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 20:59:46,863 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-12-05 20:59:46,864 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-12-05 20:59:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 20:59:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 20:59:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 20:59:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 20:59:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 20:59:46,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 20:59:46,864 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-12-05 20:59:46,865 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-12-05 20:59:46,865 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:46,996 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 20:59:46,998 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 20:59:47,223 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 20:59:47,244 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 20:59:47,244 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 20:59:47,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:59:47 BoogieIcfgContainer [2023-12-05 20:59:47,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 20:59:47,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 20:59:47,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 20:59:47,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 20:59:47,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:59:46" (1/3) ... [2023-12-05 20:59:47,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af8b667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:59:47, skipping insertion in model container [2023-12-05 20:59:47,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:59:46" (2/3) ... [2023-12-05 20:59:47,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af8b667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:59:47, skipping insertion in model container [2023-12-05 20:59:47,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:59:47" (3/3) ... [2023-12-05 20:59:47,251 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-12-05 20:59:47,264 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 20:59:47,265 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-12-05 20:59:47,265 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 20:59:47,308 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 20:59:47,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 134 transitions, 296 flow [2023-12-05 20:59:47,370 INFO L124 PetriNetUnfolderBase]: 4/130 cut-off events. [2023-12-05 20:59:47,370 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-05 20:59:47,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 130 events. 4/130 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 197 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-12-05 20:59:47,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 134 transitions, 296 flow [2023-12-05 20:59:47,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 116 transitions, 253 flow [2023-12-05 20:59:47,384 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:59:47,389 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;@4af25dfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:59:47,389 INFO L363 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-12-05 20:59:47,394 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:59:47,394 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-12-05 20:59:47,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:59:47,394 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:47,395 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:47,395 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:47,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:47,399 INFO L85 PathProgramCache]: Analyzing trace with hash 73536276, now seen corresponding path program 1 times [2023-12-05 20:59:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030603827] [2023-12-05 20:59:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:47,772 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:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:47,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030603827] [2023-12-05 20:59:47,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030603827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:47,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:47,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:47,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079817515] [2023-12-05 20:59:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:47,782 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:47,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:47,817 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 134 [2023-12-05 20:59:47,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 116 transitions, 253 flow. Second operand has 3 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:47,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:47,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 134 [2023-12-05 20:59:47,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:48,021 INFO L124 PetriNetUnfolderBase]: 183/859 cut-off events. [2023-12-05 20:59:48,021 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-12-05 20:59:48,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 859 events. 183/859 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5855 event pairs, 183 based on Foata normal form. 170/947 useless extension candidates. Maximal degree in co-relation 966. Up to 321 conditions per place. [2023-12-05 20:59:48,034 INFO L140 encePairwiseOnDemand]: 127/134 looper letters, 33 selfloop transitions, 1 changer transitions 1/106 dead transitions. [2023-12-05 20:59:48,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 106 transitions, 303 flow [2023-12-05 20:59:48,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-12-05 20:59:48,047 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7437810945273632 [2023-12-05 20:59:48,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-12-05 20:59:48,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-12-05 20:59:48,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:48,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-12-05 20:59:48,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:48,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,064 INFO L308 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places. [2023-12-05 20:59:48,064 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 303 flow [2023-12-05 20:59:48,064 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:48,064 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:48,065 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:48,065 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 20:59:48,065 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:48,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:48,067 INFO L85 PathProgramCache]: Analyzing trace with hash 73536277, now seen corresponding path program 1 times [2023-12-05 20:59:48,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:48,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305992101] [2023-12-05 20:59:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:48,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:48,305 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:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305992101] [2023-12-05 20:59:48,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305992101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:48,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:48,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:59:48,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028496387] [2023-12-05 20:59:48,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:48,307 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:59:48,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:48,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:59:48,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:59:48,309 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 134 [2023-12-05 20:59:48,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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:48,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:48,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 134 [2023-12-05 20:59:48,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:48,447 INFO L124 PetriNetUnfolderBase]: 185/799 cut-off events. [2023-12-05 20:59:48,447 INFO L125 PetriNetUnfolderBase]: For 113/127 co-relation queries the response was YES. [2023-12-05 20:59:48,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 799 events. 185/799 cut-off events. For 113/127 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5253 event pairs, 185 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 1063. Up to 334 conditions per place. [2023-12-05 20:59:48,452 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 37 selfloop transitions, 1 changer transitions 1/104 dead transitions. [2023-12-05 20:59:48,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 104 transitions, 373 flow [2023-12-05 20:59:48,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2023-12-05 20:59:48,453 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6990049751243781 [2023-12-05 20:59:48,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 281 transitions. [2023-12-05 20:59:48,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 281 transitions. [2023-12-05 20:59:48,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:48,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 281 transitions. [2023-12-05 20:59:48,454 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:48,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,456 INFO L308 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places. [2023-12-05 20:59:48,456 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 104 transitions, 373 flow [2023-12-05 20:59:48,456 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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:48,456 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:48,456 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:48,456 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 20:59:48,457 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:48,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:48,457 INFO L85 PathProgramCache]: Analyzing trace with hash -492528359, now seen corresponding path program 1 times [2023-12-05 20:59:48,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:48,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012527294] [2023-12-05 20:59:48,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:48,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:48,506 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:48,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:48,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012527294] [2023-12-05 20:59:48,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012527294] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:48,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:48,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:48,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518904087] [2023-12-05 20:59:48,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:48,507 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:48,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:48,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:48,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:48,508 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 134 [2023-12-05 20:59:48,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 104 transitions, 373 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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:48,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:48,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 134 [2023-12-05 20:59:48,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:48,602 INFO L124 PetriNetUnfolderBase]: 172/772 cut-off events. [2023-12-05 20:59:48,602 INFO L125 PetriNetUnfolderBase]: For 265/295 co-relation queries the response was YES. [2023-12-05 20:59:48,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 772 events. 172/772 cut-off events. For 265/295 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5042 event pairs, 172 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 1239. Up to 311 conditions per place. [2023-12-05 20:59:48,608 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 31 selfloop transitions, 1 changer transitions 1/102 dead transitions. [2023-12-05 20:59:48,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 102 transitions, 427 flow [2023-12-05 20:59:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:48,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-12-05 20:59:48,610 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7288557213930348 [2023-12-05 20:59:48,610 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-12-05 20:59:48,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-12-05 20:59:48,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:48,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-12-05 20:59:48,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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:48,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,612 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,612 INFO L308 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places. [2023-12-05 20:59:48,612 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 102 transitions, 427 flow [2023-12-05 20:59:48,613 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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:48,613 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:48,613 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:48,613 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 20:59:48,613 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:48,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash -492528358, now seen corresponding path program 1 times [2023-12-05 20:59:48,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199140385] [2023-12-05 20:59:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:48,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:48,697 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:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:48,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199140385] [2023-12-05 20:59:48,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199140385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:48,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:59:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048794603] [2023-12-05 20:59:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:48,698 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:59:48,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:48,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:59:48,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:59:48,699 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 134 [2023-12-05 20:59:48,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 102 transitions, 427 flow. Second operand has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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:48,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:48,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 134 [2023-12-05 20:59:48,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:48,789 INFO L124 PetriNetUnfolderBase]: 159/745 cut-off events. [2023-12-05 20:59:48,789 INFO L125 PetriNetUnfolderBase]: For 455/513 co-relation queries the response was YES. [2023-12-05 20:59:48,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 745 events. 159/745 cut-off events. For 455/513 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4838 event pairs, 159 based on Foata normal form. 9/699 useless extension candidates. Maximal degree in co-relation 1423. Up to 288 conditions per place. [2023-12-05 20:59:48,795 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 33 selfloop transitions, 1 changer transitions 1/100 dead transitions. [2023-12-05 20:59:48,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 100 transitions, 485 flow [2023-12-05 20:59:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2023-12-05 20:59:48,820 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6890547263681592 [2023-12-05 20:59:48,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 277 transitions. [2023-12-05 20:59:48,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 277 transitions. [2023-12-05 20:59:48,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:48,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 277 transitions. [2023-12-05 20:59:48,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 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:48,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,822 INFO L308 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places. [2023-12-05 20:59:48,822 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 100 transitions, 485 flow [2023-12-05 20:59:48,823 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 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:48,823 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:48,823 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:48,823 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 20:59:48,823 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:48,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:48,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1300656542, now seen corresponding path program 1 times [2023-12-05 20:59:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137114420] [2023-12-05 20:59:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:48,874 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:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:48,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137114420] [2023-12-05 20:59:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137114420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606043878] [2023-12-05 20:59:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:48,876 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:48,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:48,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:48,877 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 134 [2023-12-05 20:59:48,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 100 transitions, 485 flow. Second operand has 3 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:48,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:48,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 134 [2023-12-05 20:59:48,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:48,968 INFO L124 PetriNetUnfolderBase]: 151/705 cut-off events. [2023-12-05 20:59:48,968 INFO L125 PetriNetUnfolderBase]: For 688/760 co-relation queries the response was YES. [2023-12-05 20:59:48,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 705 events. 151/705 cut-off events. For 688/760 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4482 event pairs, 151 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 1541. Up to 272 conditions per place. [2023-12-05 20:59:48,974 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 29 selfloop transitions, 1 changer transitions 1/98 dead transitions. [2023-12-05 20:59:48,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 98 transitions, 527 flow [2023-12-05 20:59:48,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2023-12-05 20:59:48,975 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-12-05 20:59:48,975 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 291 transitions. [2023-12-05 20:59:48,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 291 transitions. [2023-12-05 20:59:48,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:48,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 291 transitions. [2023-12-05 20:59:48,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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:48,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,977 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:48,977 INFO L308 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places. [2023-12-05 20:59:48,978 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 98 transitions, 527 flow [2023-12-05 20:59:48,978 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:48,978 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:48,978 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:48,978 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 20:59:48,978 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:48,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1300656541, now seen corresponding path program 1 times [2023-12-05 20:59:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662467637] [2023-12-05 20:59:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:49,053 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:49,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662467637] [2023-12-05 20:59:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662467637] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:49,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:49,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:49,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916172528] [2023-12-05 20:59:49,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:49,057 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:49,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:49,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:49,059 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 134 [2023-12-05 20:59:49,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 98 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:49,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:49,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 134 [2023-12-05 20:59:49,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:49,142 INFO L124 PetriNetUnfolderBase]: 143/665 cut-off events. [2023-12-05 20:59:49,142 INFO L125 PetriNetUnfolderBase]: For 1095/1225 co-relation queries the response was YES. [2023-12-05 20:59:49,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2239 conditions, 665 events. 143/665 cut-off events. For 1095/1225 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4150 event pairs, 143 based on Foata normal form. 6/636 useless extension candidates. Maximal degree in co-relation 1651. Up to 256 conditions per place. [2023-12-05 20:59:49,148 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 26 selfloop transitions, 1 changer transitions 1/96 dead transitions. [2023-12-05 20:59:49,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 96 transitions, 567 flow [2023-12-05 20:59:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-12-05 20:59:49,150 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-12-05 20:59:49,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-12-05 20:59:49,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-12-05 20:59:49,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:49,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-12-05 20:59:49,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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:49,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:49,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:49,154 INFO L308 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places. [2023-12-05 20:59:49,154 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 96 transitions, 567 flow [2023-12-05 20:59:49,154 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:49,154 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:49,154 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:49,154 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 20:59:49,155 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:49,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:49,155 INFO L85 PathProgramCache]: Analyzing trace with hash 612699201, now seen corresponding path program 1 times [2023-12-05 20:59:49,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:49,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340942037] [2023-12-05 20:59:49,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:49,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:49,194 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:49,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:49,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340942037] [2023-12-05 20:59:49,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340942037] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:49,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:49,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:49,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383067089] [2023-12-05 20:59:49,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:49,198 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:49,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:49,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:49,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:49,199 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 134 [2023-12-05 20:59:49,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 96 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:49,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:49,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 134 [2023-12-05 20:59:49,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:49,288 INFO L124 PetriNetUnfolderBase]: 130/626 cut-off events. [2023-12-05 20:59:49,288 INFO L125 PetriNetUnfolderBase]: For 1448/1596 co-relation queries the response was YES. [2023-12-05 20:59:49,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 626 events. 130/626 cut-off events. For 1448/1596 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3843 event pairs, 130 based on Foata normal form. 6/601 useless extension candidates. Maximal degree in co-relation 1665. Up to 233 conditions per place. [2023-12-05 20:59:49,293 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 27 selfloop transitions, 1 changer transitions 1/94 dead transitions. [2023-12-05 20:59:49,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 94 transitions, 601 flow [2023-12-05 20:59:49,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-12-05 20:59:49,295 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7189054726368159 [2023-12-05 20:59:49,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-12-05 20:59:49,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-12-05 20:59:49,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:49,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-12-05 20:59:49,296 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:49,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:49,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:49,298 INFO L308 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places. [2023-12-05 20:59:49,298 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 94 transitions, 601 flow [2023-12-05 20:59:49,298 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:59:49,298 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:49,298 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:49,298 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 20:59:49,299 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:49,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:49,299 INFO L85 PathProgramCache]: Analyzing trace with hash 612699202, now seen corresponding path program 1 times [2023-12-05 20:59:49,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:49,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312629655] [2023-12-05 20:59:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:49,344 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:49,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312629655] [2023-12-05 20:59:49,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312629655] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:49,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:49,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:59:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654532944] [2023-12-05 20:59:49,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:49,345 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:49,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:49,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:49,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:49,346 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 134 [2023-12-05 20:59:49,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 94 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:49,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:49,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 134 [2023-12-05 20:59:49,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:49,416 INFO L124 PetriNetUnfolderBase]: 117/587 cut-off events. [2023-12-05 20:59:49,416 INFO L125 PetriNetUnfolderBase]: For 1669/1799 co-relation queries the response was YES. [2023-12-05 20:59:49,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2354 conditions, 587 events. 117/587 cut-off events. For 1669/1799 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3522 event pairs, 117 based on Foata normal form. 6/566 useless extension candidates. Maximal degree in co-relation 1655. Up to 210 conditions per place. [2023-12-05 20:59:49,419 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 0 selfloop transitions, 0 changer transitions 92/92 dead transitions. [2023-12-05 20:59:49,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 92 transitions, 633 flow [2023-12-05 20:59:49,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:59:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:59:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-12-05 20:59:49,421 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-12-05 20:59:49,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-12-05 20:59:49,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-12-05 20:59:49,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:49,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-12-05 20:59:49,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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:49,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:49,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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:49,423 INFO L308 CegarLoopForPetriNet]: 125 programPoint places, -4 predicate places. [2023-12-05 20:59:49,423 INFO L500 AbstractCegarLoop]: Abstraction has has 121 places, 92 transitions, 633 flow [2023-12-05 20:59:49,423 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:49,428 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/read_write_lock-2.i_BEv2_AllErrorsAtOnce [2023-12-05 20:59:49,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 20 remaining) [2023-12-05 20:59:49,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 20 remaining) [2023-12-05 20:59:49,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 20 remaining) [2023-12-05 20:59:49,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 20 remaining) [2023-12-05 20:59:49,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 20 remaining) [2023-12-05 20:59:49,444 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 20 remaining) [2023-12-05 20:59:49,445 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 20 remaining) [2023-12-05 20:59:49,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 20 remaining) [2023-12-05 20:59:49,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 20 remaining) [2023-12-05 20:59:49,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 20 remaining) [2023-12-05 20:59:49,446 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 20 remaining) [2023-12-05 20:59:49,446 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 20:59:49,446 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:59:49,448 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 20:59:49,448 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 20:59:49,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:59:49 BasicIcfg [2023-12-05 20:59:49,453 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 20:59:49,453 INFO L158 Benchmark]: Toolchain (without parser) took 3160.04ms. Allocated memory was 201.3MB in the beginning and 280.0MB in the end (delta: 78.6MB). Free memory was 148.2MB in the beginning and 148.4MB in the end (delta: -242.7kB). Peak memory consumption was 79.4MB. Max. memory is 8.0GB. [2023-12-05 20:59:49,453 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 20:59:49,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.66ms. Allocated memory is still 201.3MB. Free memory was 148.2MB in the beginning and 127.9MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-05 20:59:49,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.83ms. Allocated memory is still 201.3MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 20:59:49,454 INFO L158 Benchmark]: Boogie Preprocessor took 44.38ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 124.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-05 20:59:49,454 INFO L158 Benchmark]: RCFGBuilder took 457.46ms. Allocated memory was 201.3MB in the beginning and 280.0MB in the end (delta: 78.6MB). Free memory was 124.1MB in the beginning and 242.0MB in the end (delta: -117.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-05 20:59:49,454 INFO L158 Benchmark]: TraceAbstraction took 2205.51ms. Allocated memory is still 280.0MB. Free memory was 241.5MB in the beginning and 148.4MB in the end (delta: 93.1MB). Peak memory consumption was 93.1MB. Max. memory is 8.0GB. [2023-12-05 20:59:49,455 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.12ms. Allocated memory is still 201.3MB. Free memory is still 149.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 400.66ms. Allocated memory is still 201.3MB. Free memory was 148.2MB in the beginning and 127.9MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.83ms. Allocated memory is still 201.3MB. Free memory was 127.9MB in the beginning and 125.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.38ms. Allocated memory is still 201.3MB. Free memory was 125.5MB in the beginning and 124.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 457.46ms. Allocated memory was 201.3MB in the beginning and 280.0MB in the end (delta: 78.6MB). Free memory was 124.1MB in the beginning and 242.0MB in the end (delta: -117.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 2205.51ms. Allocated memory is still 280.0MB. Free memory was 241.5MB in the beginning and 148.4MB in the end (delta: 93.1MB). Peak memory consumption was 93.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, 160 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.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 172 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 255 IncrementalHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 50 mSDtfsCounter, 255 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=633occurred 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.8s 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:49,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...