/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-wmm/safe016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:32,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:32,232 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:09:32,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:32,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:32,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:32,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:32,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:32,260 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:32,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:32,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:32,264 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:32,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:32,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:32,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:32,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:32,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:32,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:32,266 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:32,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:32,266 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:32,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:32,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:32,267 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:32,267 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:32,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:32,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:32,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:32,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:32,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:32,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:32,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:32,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:32,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:09:32,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:09:32,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:09:32,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:09:32,498 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:09:32,498 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:09:32,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2023-12-05 21:09:33,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:09:33,781 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:09:33,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2023-12-05 21:09:33,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946e574f0/5a3db038498543a4b87a4fc53accf095/FLAG7795139cd [2023-12-05 21:09:33,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946e574f0/5a3db038498543a4b87a4fc53accf095 [2023-12-05 21:09:33,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:09:33,809 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:09:33,810 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:33,810 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:09:33,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:09:33,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:33" (1/1) ... [2023-12-05 21:09:33,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e921c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:33, skipping insertion in model container [2023-12-05 21:09:33,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:33" (1/1) ... [2023-12-05 21:09:33,862 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:09:34,163 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:34,179 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:09:34,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:34,291 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:34,291 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:34,296 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:09:34,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34 WrapperNode [2023-12-05 21:09:34,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:34,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:34,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:09:34,298 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:09:34,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,332 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,362 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 190 [2023-12-05 21:09:34,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:34,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:09:34,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:09:34,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:09:34,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,382 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:09:34,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:09:34,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:09:34,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:09:34,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (1/1) ... [2023-12-05 21:09:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:34,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:09:34,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:09:34,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:09:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:09:34,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:09:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:09:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:09:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:09:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:09:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:09:34,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:09:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:09:34,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:09:34,532 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:09:34,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:09:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:09:34,533 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:09:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:09:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:09:34,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:09:34,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:09:34,534 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:09:34,661 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:09:34,662 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:09:35,143 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:09:35,546 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:09:35,546 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:09:35,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:35 BoogieIcfgContainer [2023-12-05 21:09:35,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:09:35,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:09:35,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:09:35,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:09:35,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:09:33" (1/3) ... [2023-12-05 21:09:35,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4020e44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:35, skipping insertion in model container [2023-12-05 21:09:35,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:34" (2/3) ... [2023-12-05 21:09:35,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4020e44d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:35, skipping insertion in model container [2023-12-05 21:09:35,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:35" (3/3) ... [2023-12-05 21:09:35,554 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2023-12-05 21:09:35,567 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:09:35,568 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2023-12-05 21:09:35,568 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:09:35,676 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:09:35,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 205 transitions, 426 flow [2023-12-05 21:09:35,789 INFO L124 PetriNetUnfolderBase]: 3/201 cut-off events. [2023-12-05 21:09:35,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:35,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 201 events. 3/201 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 320 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-12-05 21:09:35,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 205 transitions, 426 flow [2023-12-05 21:09:35,801 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 201 transitions, 414 flow [2023-12-05 21:09:35,810 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:09:35,815 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;@34ab183, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:09:35,815 INFO L363 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2023-12-05 21:09:35,830 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:09:35,830 INFO L124 PetriNetUnfolderBase]: 0/60 cut-off events. [2023-12-05 21:09:35,830 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:35,831 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:35,831 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:35,831 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:35,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:35,835 INFO L85 PathProgramCache]: Analyzing trace with hash -596680210, now seen corresponding path program 1 times [2023-12-05 21:09:35,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294500270] [2023-12-05 21:09:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:36,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:36,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294500270] [2023-12-05 21:09:36,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294500270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446412368] [2023-12-05 21:09:36,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:36,179 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:36,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:36,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:36,209 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 205 [2023-12-05 21:09:36,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 201 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:36,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:36,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 205 [2023-12-05 21:09:36,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:40,463 INFO L124 PetriNetUnfolderBase]: 13860/25691 cut-off events. [2023-12-05 21:09:40,464 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-12-05 21:09:40,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45339 conditions, 25691 events. 13860/25691 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 233605 event pairs, 8946 based on Foata normal form. 684/12782 useless extension candidates. Maximal degree in co-relation 45260. Up to 12689 conditions per place. [2023-12-05 21:09:40,666 INFO L140 encePairwiseOnDemand]: 175/205 looper letters, 73 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2023-12-05 21:09:40,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 189 transitions, 540 flow [2023-12-05 21:09:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:40,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-12-05 21:09:40,676 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.775609756097561 [2023-12-05 21:09:40,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-12-05 21:09:40,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-12-05 21:09:40,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:40,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-12-05 21:09:40,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:40,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:40,686 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:40,688 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -26 predicate places. [2023-12-05 21:09:40,689 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 189 transitions, 540 flow [2023-12-05 21:09:40,689 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:40,689 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:40,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:40,689 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:09:40,689 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:40,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash -596680209, now seen corresponding path program 1 times [2023-12-05 21:09:40,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:40,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021881696] [2023-12-05 21:09:40,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:40,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:40,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021881696] [2023-12-05 21:09:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021881696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:40,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:40,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125670553] [2023-12-05 21:09:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:40,776 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:40,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:40,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:40,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:40,778 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 205 [2023-12-05 21:09:40,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 189 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:40,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:40,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 205 [2023-12-05 21:09:40,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:44,460 INFO L124 PetriNetUnfolderBase]: 13925/25795 cut-off events. [2023-12-05 21:09:44,461 INFO L125 PetriNetUnfolderBase]: For 1800/4536 co-relation queries the response was YES. [2023-12-05 21:09:44,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64151 conditions, 25795 events. 13925/25795 cut-off events. For 1800/4536 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 234280 event pairs, 9011 based on Foata normal form. 0/12155 useless extension candidates. Maximal degree in co-relation 64066. Up to 13896 conditions per place. [2023-12-05 21:09:44,661 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 87 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2023-12-05 21:09:44,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 207 transitions, 790 flow [2023-12-05 21:09:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-12-05 21:09:44,664 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7203252032520325 [2023-12-05 21:09:44,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-12-05 21:09:44,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-12-05 21:09:44,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:44,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-12-05 21:09:44,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:44,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:44,667 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:44,668 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -25 predicate places. [2023-12-05 21:09:44,668 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 207 transitions, 790 flow [2023-12-05 21:09:44,669 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:44,669 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:44,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:44,669 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:09:44,669 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:44,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1170513999, now seen corresponding path program 1 times [2023-12-05 21:09:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:44,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803115656] [2023-12-05 21:09:44,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:44,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:44,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:44,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803115656] [2023-12-05 21:09:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803115656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:44,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:44,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:44,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248189417] [2023-12-05 21:09:44,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:44,841 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:44,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:44,842 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 205 [2023-12-05 21:09:44,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 207 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:44,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:44,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 205 [2023-12-05 21:09:44,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:47,741 INFO L124 PetriNetUnfolderBase]: 8985/18193 cut-off events. [2023-12-05 21:09:47,741 INFO L125 PetriNetUnfolderBase]: For 3609/5443 co-relation queries the response was YES. [2023-12-05 21:09:47,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56703 conditions, 18193 events. 8985/18193 cut-off events. For 3609/5443 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 172189 event pairs, 2257 based on Foata normal form. 0/11140 useless extension candidates. Maximal degree in co-relation 56607. Up to 10365 conditions per place. [2023-12-05 21:09:47,926 INFO L140 encePairwiseOnDemand]: 183/205 looper letters, 96 selfloop transitions, 18 changer transitions 0/226 dead transitions. [2023-12-05 21:09:47,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 226 transitions, 1126 flow [2023-12-05 21:09:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:09:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:09:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 964 transitions. [2023-12-05 21:09:47,928 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6717770034843206 [2023-12-05 21:09:47,928 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 964 transitions. [2023-12-05 21:09:47,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 964 transitions. [2023-12-05 21:09:47,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:47,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 964 transitions. [2023-12-05 21:09:47,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.71428571428572) internal successors, (964), 7 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:47,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:47,933 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:47,934 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -22 predicate places. [2023-12-05 21:09:47,935 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 226 transitions, 1126 flow [2023-12-05 21:09:47,935 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:47,935 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:47,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:47,935 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:09:47,935 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:47,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:47,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1170514000, now seen corresponding path program 1 times [2023-12-05 21:09:47,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:47,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101300508] [2023-12-05 21:09:47,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:47,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:48,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101300508] [2023-12-05 21:09:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101300508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:48,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408783237] [2023-12-05 21:09:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:48,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:48,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:48,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:48,242 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 205 [2023-12-05 21:09:48,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 226 transitions, 1126 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:48,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:48,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 205 [2023-12-05 21:09:48,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:48,970 INFO L124 PetriNetUnfolderBase]: 1995/5063 cut-off events. [2023-12-05 21:09:48,970 INFO L125 PetriNetUnfolderBase]: For 2496/2984 co-relation queries the response was YES. [2023-12-05 21:09:48,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16549 conditions, 5063 events. 1995/5063 cut-off events. For 2496/2984 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 44809 event pairs, 247 based on Foata normal form. 0/4110 useless extension candidates. Maximal degree in co-relation 16444. Up to 2912 conditions per place. [2023-12-05 21:09:49,010 INFO L140 encePairwiseOnDemand]: 193/205 looper letters, 61 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2023-12-05 21:09:49,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 188 transitions, 948 flow [2023-12-05 21:09:49,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:49,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-12-05 21:09:49,015 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.675609756097561 [2023-12-05 21:09:49,015 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-12-05 21:09:49,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-12-05 21:09:49,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:49,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-12-05 21:09:49,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,022 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,023 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -29 predicate places. [2023-12-05 21:09:49,023 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 188 transitions, 948 flow [2023-12-05 21:09:49,024 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,024 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:49,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:49,025 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:09:49,025 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:49,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1299573622, now seen corresponding path program 1 times [2023-12-05 21:09:49,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:49,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620226283] [2023-12-05 21:09:49,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:49,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620226283] [2023-12-05 21:09:49,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620226283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:49,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:49,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:49,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921963111] [2023-12-05 21:09:49,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:49,089 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:49,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:49,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:49,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:49,091 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 205 [2023-12-05 21:09:49,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:49,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:49,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 205 [2023-12-05 21:09:49,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:50,030 INFO L124 PetriNetUnfolderBase]: 2322/5536 cut-off events. [2023-12-05 21:09:50,031 INFO L125 PetriNetUnfolderBase]: For 5630/6356 co-relation queries the response was YES. [2023-12-05 21:09:50,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21890 conditions, 5536 events. 2322/5536 cut-off events. For 5630/6356 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 48433 event pairs, 254 based on Foata normal form. 2/4444 useless extension candidates. Maximal degree in co-relation 21776. Up to 3244 conditions per place. [2023-12-05 21:09:50,080 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 72 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2023-12-05 21:09:50,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 188 transitions, 1100 flow [2023-12-05 21:09:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-12-05 21:09:50,082 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6634146341463415 [2023-12-05 21:09:50,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-12-05 21:09:50,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-12-05 21:09:50,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:50,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-12-05 21:09:50,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,085 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -28 predicate places. [2023-12-05 21:09:50,085 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 188 transitions, 1100 flow [2023-12-05 21:09:50,085 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,086 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:50,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:50,086 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:09:50,086 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:50,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:50,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1299573623, now seen corresponding path program 1 times [2023-12-05 21:09:50,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:50,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843201069] [2023-12-05 21:09:50,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:50,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:50,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:50,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:50,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:50,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843201069] [2023-12-05 21:09:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843201069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:50,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:50,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:50,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002161352] [2023-12-05 21:09:50,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:50,135 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:50,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:50,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:50,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:50,136 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 205 [2023-12-05 21:09:50,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 188 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:50,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 205 [2023-12-05 21:09:50,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:51,112 INFO L124 PetriNetUnfolderBase]: 2321/5537 cut-off events. [2023-12-05 21:09:51,113 INFO L125 PetriNetUnfolderBase]: For 7931/8867 co-relation queries the response was YES. [2023-12-05 21:09:51,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25054 conditions, 5537 events. 2321/5537 cut-off events. For 7931/8867 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 47978 event pairs, 178 based on Foata normal form. 2/4445 useless extension candidates. Maximal degree in co-relation 24932. Up to 3244 conditions per place. [2023-12-05 21:09:51,150 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 82 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2023-12-05 21:09:51,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 204 transitions, 1464 flow [2023-12-05 21:09:51,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:51,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:51,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-12-05 21:09:51,152 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6861788617886179 [2023-12-05 21:09:51,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-12-05 21:09:51,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-12-05 21:09:51,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:51,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-12-05 21:09:51,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,154 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,155 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -27 predicate places. [2023-12-05 21:09:51,155 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 204 transitions, 1464 flow [2023-12-05 21:09:51,155 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,155 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:51,155 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, 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 21:09:51,155 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:09:51,156 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:51,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash 361639883, now seen corresponding path program 1 times [2023-12-05 21:09:51,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:51,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592053499] [2023-12-05 21:09:51,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:51,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:51,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:51,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592053499] [2023-12-05 21:09:51,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592053499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:51,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:51,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:51,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059833839] [2023-12-05 21:09:51,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:51,212 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:51,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:51,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:51,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:51,213 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 205 [2023-12-05 21:09:51,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 204 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:51,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:51,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 205 [2023-12-05 21:09:51,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:52,149 INFO L124 PetriNetUnfolderBase]: 2648/5924 cut-off events. [2023-12-05 21:09:52,149 INFO L125 PetriNetUnfolderBase]: For 16227/17493 co-relation queries the response was YES. [2023-12-05 21:09:52,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30898 conditions, 5924 events. 2648/5924 cut-off events. For 16227/17493 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 50459 event pairs, 178 based on Foata normal form. 2/4688 useless extension candidates. Maximal degree in co-relation 30768. Up to 3572 conditions per place. [2023-12-05 21:09:52,212 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 100 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2023-12-05 21:09:52,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 221 transitions, 1912 flow [2023-12-05 21:09:52,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-12-05 21:09:52,214 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6861788617886179 [2023-12-05 21:09:52,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-12-05 21:09:52,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-12-05 21:09:52,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:52,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-12-05 21:09:52,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,217 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -26 predicate places. [2023-12-05 21:09:52,217 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 221 transitions, 1912 flow [2023-12-05 21:09:52,218 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,218 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:52,218 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, 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 21:09:52,218 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:09:52,218 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:52,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 361639882, now seen corresponding path program 1 times [2023-12-05 21:09:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918922619] [2023-12-05 21:09:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:52,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918922619] [2023-12-05 21:09:52,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918922619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:52,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:52,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:52,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032925637] [2023-12-05 21:09:52,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:52,258 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:52,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:52,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:52,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:52,259 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 205 [2023-12-05 21:09:52,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 221 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:52,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:52,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 205 [2023-12-05 21:09:52,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:53,244 INFO L124 PetriNetUnfolderBase]: 2647/5841 cut-off events. [2023-12-05 21:09:53,245 INFO L125 PetriNetUnfolderBase]: For 20644/22240 co-relation queries the response was YES. [2023-12-05 21:09:53,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34685 conditions, 5841 events. 2647/5841 cut-off events. For 20644/22240 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 48933 event pairs, 178 based on Foata normal form. 2/4605 useless extension candidates. Maximal degree in co-relation 34546. Up to 3581 conditions per place. [2023-12-05 21:09:53,306 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 105 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2023-12-05 21:09:53,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 220 transitions, 2116 flow [2023-12-05 21:09:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-12-05 21:09:53,307 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6601626016260163 [2023-12-05 21:09:53,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-12-05 21:09:53,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-12-05 21:09:53,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:53,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-12-05 21:09:53,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,310 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -25 predicate places. [2023-12-05 21:09:53,310 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 220 transitions, 2116 flow [2023-12-05 21:09:53,311 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,311 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:53,311 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:53,311 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:09:53,311 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:53,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:53,311 INFO L85 PathProgramCache]: Analyzing trace with hash 549908024, now seen corresponding path program 1 times [2023-12-05 21:09:53,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:53,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064269762] [2023-12-05 21:09:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:53,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064269762] [2023-12-05 21:09:53,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064269762] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:53,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:53,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262315382] [2023-12-05 21:09:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:53,369 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:53,370 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 205 [2023-12-05 21:09:53,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 220 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:53,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:53,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 205 [2023-12-05 21:09:53,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:54,766 INFO L124 PetriNetUnfolderBase]: 2968/6368 cut-off events. [2023-12-05 21:09:54,766 INFO L125 PetriNetUnfolderBase]: For 33408/33712 co-relation queries the response was YES. [2023-12-05 21:09:54,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41575 conditions, 6368 events. 2968/6368 cut-off events. For 33408/33712 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 53743 event pairs, 102 based on Foata normal form. 6/5005 useless extension candidates. Maximal degree in co-relation 41428. Up to 3909 conditions per place. [2023-12-05 21:09:54,846 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 119 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2023-12-05 21:09:54,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 239 transitions, 2708 flow [2023-12-05 21:09:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-12-05 21:09:54,850 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6845528455284553 [2023-12-05 21:09:54,850 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-12-05 21:09:54,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-12-05 21:09:54,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:54,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-12-05 21:09:54,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:54,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:54,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:54,852 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -24 predicate places. [2023-12-05 21:09:54,853 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 239 transitions, 2708 flow [2023-12-05 21:09:54,853 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:54,853 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:54,853 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:54,853 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:09:54,853 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:54,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash 549908023, now seen corresponding path program 1 times [2023-12-05 21:09:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740614293] [2023-12-05 21:09:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:54,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740614293] [2023-12-05 21:09:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740614293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:54,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:54,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:54,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199954313] [2023-12-05 21:09:54,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:54,896 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:54,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:54,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:54,897 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 205 [2023-12-05 21:09:54,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 239 transitions, 2708 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:54,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:54,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 205 [2023-12-05 21:09:54,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:56,134 INFO L124 PetriNetUnfolderBase]: 2961/6275 cut-off events. [2023-12-05 21:09:56,135 INFO L125 PetriNetUnfolderBase]: For 41985/42327 co-relation queries the response was YES. [2023-12-05 21:09:56,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45582 conditions, 6275 events. 2961/6275 cut-off events. For 41985/42327 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 52354 event pairs, 102 based on Foata normal form. 6/4912 useless extension candidates. Maximal degree in co-relation 45426. Up to 3924 conditions per place. [2023-12-05 21:09:56,200 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 124 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2023-12-05 21:09:56,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 238 transitions, 2948 flow [2023-12-05 21:09:56,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:56,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-12-05 21:09:56,201 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6585365853658537 [2023-12-05 21:09:56,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-12-05 21:09:56,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-12-05 21:09:56,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:56,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-12-05 21:09:56,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:56,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:56,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:56,204 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -23 predicate places. [2023-12-05 21:09:56,204 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 238 transitions, 2948 flow [2023-12-05 21:09:56,204 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:56,204 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:56,205 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:56,205 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:09:56,205 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:56,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:56,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1437177729, now seen corresponding path program 1 times [2023-12-05 21:09:56,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:56,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527058589] [2023-12-05 21:09:56,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:56,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:56,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:56,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527058589] [2023-12-05 21:09:56,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527058589] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:56,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:56,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:56,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547409376] [2023-12-05 21:09:56,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:56,295 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:56,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:56,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:56,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:56,296 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 205 [2023-12-05 21:09:56,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 238 transitions, 2948 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:56,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:56,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 205 [2023-12-05 21:09:56,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:57,394 INFO L124 PetriNetUnfolderBase]: 2919/6235 cut-off events. [2023-12-05 21:09:57,394 INFO L125 PetriNetUnfolderBase]: For 49234/49612 co-relation queries the response was YES. [2023-12-05 21:09:57,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48111 conditions, 6235 events. 2919/6235 cut-off events. For 49234/49612 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 52083 event pairs, 90 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 47952. Up to 3924 conditions per place. [2023-12-05 21:09:57,475 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 170 selfloop transitions, 15 changer transitions 0/319 dead transitions. [2023-12-05 21:09:57,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 319 transitions, 5109 flow [2023-12-05 21:09:57,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-12-05 21:09:57,478 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.759349593495935 [2023-12-05 21:09:57,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-12-05 21:09:57,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-12-05 21:09:57,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:57,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-12-05 21:09:57,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:57,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:57,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:57,480 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -21 predicate places. [2023-12-05 21:09:57,481 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 319 transitions, 5109 flow [2023-12-05 21:09:57,481 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:57,481 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:57,481 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:57,481 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:09:57,481 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:57,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash 572707858, now seen corresponding path program 1 times [2023-12-05 21:09:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562159473] [2023-12-05 21:09:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:57,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:57,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562159473] [2023-12-05 21:09:57,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562159473] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:57,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:57,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:09:57,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212683905] [2023-12-05 21:09:57,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:57,568 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:09:57,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:57,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:09:57,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:09:57,568 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 205 [2023-12-05 21:09:57,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 319 transitions, 5109 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:57,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:57,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 205 [2023-12-05 21:09:57,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:58,857 INFO L124 PetriNetUnfolderBase]: 2907/6214 cut-off events. [2023-12-05 21:09:58,857 INFO L125 PetriNetUnfolderBase]: For 59441/59857 co-relation queries the response was YES. [2023-12-05 21:09:58,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51605 conditions, 6214 events. 2907/6214 cut-off events. For 59441/59857 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 51971 event pairs, 84 based on Foata normal form. 0/4873 useless extension candidates. Maximal degree in co-relation 51435. Up to 3924 conditions per place. [2023-12-05 21:09:58,937 INFO L140 encePairwiseOnDemand]: 195/205 looper letters, 180 selfloop transitions, 38 changer transitions 0/331 dead transitions. [2023-12-05 21:09:58,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 331 transitions, 5751 flow [2023-12-05 21:09:58,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:09:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:09:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2023-12-05 21:09:58,939 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.676829268292683 [2023-12-05 21:09:58,939 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 555 transitions. [2023-12-05 21:09:58,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 555 transitions. [2023-12-05 21:09:58,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:58,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 555 transitions. [2023-12-05 21:09:58,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:58,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:58,941 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:58,942 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -19 predicate places. [2023-12-05 21:09:58,942 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 331 transitions, 5751 flow [2023-12-05 21:09:58,942 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:58,942 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:58,942 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:58,942 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:09:58,942 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:58,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:58,943 INFO L85 PathProgramCache]: Analyzing trace with hash 572707859, now seen corresponding path program 1 times [2023-12-05 21:09:58,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:58,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430553398] [2023-12-05 21:09:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:58,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:59,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:59,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:59,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430553398] [2023-12-05 21:09:59,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430553398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:59,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:59,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:59,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650962376] [2023-12-05 21:09:59,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:59,159 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:59,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:59,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:59,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:59,160 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 205 [2023-12-05 21:09:59,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 331 transitions, 5751 flow. Second operand has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:59,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:59,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 205 [2023-12-05 21:09:59,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:00,375 INFO L124 PetriNetUnfolderBase]: 2895/6193 cut-off events. [2023-12-05 21:10:00,375 INFO L125 PetriNetUnfolderBase]: For 71556/72010 co-relation queries the response was YES. [2023-12-05 21:10:00,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54486 conditions, 6193 events. 2895/6193 cut-off events. For 71556/72010 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 51963 event pairs, 78 based on Foata normal form. 2/4863 useless extension candidates. Maximal degree in co-relation 54306. Up to 3924 conditions per place. [2023-12-05 21:10:00,481 INFO L140 encePairwiseOnDemand]: 202/205 looper letters, 187 selfloop transitions, 15 changer transitions 0/330 dead transitions. [2023-12-05 21:10:00,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 330 transitions, 6129 flow [2023-12-05 21:10:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 558 transitions. [2023-12-05 21:10:00,483 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6804878048780488 [2023-12-05 21:10:00,483 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 558 transitions. [2023-12-05 21:10:00,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 558 transitions. [2023-12-05 21:10:00,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:00,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 558 transitions. [2023-12-05 21:10:00,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:00,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:00,486 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:00,486 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -17 predicate places. [2023-12-05 21:10:00,487 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 330 transitions, 6129 flow [2023-12-05 21:10:00,487 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:00,487 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:00,487 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:00,487 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:10:00,487 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:00,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:00,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1001279680, now seen corresponding path program 1 times [2023-12-05 21:10:00,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:00,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524504731] [2023-12-05 21:10:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:00,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:00,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:00,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:00,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524504731] [2023-12-05 21:10:00,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524504731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:00,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:00,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:10:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424628847] [2023-12-05 21:10:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:00,658 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:10:00,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:10:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:10:00,659 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 205 [2023-12-05 21:10:00,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 330 transitions, 6129 flow. Second operand has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:00,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:00,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 205 [2023-12-05 21:10:00,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:01,971 INFO L124 PetriNetUnfolderBase]: 2365/5158 cut-off events. [2023-12-05 21:10:01,971 INFO L125 PetriNetUnfolderBase]: For 74155/74645 co-relation queries the response was YES. [2023-12-05 21:10:01,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48336 conditions, 5158 events. 2365/5158 cut-off events. For 74155/74645 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42177 event pairs, 78 based on Foata normal form. 0/4114 useless extension candidates. Maximal degree in co-relation 48145. Up to 3245 conditions per place. [2023-12-05 21:10:02,037 INFO L140 encePairwiseOnDemand]: 186/205 looper letters, 177 selfloop transitions, 49 changer transitions 0/335 dead transitions. [2023-12-05 21:10:02,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 335 transitions, 6721 flow [2023-12-05 21:10:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:10:02,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:10:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 779 transitions. [2023-12-05 21:10:02,039 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2023-12-05 21:10:02,039 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 779 transitions. [2023-12-05 21:10:02,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 779 transitions. [2023-12-05 21:10:02,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:02,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 779 transitions. [2023-12-05 21:10:02,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.83333333333334) internal successors, (779), 6 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:02,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:02,042 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:02,043 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -12 predicate places. [2023-12-05 21:10:02,043 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 335 transitions, 6721 flow [2023-12-05 21:10:02,043 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.28571428571429) internal successors, (849), 7 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:02,043 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:02,043 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:02,043 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:10:02,043 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:02,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:02,044 INFO L85 PathProgramCache]: Analyzing trace with hash 151261094, now seen corresponding path program 1 times [2023-12-05 21:10:02,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:02,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963109302] [2023-12-05 21:10:02,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:02,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963109302] [2023-12-05 21:10:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963109302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:02,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:10:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368517555] [2023-12-05 21:10:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:02,340 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:10:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:02,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:10:02,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:10:02,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 205 [2023-12-05 21:10:02,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 335 transitions, 6721 flow. Second operand has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:02,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:02,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 205 [2023-12-05 21:10:02,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:03,270 INFO L124 PetriNetUnfolderBase]: 1835/4194 cut-off events. [2023-12-05 21:10:03,271 INFO L125 PetriNetUnfolderBase]: For 67954/68484 co-relation queries the response was YES. [2023-12-05 21:10:03,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41083 conditions, 4194 events. 1835/4194 cut-off events. For 67954/68484 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 33286 event pairs, 78 based on Foata normal form. 0/3438 useless extension candidates. Maximal degree in co-relation 40881. Up to 2566 conditions per place. [2023-12-05 21:10:03,327 INFO L140 encePairwiseOnDemand]: 185/205 looper letters, 191 selfloop transitions, 41 changer transitions 0/340 dead transitions. [2023-12-05 21:10:03,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 340 transitions, 7335 flow [2023-12-05 21:10:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:10:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:10:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1005 transitions. [2023-12-05 21:10:03,329 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6128048780487805 [2023-12-05 21:10:03,330 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1005 transitions. [2023-12-05 21:10:03,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1005 transitions. [2023-12-05 21:10:03,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:03,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1005 transitions. [2023-12-05 21:10:03,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.625) internal successors, (1005), 8 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,333 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,334 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, -5 predicate places. [2023-12-05 21:10:03,334 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 340 transitions, 7335 flow [2023-12-05 21:10:03,334 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.77777777777777) internal successors, (1069), 9 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,334 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:03,334 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, 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, 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 21:10:03,334 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:10:03,334 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:03,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash -128492278, now seen corresponding path program 1 times [2023-12-05 21:10:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:03,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446890454] [2023-12-05 21:10:03,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:03,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:03,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446890454] [2023-12-05 21:10:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446890454] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:03,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:10:03,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557889223] [2023-12-05 21:10:03,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:03,655 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:10:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:10:03,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:10:03,656 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 205 [2023-12-05 21:10:03,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 340 transitions, 7335 flow. Second operand has 11 states, 11 states have (on average 116.45454545454545) internal successors, (1281), 11 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:03,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 205 [2023-12-05 21:10:03,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:04,717 INFO L124 PetriNetUnfolderBase]: 1305/3236 cut-off events. [2023-12-05 21:10:04,717 INFO L125 PetriNetUnfolderBase]: For 56893/57463 co-relation queries the response was YES. [2023-12-05 21:10:04,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32513 conditions, 3236 events. 1305/3236 cut-off events. For 56893/57463 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 24776 event pairs, 78 based on Foata normal form. 0/2768 useless extension candidates. Maximal degree in co-relation 32300. Up to 1887 conditions per place. [2023-12-05 21:10:04,756 INFO L140 encePairwiseOnDemand]: 184/205 looper letters, 205 selfloop transitions, 33 changer transitions 0/345 dead transitions. [2023-12-05 21:10:04,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 345 transitions, 7971 flow [2023-12-05 21:10:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:10:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:10:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1223 transitions. [2023-12-05 21:10:04,759 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5965853658536585 [2023-12-05 21:10:04,759 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1223 transitions. [2023-12-05 21:10:04,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1223 transitions. [2023-12-05 21:10:04,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:04,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1223 transitions. [2023-12-05 21:10:04,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.3) internal successors, (1223), 10 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 205.0) internal successors, (2255), 11 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,764 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 205.0) internal successors, (2255), 11 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,764 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, 4 predicate places. [2023-12-05 21:10:04,764 INFO L500 AbstractCegarLoop]: Abstraction has has 215 places, 345 transitions, 7971 flow [2023-12-05 21:10:04,765 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 116.45454545454545) internal successors, (1281), 11 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,765 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:04,765 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, 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, 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 21:10:04,765 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:10:04,765 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:04,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:04,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1665565791, now seen corresponding path program 1 times [2023-12-05 21:10:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:04,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777857594] [2023-12-05 21:10:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:04,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777857594] [2023-12-05 21:10:05,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777857594] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:05,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:05,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:10:05,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837212531] [2023-12-05 21:10:05,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:05,235 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:10:05,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:05,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:10:05,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:10:05,236 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 205 [2023-12-05 21:10:05,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 345 transitions, 7971 flow. Second operand has 13 states, 13 states have (on average 114.23076923076923) internal successors, (1485), 13 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:05,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 205 [2023-12-05 21:10:05,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:05,800 INFO L124 PetriNetUnfolderBase]: 659/1683 cut-off events. [2023-12-05 21:10:05,800 INFO L125 PetriNetUnfolderBase]: For 34709/35319 co-relation queries the response was YES. [2023-12-05 21:10:05,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17222 conditions, 1683 events. 659/1683 cut-off events. For 34709/35319 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9648 event pairs, 24 based on Foata normal form. 0/1647 useless extension candidates. Maximal degree in co-relation 16998. Up to 794 conditions per place. [2023-12-05 21:10:05,811 INFO L140 encePairwiseOnDemand]: 188/205 looper letters, 0 selfloop transitions, 0 changer transitions 319/319 dead transitions. [2023-12-05 21:10:05,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 319 transitions, 7513 flow [2023-12-05 21:10:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:10:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:10:05,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1306 transitions. [2023-12-05 21:10:05,813 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5791574279379157 [2023-12-05 21:10:05,813 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1306 transitions. [2023-12-05 21:10:05,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1306 transitions. [2023-12-05 21:10:05,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:05,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1306 transitions. [2023-12-05 21:10:05,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.72727272727273) internal successors, (1306), 11 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 205.0) internal successors, (2460), 12 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,818 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 205.0) internal successors, (2460), 12 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,818 INFO L308 CegarLoopForPetriNet]: 211 programPoint places, 7 predicate places. [2023-12-05 21:10:05,819 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 319 transitions, 7513 flow [2023-12-05 21:10:05,819 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 114.23076923076923) internal successors, (1485), 13 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,831 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe016_power.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:10:05,859 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 86 remaining) [2023-12-05 21:10:05,862 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 86 remaining) [2023-12-05 21:10:05,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 86 remaining) [2023-12-05 21:10:05,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 86 remaining) [2023-12-05 21:10:05,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 86 remaining) [2023-12-05 21:10:05,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 86 remaining) [2023-12-05 21:10:05,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 86 remaining) [2023-12-05 21:10:05,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 86 remaining) [2023-12-05 21:10:05,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 86 remaining) [2023-12-05 21:10:05,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 86 remaining) [2023-12-05 21:10:05,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 86 remaining) [2023-12-05 21:10:05,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 86 remaining) [2023-12-05 21:10:05,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 86 remaining) [2023-12-05 21:10:05,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 86 remaining) [2023-12-05 21:10:05,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 86 remaining) [2023-12-05 21:10:05,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 86 remaining) [2023-12-05 21:10:05,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 86 remaining) [2023-12-05 21:10:05,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 86 remaining) [2023-12-05 21:10:05,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 86 remaining) [2023-12-05 21:10:05,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 86 remaining) [2023-12-05 21:10:05,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 86 remaining) [2023-12-05 21:10:05,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 86 remaining) [2023-12-05 21:10:05,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 86 remaining) [2023-12-05 21:10:05,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 86 remaining) [2023-12-05 21:10:05,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 86 remaining) [2023-12-05 21:10:05,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 86 remaining) [2023-12-05 21:10:05,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 86 remaining) [2023-12-05 21:10:05,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 86 remaining) [2023-12-05 21:10:05,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 86 remaining) [2023-12-05 21:10:05,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 86 remaining) [2023-12-05 21:10:05,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 86 remaining) [2023-12-05 21:10:05,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 86 remaining) [2023-12-05 21:10:05,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 86 remaining) [2023-12-05 21:10:05,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 86 remaining) [2023-12-05 21:10:05,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 86 remaining) [2023-12-05 21:10:05,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 86 remaining) [2023-12-05 21:10:05,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 86 remaining) [2023-12-05 21:10:05,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 86 remaining) [2023-12-05 21:10:05,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 86 remaining) [2023-12-05 21:10:05,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 86 remaining) [2023-12-05 21:10:05,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 86 remaining) [2023-12-05 21:10:05,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 86 remaining) [2023-12-05 21:10:05,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 86 remaining) [2023-12-05 21:10:05,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 86 remaining) [2023-12-05 21:10:05,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 86 remaining) [2023-12-05 21:10:05,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 86 remaining) [2023-12-05 21:10:05,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 86 remaining) [2023-12-05 21:10:05,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 86 remaining) [2023-12-05 21:10:05,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 86 remaining) [2023-12-05 21:10:05,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 86 remaining) [2023-12-05 21:10:05,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 86 remaining) [2023-12-05 21:10:05,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 86 remaining) [2023-12-05 21:10:05,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 86 remaining) [2023-12-05 21:10:05,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 86 remaining) [2023-12-05 21:10:05,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 86 remaining) [2023-12-05 21:10:05,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 86 remaining) [2023-12-05 21:10:05,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 86 remaining) [2023-12-05 21:10:05,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 86 remaining) [2023-12-05 21:10:05,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 86 remaining) [2023-12-05 21:10:05,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 86 remaining) [2023-12-05 21:10:05,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 86 remaining) [2023-12-05 21:10:05,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 86 remaining) [2023-12-05 21:10:05,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 86 remaining) [2023-12-05 21:10:05,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 86 remaining) [2023-12-05 21:10:05,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 86 remaining) [2023-12-05 21:10:05,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 86 remaining) [2023-12-05 21:10:05,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 86 remaining) [2023-12-05 21:10:05,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 86 remaining) [2023-12-05 21:10:05,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 86 remaining) [2023-12-05 21:10:05,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 86 remaining) [2023-12-05 21:10:05,873 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:10:05,873 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:05,877 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:10:05,878 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:10:05,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:10:05 BasicIcfg [2023-12-05 21:10:05,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:10:05,883 INFO L158 Benchmark]: Toolchain (without parser) took 32073.85ms. Allocated memory was 281.0MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 233.8MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-05 21:10:05,883 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 200.3MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:10:05,883 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.48ms. Allocated memory is still 281.0MB. Free memory was 233.5MB in the beginning and 208.0MB in the end (delta: 25.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-05 21:10:05,883 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.90ms. Allocated memory is still 281.0MB. Free memory was 208.0MB in the beginning and 205.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:05,884 INFO L158 Benchmark]: Boogie Preprocessor took 55.18ms. Allocated memory is still 281.0MB. Free memory was 205.0MB in the beginning and 202.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:05,884 INFO L158 Benchmark]: RCFGBuilder took 1129.07ms. Allocated memory is still 281.0MB. Free memory was 202.3MB in the beginning and 184.7MB in the end (delta: 17.7MB). Peak memory consumption was 70.9MB. Max. memory is 8.0GB. [2023-12-05 21:10:05,884 INFO L158 Benchmark]: TraceAbstraction took 30333.76ms. Allocated memory was 281.0MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 184.2MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2023-12-05 21:10:05,885 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.11ms. Allocated memory is still 200.3MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 486.48ms. Allocated memory is still 281.0MB. Free memory was 233.5MB in the beginning and 208.0MB in the end (delta: 25.5MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.90ms. Allocated memory is still 281.0MB. Free memory was 208.0MB in the beginning and 205.0MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.18ms. Allocated memory is still 281.0MB. Free memory was 205.0MB in the beginning and 202.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1129.07ms. Allocated memory is still 281.0MB. Free memory was 202.3MB in the beginning and 184.7MB in the end (delta: 17.7MB). Peak memory consumption was 70.9MB. Max. memory is 8.0GB. * TraceAbstraction took 30333.76ms. Allocated memory was 281.0MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 184.2MB in the beginning and 3.2GB in the end (delta: -3.0GB). Peak memory consumption was 1.5GB. 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 - 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 - 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 - 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 9 procedures, 265 locations, 86 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: 30.2s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 732 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 221 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1614 IncrementalHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 221 mSolverCounterUnsat, 191 mSDtfsCounter, 1614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7971occurred in iteration=16, InterpolantAutomatonStates: 81, 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.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1397 NumberOfCodeBlocks, 1397 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1380 ConstructedInterpolants, 0 QuantifiedInterpolants, 6346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:10:05,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...