/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:47:01,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:47:01,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:47:01,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:47:01,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:47:01,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:47:01,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:47:01,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:47:01,431 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:47:01,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:47:01,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:47:01,434 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:47:01,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:47:01,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:47:01,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:47:01,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:47:01,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:47:01,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:47:01,437 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:47:01,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:47:01,438 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:47:01,438 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:47:01,438 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:47:01,439 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:47:01,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:47:01,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:47:01,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:47:01,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:47:01,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:47:01,439 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:47:01,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:47:01,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:47:01,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:47:01,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:47:01,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:47:01,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:47:01,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:47:01,719 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:47:01,720 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:47:01,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i [2023-11-30 04:47:03,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:47:03,314 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:47:03,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe000_power.oepc.i [2023-11-30 04:47:03,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797017c88/4dac917a1ac343c3acb29ff8d5e2578c/FLAG80dbb0b3c [2023-11-30 04:47:03,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/797017c88/4dac917a1ac343c3acb29ff8d5e2578c [2023-11-30 04:47:03,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:47:03,350 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:47:03,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:47:03,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:47:03,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:47:03,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a8f2e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03, skipping insertion in model container [2023-11-30 04:47:03,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,403 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:47:03,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:47:03,674 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:47:03,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:47:03,768 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:47:03,769 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:47:03,773 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:47:03,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03 WrapperNode [2023-11-30 04:47:03,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:47:03,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:47:03,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:47:03,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:47:03,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,833 INFO L138 Inliner]: procedures = 176, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2023-11-30 04:47:03,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:47:03,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:47:03,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:47:03,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:47:03,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:47:03,894 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:47:03,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:47:03,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:47:03,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (1/1) ... [2023-11-30 04:47:03,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:47:03,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:47:03,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:47:03,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:47:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:47:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:47:03,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:47:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:47:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:47:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:47:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:47:03,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:47:03,965 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:47:03,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:47:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:47:03,966 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:47:03,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:47:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:47:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:47:03,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:47:03,969 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:47:04,115 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:47:04,116 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:47:04,568 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:47:05,052 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:47:05,052 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:47:05,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:47:05 BoogieIcfgContainer [2023-11-30 04:47:05,054 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:47:05,056 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:47:05,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:47:05,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:47:05,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:47:03" (1/3) ... [2023-11-30 04:47:05,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e98ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:47:05, skipping insertion in model container [2023-11-30 04:47:05,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:03" (2/3) ... [2023-11-30 04:47:05,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e98ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:47:05, skipping insertion in model container [2023-11-30 04:47:05,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:47:05" (3/3) ... [2023-11-30 04:47:05,061 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.oepc.i [2023-11-30 04:47:05,074 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:47:05,074 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-11-30 04:47:05,074 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:47:05,200 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:47:05,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 197 transitions, 406 flow [2023-11-30 04:47:05,312 INFO L124 PetriNetUnfolderBase]: 3/194 cut-off events. [2023-11-30 04:47:05,312 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:47:05,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 3/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 382 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-11-30 04:47:05,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 197 transitions, 406 flow [2023-11-30 04:47:05,328 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 194 transitions, 397 flow [2023-11-30 04:47:05,339 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:47:05,346 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;@4749689, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:47:05,346 INFO L363 AbstractCegarLoop]: Starting to check reachability of 107 error locations. [2023-11-30 04:47:05,357 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:47:05,357 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-30 04:47:05,358 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:47:05,358 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:05,358 INFO L232 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] [2023-11-30 04:47:05,358 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:05,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -127113156, now seen corresponding path program 1 times [2023-11-30 04:47:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301160241] [2023-11-30 04:47:05,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:05,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:05,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:05,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301160241] [2023-11-30 04:47:05,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301160241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:05,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:05,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264066923] [2023-11-30 04:47:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:05,616 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:05,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:05,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:05,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:05,644 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 197 [2023-11-30 04:47:05,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:05,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:05,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 197 [2023-11-30 04:47:05,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:10,492 INFO L124 PetriNetUnfolderBase]: 17481/31841 cut-off events. [2023-11-30 04:47:10,492 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-30 04:47:10,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56489 conditions, 31841 events. 17481/31841 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 299201 event pairs, 11961 based on Foata normal form. 900/15509 useless extension candidates. Maximal degree in co-relation 56414. Up to 16876 conditions per place. [2023-11-30 04:47:10,726 INFO L140 encePairwiseOnDemand]: 157/197 looper letters, 74 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-11-30 04:47:10,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 175 transitions, 511 flow [2023-11-30 04:47:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:10,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-30 04:47:10,742 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7614213197969543 [2023-11-30 04:47:10,743 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-30 04:47:10,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-30 04:47:10,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:10,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-30 04:47:10,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:10,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:10,756 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:10,759 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -36 predicate places. [2023-11-30 04:47:10,759 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 175 transitions, 511 flow [2023-11-30 04:47:10,760 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:10,760 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:10,760 INFO L232 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] [2023-11-30 04:47:10,761 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:47:10,761 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:10,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:10,762 INFO L85 PathProgramCache]: Analyzing trace with hash -127113155, now seen corresponding path program 1 times [2023-11-30 04:47:10,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:10,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424663092] [2023-11-30 04:47:10,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:10,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:10,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:10,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:10,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424663092] [2023-11-30 04:47:10,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424663092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:10,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:10,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131481865] [2023-11-30 04:47:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:10,940 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:10,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:10,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:10,941 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:47:10,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 175 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:10,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:10,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:47:10,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:15,368 INFO L124 PetriNetUnfolderBase]: 17543/31942 cut-off events. [2023-11-30 04:47:15,368 INFO L125 PetriNetUnfolderBase]: For 2060/6944 co-relation queries the response was YES. [2023-11-30 04:47:15,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80409 conditions, 31942 events. 17543/31942 cut-off events. For 2060/6944 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 299947 event pairs, 12023 based on Foata normal form. 0/14661 useless extension candidates. Maximal degree in co-relation 80328. Up to 18473 conditions per place. [2023-11-30 04:47:15,585 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 92 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2023-11-30 04:47:15,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 196 transitions, 783 flow [2023-11-30 04:47:15,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:15,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-30 04:47:15,587 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-30 04:47:15,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-30 04:47:15,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-30 04:47:15,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:15,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-30 04:47:15,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:15,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:15,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:15,591 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -35 predicate places. [2023-11-30 04:47:15,591 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 196 transitions, 783 flow [2023-11-30 04:47:15,591 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:15,591 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:15,591 INFO L232 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-11-30 04:47:15,592 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:47:15,592 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:15,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:15,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1334224858, now seen corresponding path program 1 times [2023-11-30 04:47:15,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:15,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980637437] [2023-11-30 04:47:15,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:15,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:15,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:15,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980637437] [2023-11-30 04:47:15,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980637437] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:15,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:15,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:47:15,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285187814] [2023-11-30 04:47:15,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:15,941 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:47:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:15,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:47:15,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:47:15,942 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197 [2023-11-30 04:47:15,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 196 transitions, 783 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:15,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:15,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197 [2023-11-30 04:47:15,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:18,664 INFO L124 PetriNetUnfolderBase]: 10538/20915 cut-off events. [2023-11-30 04:47:18,665 INFO L125 PetriNetUnfolderBase]: For 4146/7692 co-relation queries the response was YES. [2023-11-30 04:47:18,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66372 conditions, 20915 events. 10538/20915 cut-off events. For 4146/7692 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 200628 event pairs, 3002 based on Foata normal form. 0/12552 useless extension candidates. Maximal degree in co-relation 66280. Up to 11676 conditions per place. [2023-11-30 04:47:18,780 INFO L140 encePairwiseOnDemand]: 174/197 looper letters, 101 selfloop transitions, 19 changer transitions 0/217 dead transitions. [2023-11-30 04:47:18,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 217 transitions, 1145 flow [2023-11-30 04:47:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:47:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:47:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-11-30 04:47:18,782 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6243654822335025 [2023-11-30 04:47:18,782 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-11-30 04:47:18,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-11-30 04:47:18,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:18,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-11-30 04:47:18,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:18,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:18,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:18,787 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -32 predicate places. [2023-11-30 04:47:18,787 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 217 transitions, 1145 flow [2023-11-30 04:47:18,787 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:18,787 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:18,788 INFO L232 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-11-30 04:47:18,788 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:47:18,788 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:18,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:18,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1334224859, now seen corresponding path program 1 times [2023-11-30 04:47:18,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:18,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344620454] [2023-11-30 04:47:18,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:18,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:18,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344620454] [2023-11-30 04:47:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344620454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:18,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:18,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:47:18,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520046612] [2023-11-30 04:47:18,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:18,919 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:47:18,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:47:18,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:47:18,923 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 197 [2023-11-30 04:47:18,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 217 transitions, 1145 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:18,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:18,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 197 [2023-11-30 04:47:18,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:19,930 INFO L124 PetriNetUnfolderBase]: 2293/5544 cut-off events. [2023-11-30 04:47:19,930 INFO L125 PetriNetUnfolderBase]: For 2634/3264 co-relation queries the response was YES. [2023-11-30 04:47:19,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18827 conditions, 5544 events. 2293/5544 cut-off events. For 2634/3264 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 49309 event pairs, 319 based on Foata normal form. 0/4472 useless extension candidates. Maximal degree in co-relation 18726. Up to 3292 conditions per place. [2023-11-30 04:47:19,969 INFO L140 encePairwiseOnDemand]: 184/197 looper letters, 64 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2023-11-30 04:47:19,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 933 flow [2023-11-30 04:47:19,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:47:19,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:47:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-11-30 04:47:19,971 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6154822335025381 [2023-11-30 04:47:19,971 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-11-30 04:47:19,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-11-30 04:47:19,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:19,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-11-30 04:47:19,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:19,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:19,974 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:19,974 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -40 predicate places. [2023-11-30 04:47:19,974 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 174 transitions, 933 flow [2023-11-30 04:47:19,975 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:19,975 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:19,975 INFO L232 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] [2023-11-30 04:47:19,975 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:47:19,975 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:19,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1087911293, now seen corresponding path program 1 times [2023-11-30 04:47:19,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:19,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904995744] [2023-11-30 04:47:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:20,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904995744] [2023-11-30 04:47:20,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904995744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:20,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:20,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:20,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207247173] [2023-11-30 04:47:20,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:20,035 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:20,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:20,037 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:47:20,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 174 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:20,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:20,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:47:20,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:21,155 INFO L124 PetriNetUnfolderBase]: 2746/6081 cut-off events. [2023-11-30 04:47:21,155 INFO L125 PetriNetUnfolderBase]: For 7305/8197 co-relation queries the response was YES. [2023-11-30 04:47:21,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25045 conditions, 6081 events. 2746/6081 cut-off events. For 7305/8197 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 52362 event pairs, 240 based on Foata normal form. 2/4822 useless extension candidates. Maximal degree in co-relation 24936. Up to 3746 conditions per place. [2023-11-30 04:47:21,210 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 89 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-11-30 04:47:21,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 194 transitions, 1319 flow [2023-11-30 04:47:21,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:21,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-30 04:47:21,214 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6294416243654822 [2023-11-30 04:47:21,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-30 04:47:21,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-30 04:47:21,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:21,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-30 04:47:21,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:21,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:21,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:21,219 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -39 predicate places. [2023-11-30 04:47:21,219 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 194 transitions, 1319 flow [2023-11-30 04:47:21,220 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:21,220 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:21,220 INFO L232 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] [2023-11-30 04:47:21,220 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:47:21,221 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:21,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1087911292, now seen corresponding path program 1 times [2023-11-30 04:47:21,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:21,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25112550] [2023-11-30 04:47:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:21,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:21,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:21,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:21,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25112550] [2023-11-30 04:47:21,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25112550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:21,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:21,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:21,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866712455] [2023-11-30 04:47:21,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:21,279 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:21,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:21,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:21,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:21,280 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 197 [2023-11-30 04:47:21,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 194 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:21,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:21,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 197 [2023-11-30 04:47:21,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:22,350 INFO L124 PetriNetUnfolderBase]: 2745/6173 cut-off events. [2023-11-30 04:47:22,350 INFO L125 PetriNetUnfolderBase]: For 9472/10828 co-relation queries the response was YES. [2023-11-30 04:47:22,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29269 conditions, 6173 events. 2745/6173 cut-off events. For 9472/10828 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 53473 event pairs, 240 based on Foata normal form. 2/4914 useless extension candidates. Maximal degree in co-relation 29151. Up to 3750 conditions per place. [2023-11-30 04:47:22,387 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 92 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2023-11-30 04:47:22,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 193 transitions, 1499 flow [2023-11-30 04:47:22,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:22,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-30 04:47:22,389 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6040609137055838 [2023-11-30 04:47:22,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-30 04:47:22,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-30 04:47:22,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:22,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-30 04:47:22,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:22,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:22,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:22,391 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -38 predicate places. [2023-11-30 04:47:22,392 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 193 transitions, 1499 flow [2023-11-30 04:47:22,392 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:22,392 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:22,392 INFO L232 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] [2023-11-30 04:47:22,392 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:47:22,392 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:22,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1085166343, now seen corresponding path program 1 times [2023-11-30 04:47:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:22,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872364071] [2023-11-30 04:47:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:22,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:22,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:22,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872364071] [2023-11-30 04:47:22,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872364071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:22,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:22,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677660567] [2023-11-30 04:47:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:22,444 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:22,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:22,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:22,445 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:47:22,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 193 transitions, 1499 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:22,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:22,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:47:22,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:23,537 INFO L124 PetriNetUnfolderBase]: 3192/6707 cut-off events. [2023-11-30 04:47:23,537 INFO L125 PetriNetUnfolderBase]: For 19587/20019 co-relation queries the response was YES. [2023-11-30 04:47:23,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36784 conditions, 6707 events. 3192/6707 cut-off events. For 19587/20019 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 56905 event pairs, 144 based on Foata normal form. 6/5273 useless extension candidates. Maximal degree in co-relation 36658. Up to 4204 conditions per place. [2023-11-30 04:47:23,576 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 111 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2023-11-30 04:47:23,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 215 transitions, 2039 flow [2023-11-30 04:47:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:23,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-11-30 04:47:23,577 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6277495769881557 [2023-11-30 04:47:23,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-11-30 04:47:23,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-11-30 04:47:23,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:23,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-11-30 04:47:23,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:23,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:23,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:23,581 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -37 predicate places. [2023-11-30 04:47:23,581 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 215 transitions, 2039 flow [2023-11-30 04:47:23,582 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:23,582 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:23,582 INFO L232 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] [2023-11-30 04:47:23,582 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:47:23,582 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:23,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:23,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1085166344, now seen corresponding path program 1 times [2023-11-30 04:47:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:23,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981235940] [2023-11-30 04:47:23,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:23,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:23,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981235940] [2023-11-30 04:47:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981235940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261163030] [2023-11-30 04:47:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:23,619 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:23,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:23,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:23,620 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 197 [2023-11-30 04:47:23,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 215 transitions, 2039 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:23,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:23,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 197 [2023-11-30 04:47:23,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:24,594 INFO L124 PetriNetUnfolderBase]: 3185/6694 cut-off events. [2023-11-30 04:47:24,594 INFO L125 PetriNetUnfolderBase]: For 24970/25474 co-relation queries the response was YES. [2023-11-30 04:47:24,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41275 conditions, 6694 events. 3185/6694 cut-off events. For 24970/25474 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 56881 event pairs, 144 based on Foata normal form. 6/5260 useless extension candidates. Maximal degree in co-relation 41140. Up to 4219 conditions per place. [2023-11-30 04:47:24,649 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 114 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2023-11-30 04:47:24,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 214 transitions, 2261 flow [2023-11-30 04:47:24,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:24,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-30 04:47:24,650 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6023688663282571 [2023-11-30 04:47:24,650 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-30 04:47:24,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-30 04:47:24,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:24,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-30 04:47:24,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:24,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:24,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:24,653 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -36 predicate places. [2023-11-30 04:47:24,653 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 214 transitions, 2261 flow [2023-11-30 04:47:24,653 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:24,653 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:24,653 INFO L232 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] [2023-11-30 04:47:24,653 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:47:24,653 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:24,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:24,654 INFO L85 PathProgramCache]: Analyzing trace with hash -234937139, now seen corresponding path program 1 times [2023-11-30 04:47:24,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:24,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45406750] [2023-11-30 04:47:24,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:24,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:24,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45406750] [2023-11-30 04:47:24,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45406750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:24,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:24,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782329996] [2023-11-30 04:47:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:24,747 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:24,748 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-11-30 04:47:24,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 214 transitions, 2261 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:24,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:24,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-11-30 04:47:24,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:25,736 INFO L124 PetriNetUnfolderBase]: 3127/6728 cut-off events. [2023-11-30 04:47:25,736 INFO L125 PetriNetUnfolderBase]: For 31444/32020 co-relation queries the response was YES. [2023-11-30 04:47:25,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44110 conditions, 6728 events. 3127/6728 cut-off events. For 31444/32020 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58629 event pairs, 126 based on Foata normal form. 0/5312 useless extension candidates. Maximal degree in co-relation 43972. Up to 4219 conditions per place. [2023-11-30 04:47:25,784 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 165 selfloop transitions, 12 changer transitions 0/293 dead transitions. [2023-11-30 04:47:25,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 293 transitions, 4043 flow [2023-11-30 04:47:25,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:25,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-11-30 04:47:25,786 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6920473773265652 [2023-11-30 04:47:25,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-11-30 04:47:25,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-11-30 04:47:25,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:25,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-11-30 04:47:25,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:25,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:25,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:25,788 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -34 predicate places. [2023-11-30 04:47:25,788 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 293 transitions, 4043 flow [2023-11-30 04:47:25,789 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:25,789 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:25,789 INFO L232 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] [2023-11-30 04:47:25,789 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:47:25,789 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:25,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:25,789 INFO L85 PathProgramCache]: Analyzing trace with hash 292089244, now seen corresponding path program 1 times [2023-11-30 04:47:25,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256773650] [2023-11-30 04:47:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:25,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:25,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:25,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256773650] [2023-11-30 04:47:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256773650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:25,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:47:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770008144] [2023-11-30 04:47:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:25,942 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:47:25,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:47:25,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:47:25,943 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 197 [2023-11-30 04:47:25,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 293 transitions, 4043 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:25,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:25,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 197 [2023-11-30 04:47:25,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:27,137 INFO L124 PetriNetUnfolderBase]: 3093/6570 cut-off events. [2023-11-30 04:47:27,137 INFO L125 PetriNetUnfolderBase]: For 40670/41318 co-relation queries the response was YES. [2023-11-30 04:47:27,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46852 conditions, 6570 events. 3093/6570 cut-off events. For 40670/41318 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 56552 event pairs, 108 based on Foata normal form. 0/5178 useless extension candidates. Maximal degree in co-relation 46704. Up to 4219 conditions per place. [2023-11-30 04:47:27,194 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 178 selfloop transitions, 12 changer transitions 0/295 dead transitions. [2023-11-30 04:47:27,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 295 transitions, 4455 flow [2023-11-30 04:47:27,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:47:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:47:27,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-11-30 04:47:27,199 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6205583756345178 [2023-11-30 04:47:27,199 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-11-30 04:47:27,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-11-30 04:47:27,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:27,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-11-30 04:47:27,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:27,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:27,201 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:27,202 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -33 predicate places. [2023-11-30 04:47:27,202 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 295 transitions, 4455 flow [2023-11-30 04:47:27,202 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:27,202 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:27,202 INFO L232 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-11-30 04:47:27,202 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:47:27,202 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:27,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:27,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1034406581, now seen corresponding path program 1 times [2023-11-30 04:47:27,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:27,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314546496] [2023-11-30 04:47:27,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:27,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:27,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:27,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314546496] [2023-11-30 04:47:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314546496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:27,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:27,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:47:27,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142806573] [2023-11-30 04:47:27,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:27,420 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:47:27,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:47:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:47:27,421 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197 [2023-11-30 04:47:27,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 295 transitions, 4455 flow. Second operand has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:27,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:27,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197 [2023-11-30 04:47:27,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:28,316 INFO L124 PetriNetUnfolderBase]: 2363/5193 cut-off events. [2023-11-30 04:47:28,316 INFO L125 PetriNetUnfolderBase]: For 42783/43503 co-relation queries the response was YES. [2023-11-30 04:47:28,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39874 conditions, 5193 events. 2363/5193 cut-off events. For 42783/43503 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 43342 event pairs, 108 based on Foata normal form. 0/4185 useless extension candidates. Maximal degree in co-relation 39715. Up to 3288 conditions per place. [2023-11-30 04:47:28,357 INFO L140 encePairwiseOnDemand]: 177/197 looper letters, 166 selfloop transitions, 41 changer transitions 0/302 dead transitions. [2023-11-30 04:47:28,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 302 transitions, 5023 flow [2023-11-30 04:47:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:47:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:47:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 685 transitions. [2023-11-30 04:47:28,373 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5795262267343486 [2023-11-30 04:47:28,373 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 685 transitions. [2023-11-30 04:47:28,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 685 transitions. [2023-11-30 04:47:28,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:28,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 685 transitions. [2023-11-30 04:47:28,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:28,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:28,386 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:28,386 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -28 predicate places. [2023-11-30 04:47:28,386 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 302 transitions, 5023 flow [2023-11-30 04:47:28,387 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:28,387 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:28,387 INFO L232 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-11-30 04:47:28,387 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:47:28,387 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:28,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash 669460758, now seen corresponding path program 1 times [2023-11-30 04:47:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430585298] [2023-11-30 04:47:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:28,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:28,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:28,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430585298] [2023-11-30 04:47:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430585298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:28,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:28,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:47:28,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833748093] [2023-11-30 04:47:28,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:28,756 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:47:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:28,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:47:28,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:47:28,757 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 197 [2023-11-30 04:47:28,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 302 transitions, 5023 flow. Second operand has 11 states, 11 states have (on average 101.0909090909091) internal successors, (1112), 11 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:28,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:28,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 197 [2023-11-30 04:47:28,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:29,864 INFO L124 PetriNetUnfolderBase]: 1633/3917 cut-off events. [2023-11-30 04:47:29,865 INFO L125 PetriNetUnfolderBase]: For 36291/37083 co-relation queries the response was YES. [2023-11-30 04:47:29,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31384 conditions, 3917 events. 1633/3917 cut-off events. For 36291/37083 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 31742 event pairs, 96 based on Foata normal form. 0/3299 useless extension candidates. Maximal degree in co-relation 31213. Up to 2357 conditions per place. [2023-11-30 04:47:29,906 INFO L140 encePairwiseOnDemand]: 174/197 looper letters, 225 selfloop transitions, 77 changer transitions 0/395 dead transitions. [2023-11-30 04:47:29,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 395 transitions, 7750 flow [2023-11-30 04:47:29,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 04:47:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 04:47:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1607 transitions. [2023-11-30 04:47:29,909 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.543824027072758 [2023-11-30 04:47:29,910 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1607 transitions. [2023-11-30 04:47:29,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1607 transitions. [2023-11-30 04:47:29,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:29,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1607 transitions. [2023-11-30 04:47:29,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 107.13333333333334) internal successors, (1607), 15 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:29,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 197.0) internal successors, (3152), 16 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:29,916 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 197.0) internal successors, (3152), 16 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:29,916 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -14 predicate places. [2023-11-30 04:47:29,916 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 395 transitions, 7750 flow [2023-11-30 04:47:29,917 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.0909090909091) internal successors, (1112), 11 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:29,917 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:29,917 INFO L232 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] [2023-11-30 04:47:29,917 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:47:29,917 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:29,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:29,917 INFO L85 PathProgramCache]: Analyzing trace with hash -347799970, now seen corresponding path program 1 times [2023-11-30 04:47:29,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:29,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488963719] [2023-11-30 04:47:29,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:29,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:30,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488963719] [2023-11-30 04:47:30,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488963719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:30,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:30,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:47:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426126530] [2023-11-30 04:47:30,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:30,314 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 04:47:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:30,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 04:47:30,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-30 04:47:30,315 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 197 [2023-11-30 04:47:30,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 395 transitions, 7750 flow. Second operand has 13 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:30,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:30,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 197 [2023-11-30 04:47:30,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:32,275 INFO L124 PetriNetUnfolderBase]: 2674/6358 cut-off events. [2023-11-30 04:47:32,275 INFO L125 PetriNetUnfolderBase]: For 51014/55547 co-relation queries the response was YES. [2023-11-30 04:47:32,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53128 conditions, 6358 events. 2674/6358 cut-off events. For 51014/55547 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 53271 event pairs, 120 based on Foata normal form. 8/5669 useless extension candidates. Maximal degree in co-relation 52945. Up to 3298 conditions per place. [2023-11-30 04:47:32,348 INFO L140 encePairwiseOnDemand]: 169/197 looper letters, 217 selfloop transitions, 124 changer transitions 331/763 dead transitions. [2023-11-30 04:47:32,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 763 transitions, 17983 flow [2023-11-30 04:47:32,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 04:47:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 04:47:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1889 transitions. [2023-11-30 04:47:32,379 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5327129159616469 [2023-11-30 04:47:32,379 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1889 transitions. [2023-11-30 04:47:32,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1889 transitions. [2023-11-30 04:47:32,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:32,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1889 transitions. [2023-11-30 04:47:32,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 104.94444444444444) internal successors, (1889), 18 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:32,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 197.0) internal successors, (3743), 19 states have internal predecessors, (3743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:32,387 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 197.0) internal successors, (3743), 19 states have internal predecessors, (3743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:32,387 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, 3 predicate places. [2023-11-30 04:47:32,387 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 763 transitions, 17983 flow [2023-11-30 04:47:32,388 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:32,388 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:32,388 INFO L232 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] [2023-11-30 04:47:32,388 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:47:32,388 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:32,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash -150824689, now seen corresponding path program 1 times [2023-11-30 04:47:32,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:32,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857228241] [2023-11-30 04:47:32,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:32,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:32,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:32,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857228241] [2023-11-30 04:47:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857228241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:32,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:47:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202200622] [2023-11-30 04:47:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:32,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:47:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:47:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:47:32,771 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197 [2023-11-30 04:47:32,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 763 transitions, 17983 flow. Second operand has 11 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:32,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:32,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197 [2023-11-30 04:47:32,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:34,230 INFO L124 PetriNetUnfolderBase]: 1780/4075 cut-off events. [2023-11-30 04:47:34,230 INFO L125 PetriNetUnfolderBase]: For 44112/54700 co-relation queries the response was YES. [2023-11-30 04:47:34,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36640 conditions, 4075 events. 1780/4075 cut-off events. For 44112/54700 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 29562 event pairs, 48 based on Foata normal form. 2/3956 useless extension candidates. Maximal degree in co-relation 36446. Up to 1930 conditions per place. [2023-11-30 04:47:34,256 INFO L140 encePairwiseOnDemand]: 181/197 looper letters, 0 selfloop transitions, 0 changer transitions 719/719 dead transitions. [2023-11-30 04:47:34,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 719 transitions, 17991 flow [2023-11-30 04:47:34,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:47:34,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:47:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 951 transitions. [2023-11-30 04:47:34,259 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5363790186125211 [2023-11-30 04:47:34,259 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 951 transitions. [2023-11-30 04:47:34,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 951 transitions. [2023-11-30 04:47:34,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:34,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 951 transitions. [2023-11-30 04:47:34,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:34,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:34,263 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:34,263 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, 3 predicate places. [2023-11-30 04:47:34,263 INFO L500 AbstractCegarLoop]: Abstraction has has 204 places, 719 transitions, 17991 flow [2023-11-30 04:47:34,263 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:34,279 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe000_power.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:47:34,316 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 107 remaining) [2023-11-30 04:47:34,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 107 remaining) [2023-11-30 04:47:34,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 107 remaining) [2023-11-30 04:47:34,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 107 remaining) [2023-11-30 04:47:34,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 107 remaining) [2023-11-30 04:47:34,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 107 remaining) [2023-11-30 04:47:34,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 107 remaining) [2023-11-30 04:47:34,318 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 107 remaining) [2023-11-30 04:47:34,318 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 107 remaining) [2023-11-30 04:47:34,318 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 107 remaining) [2023-11-30 04:47:34,318 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 107 remaining) [2023-11-30 04:47:34,318 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 107 remaining) [2023-11-30 04:47:34,318 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 107 remaining) [2023-11-30 04:47:34,318 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 107 remaining) [2023-11-30 04:47:34,319 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 107 remaining) [2023-11-30 04:47:34,319 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 107 remaining) [2023-11-30 04:47:34,319 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 107 remaining) [2023-11-30 04:47:34,319 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 107 remaining) [2023-11-30 04:47:34,319 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 107 remaining) [2023-11-30 04:47:34,319 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 107 remaining) [2023-11-30 04:47:34,319 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 107 remaining) [2023-11-30 04:47:34,319 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 107 remaining) [2023-11-30 04:47:34,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 107 remaining) [2023-11-30 04:47:34,321 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 107 remaining) [2023-11-30 04:47:34,322 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 107 remaining) [2023-11-30 04:47:34,323 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 107 remaining) [2023-11-30 04:47:34,324 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 107 remaining) [2023-11-30 04:47:34,325 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 107 remaining) [2023-11-30 04:47:34,326 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 107 remaining) [2023-11-30 04:47:34,326 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:47:34,327 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:34,331 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:47:34,331 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:47:34,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:47:34 BasicIcfg [2023-11-30 04:47:34,336 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:47:34,336 INFO L158 Benchmark]: Toolchain (without parser) took 30986.41ms. Allocated memory was 559.9MB in the beginning and 9.5GB in the end (delta: 9.0GB). Free memory was 498.8MB in the beginning and 7.6GB in the end (delta: -7.1GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-11-30 04:47:34,336 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 337.6MB. Free memory is still 287.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:47:34,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.27ms. Allocated memory is still 559.9MB. Free memory was 498.7MB in the beginning and 472.1MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 04:47:34,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.82ms. Allocated memory is still 559.9MB. Free memory was 472.1MB in the beginning and 469.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:47:34,337 INFO L158 Benchmark]: Boogie Preprocessor took 59.91ms. Allocated memory is still 559.9MB. Free memory was 469.3MB in the beginning and 466.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:47:34,337 INFO L158 Benchmark]: RCFGBuilder took 1160.16ms. Allocated memory is still 559.9MB. Free memory was 466.5MB in the beginning and 339.6MB in the end (delta: 126.9MB). Peak memory consumption was 126.5MB. Max. memory is 16.0GB. [2023-11-30 04:47:34,337 INFO L158 Benchmark]: TraceAbstraction took 29279.49ms. Allocated memory was 559.9MB in the beginning and 9.5GB in the end (delta: 9.0GB). Free memory was 338.6MB in the beginning and 7.6GB in the end (delta: -7.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-11-30 04:47:34,338 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 337.6MB. Free memory is still 287.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 423.27ms. Allocated memory is still 559.9MB. Free memory was 498.7MB in the beginning and 472.1MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.82ms. Allocated memory is still 559.9MB. Free memory was 472.1MB in the beginning and 469.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 59.91ms. Allocated memory is still 559.9MB. Free memory was 469.3MB in the beginning and 466.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1160.16ms. Allocated memory is still 559.9MB. Free memory was 466.5MB in the beginning and 339.6MB in the end (delta: 126.9MB). Peak memory consumption was 126.5MB. Max. memory is 16.0GB. * TraceAbstraction took 29279.49ms. Allocated memory was 559.9MB in the beginning and 9.5GB in the end (delta: 9.0GB). Free memory was 338.6MB in the beginning and 7.6GB in the end (delta: -7.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.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 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 262 locations, 107 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: 29.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 812 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 812 mSDsluCounter, 246 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 109 mSDsCounter, 267 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1575 IncrementalHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 267 mSolverCounterUnsat, 137 mSDtfsCounter, 1575 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17991occurred in iteration=14, InterpolantAutomatonStates: 84, 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.3s InterpolantComputationTime, 1055 NumberOfCodeBlocks, 1055 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1041 ConstructedInterpolants, 0 QuantifiedInterpolants, 5473 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 64 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:47:34,366 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...