/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/safe007_power.oepc-thin001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:47:59,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:47:59,140 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:59,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:47:59,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:47:59,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:47:59,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:47:59,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:47:59,175 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:47:59,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:47:59,179 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:47:59,179 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:47:59,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:47:59,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:47:59,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:47:59,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:47:59,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:47:59,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:47:59,182 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:47:59,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:47:59,182 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:47:59,183 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:47:59,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:47:59,183 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:47:59,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:47:59,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:47:59,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:47:59,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:47:59,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:47:59,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:47:59,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:47:59,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:47:59,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:47:59,186 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:59,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:47:59,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:47:59,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:47:59,434 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:47:59,434 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:47:59,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-11-30 04:48:00,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:48:00,905 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:48:00,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe007_power.oepc-thin001_power.oepc.i [2023-11-30 04:48:00,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75438ce7e/ad8b8d1be7f8402f8ed35343b51096c0/FLAG417fcb8be [2023-11-30 04:48:00,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75438ce7e/ad8b8d1be7f8402f8ed35343b51096c0 [2023-11-30 04:48:00,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:48:00,937 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:48:00,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:48:00,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:48:00,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:48:00,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:48:00" (1/1) ... [2023-11-30 04:48:00,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a2b7469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:00, skipping insertion in model container [2023-11-30 04:48:00,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:48:00" (1/1) ... [2023-11-30 04:48:00,996 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:48:01,338 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:48:01,348 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:48:01,405 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:48:01,439 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:48:01,439 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:48:01,445 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:48:01,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01 WrapperNode [2023-11-30 04:48:01,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:48:01,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:48:01,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:48:01,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:48:01,453 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:48:01" (1/1) ... [2023-11-30 04:48:01,476 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:48:01" (1/1) ... [2023-11-30 04:48:01,495 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-30 04:48:01,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:48:01,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:48:01,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:48:01,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:48:01,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:48:01,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:48:01,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:48:01,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:48:01,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (1/1) ... [2023-11-30 04:48:01,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:48:01,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:48:01,600 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:48:01,627 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:48:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:48:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:48:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:48:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:48:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:48:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:48:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:48:01,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:48:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:48:01,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:48:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:48:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:48:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:48:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:48:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:48:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:48:01,638 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:48:01,766 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:48:01,768 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:48:02,226 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:48:02,613 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:48:02,613 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:48:02,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:48:02 BoogieIcfgContainer [2023-11-30 04:48:02,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:48:02,617 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:48:02,617 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:48:02,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:48:02,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:48:00" (1/3) ... [2023-11-30 04:48:02,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7031f8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:48:02, skipping insertion in model container [2023-11-30 04:48:02,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:48:01" (2/3) ... [2023-11-30 04:48:02,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7031f8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:48:02, skipping insertion in model container [2023-11-30 04:48:02,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:48:02" (3/3) ... [2023-11-30 04:48:02,623 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_power.oepc-thin001_power.oepc.i [2023-11-30 04:48:02,639 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:48:02,640 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2023-11-30 04:48:02,640 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:48:02,762 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:48:02,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 168 transitions, 348 flow [2023-11-30 04:48:02,918 INFO L124 PetriNetUnfolderBase]: 3/165 cut-off events. [2023-11-30 04:48:02,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:02,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 165 events. 3/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 217 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 108. Up to 2 conditions per place. [2023-11-30 04:48:02,925 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 168 transitions, 348 flow [2023-11-30 04:48:02,937 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 165 transitions, 339 flow [2023-11-30 04:48:02,951 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:48:02,958 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;@6d5581c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:48:02,959 INFO L363 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2023-11-30 04:48:02,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:48:02,973 INFO L124 PetriNetUnfolderBase]: 0/58 cut-off events. [2023-11-30 04:48:02,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:48:02,973 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:02,974 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] [2023-11-30 04:48:02,975 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:02,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:02,979 INFO L85 PathProgramCache]: Analyzing trace with hash 443940378, now seen corresponding path program 1 times [2023-11-30 04:48:02,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:02,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408049487] [2023-11-30 04:48:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:02,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:03,396 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:48:03,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:03,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408049487] [2023-11-30 04:48:03,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408049487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:03,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877896313] [2023-11-30 04:48:03,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:03,410 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:03,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:03,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:03,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:03,446 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 168 [2023-11-30 04:48:03,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 165 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:03,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:03,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 168 [2023-11-30 04:48:03,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:04,180 INFO L124 PetriNetUnfolderBase]: 815/2108 cut-off events. [2023-11-30 04:48:04,180 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-30 04:48:04,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 2108 events. 815/2108 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15156 event pairs, 520 based on Foata normal form. 76/1280 useless extension candidates. Maximal degree in co-relation 3414. Up to 879 conditions per place. [2023-11-30 04:48:04,209 INFO L140 encePairwiseOnDemand]: 148/168 looper letters, 50 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2023-11-30 04:48:04,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 155 transitions, 423 flow [2023-11-30 04:48:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-11-30 04:48:04,226 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2023-11-30 04:48:04,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-11-30 04:48:04,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-11-30 04:48:04,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:04,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-11-30 04:48:04,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:04,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:04,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:04,245 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -16 predicate places. [2023-11-30 04:48:04,245 INFO L500 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 423 flow [2023-11-30 04:48:04,245 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:04,245 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:04,246 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] [2023-11-30 04:48:04,246 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:48:04,246 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:04,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash 443940379, now seen corresponding path program 1 times [2023-11-30 04:48:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:04,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038747713] [2023-11-30 04:48:04,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:04,429 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:48:04,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038747713] [2023-11-30 04:48:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038747713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570478261] [2023-11-30 04:48:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:04,431 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:04,433 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 168 [2023-11-30 04:48:04,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 155 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:48:04,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:04,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 168 [2023-11-30 04:48:04,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:04,963 INFO L124 PetriNetUnfolderBase]: 821/2121 cut-off events. [2023-11-30 04:48:04,963 INFO L125 PetriNetUnfolderBase]: For 172/472 co-relation queries the response was YES. [2023-11-30 04:48:04,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4800 conditions, 2121 events. 821/2121 cut-off events. For 172/472 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 15314 event pairs, 526 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 4718. Up to 979 conditions per place. [2023-11-30 04:48:04,984 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 57 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2023-11-30 04:48:04,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 165 transitions, 581 flow [2023-11-30 04:48:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:04,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-30 04:48:04,986 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7579365079365079 [2023-11-30 04:48:04,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-30 04:48:04,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-30 04:48:04,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:04,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-30 04:48:04,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:48:04,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:04,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:04,991 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -15 predicate places. [2023-11-30 04:48:04,992 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 165 transitions, 581 flow [2023-11-30 04:48:04,992 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:48:04,992 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:04,993 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] [2023-11-30 04:48:04,993 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:48:04,993 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:04,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1224243929, now seen corresponding path program 1 times [2023-11-30 04:48:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:04,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029315292] [2023-11-30 04:48:04,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:04,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:05,220 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:48:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029315292] [2023-11-30 04:48:05,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029315292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:05,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:48:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322914793] [2023-11-30 04:48:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:05,222 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:48:05,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:05,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:48:05,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:48:05,223 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 168 [2023-11-30 04:48:05,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 165 transitions, 581 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 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:48:05,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:05,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 168 [2023-11-30 04:48:05,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:05,552 INFO L124 PetriNetUnfolderBase]: 327/1018 cut-off events. [2023-11-30 04:48:05,552 INFO L125 PetriNetUnfolderBase]: For 269/467 co-relation queries the response was YES. [2023-11-30 04:48:05,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2634 conditions, 1018 events. 327/1018 cut-off events. For 269/467 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5940 event pairs, 192 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 2543. Up to 481 conditions per place. [2023-11-30 04:48:05,562 INFO L140 encePairwiseOnDemand]: 160/168 looper letters, 41 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2023-11-30 04:48:05,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 151 transitions, 583 flow [2023-11-30 04:48:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:48:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:48:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-11-30 04:48:05,565 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7306547619047619 [2023-11-30 04:48:05,565 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-11-30 04:48:05,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-11-30 04:48:05,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:05,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-11-30 04:48:05,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:48:05,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:48:05,569 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:48:05,570 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -18 predicate places. [2023-11-30 04:48:05,570 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 583 flow [2023-11-30 04:48:05,571 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 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:48:05,571 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:05,571 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] [2023-11-30 04:48:05,571 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:48:05,572 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:05,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1224243928, now seen corresponding path program 1 times [2023-11-30 04:48:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:05,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547399448] [2023-11-30 04:48:05,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:05,738 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:48:05,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:05,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547399448] [2023-11-30 04:48:05,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547399448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:05,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:05,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:48:05,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310707383] [2023-11-30 04:48:05,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:05,739 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:48:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:05,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:48:05,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:48:05,745 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 168 [2023-11-30 04:48:05,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 583 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 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:48:05,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:05,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 168 [2023-11-30 04:48:05,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:06,064 INFO L124 PetriNetUnfolderBase]: 183/796 cut-off events. [2023-11-30 04:48:06,065 INFO L125 PetriNetUnfolderBase]: For 358/432 co-relation queries the response was YES. [2023-11-30 04:48:06,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 796 events. 183/796 cut-off events. For 358/432 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4707 event pairs, 43 based on Foata normal form. 0/694 useless extension candidates. Maximal degree in co-relation 2043. Up to 289 conditions per place. [2023-11-30 04:48:06,071 INFO L140 encePairwiseOnDemand]: 153/168 looper letters, 41 selfloop transitions, 13 changer transitions 0/155 dead transitions. [2023-11-30 04:48:06,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 155 transitions, 711 flow [2023-11-30 04:48:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:48:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:48:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 810 transitions. [2023-11-30 04:48:06,074 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6887755102040817 [2023-11-30 04:48:06,074 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 810 transitions. [2023-11-30 04:48:06,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 810 transitions. [2023-11-30 04:48:06,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:06,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 810 transitions. [2023-11-30 04:48:06,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 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:48:06,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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:48:06,079 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 168.0) internal successors, (1344), 8 states have internal predecessors, (1344), 0 states have call successors, (0), 0 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:48:06,081 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -14 predicate places. [2023-11-30 04:48:06,081 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 155 transitions, 711 flow [2023-11-30 04:48:06,081 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 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:48:06,081 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:06,082 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] [2023-11-30 04:48:06,082 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:48:06,082 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:06,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1839646015, now seen corresponding path program 1 times [2023-11-30 04:48:06,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019145749] [2023-11-30 04:48:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:06,138 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:48:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:06,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019145749] [2023-11-30 04:48:06,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019145749] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:06,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:06,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:06,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574732050] [2023-11-30 04:48:06,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:06,140 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:06,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:06,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:06,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:06,141 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 168 [2023-11-30 04:48:06,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 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:48:06,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:06,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 168 [2023-11-30 04:48:06,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:06,347 INFO L124 PetriNetUnfolderBase]: 215/808 cut-off events. [2023-11-30 04:48:06,348 INFO L125 PetriNetUnfolderBase]: For 752/842 co-relation queries the response was YES. [2023-11-30 04:48:06,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 808 events. 215/808 cut-off events. For 752/842 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4762 event pairs, 29 based on Foata normal form. 2/696 useless extension candidates. Maximal degree in co-relation 2579. Up to 326 conditions per place. [2023-11-30 04:48:06,355 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 50 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2023-11-30 04:48:06,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 155 transitions, 819 flow [2023-11-30 04:48:06,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:06,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-11-30 04:48:06,356 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2023-11-30 04:48:06,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-11-30 04:48:06,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-11-30 04:48:06,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:06,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-11-30 04:48:06,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 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:48:06,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:06,359 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:06,360 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -13 predicate places. [2023-11-30 04:48:06,360 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 155 transitions, 819 flow [2023-11-30 04:48:06,360 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 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:48:06,360 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:06,361 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] [2023-11-30 04:48:06,361 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:48:06,361 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:06,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1839646016, now seen corresponding path program 1 times [2023-11-30 04:48:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685372715] [2023-11-30 04:48:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:06,423 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:48:06,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:06,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685372715] [2023-11-30 04:48:06,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685372715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:06,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:06,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:06,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614805071] [2023-11-30 04:48:06,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:06,425 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:06,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:06,426 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 168 [2023-11-30 04:48:06,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 155 transitions, 819 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:48:06,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:06,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 168 [2023-11-30 04:48:06,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:06,648 INFO L124 PetriNetUnfolderBase]: 214/815 cut-off events. [2023-11-30 04:48:06,648 INFO L125 PetriNetUnfolderBase]: For 1112/1242 co-relation queries the response was YES. [2023-11-30 04:48:06,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 815 events. 214/815 cut-off events. For 1112/1242 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4767 event pairs, 19 based on Foata normal form. 2/703 useless extension candidates. Maximal degree in co-relation 2938. Up to 326 conditions per place. [2023-11-30 04:48:06,655 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 55 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2023-11-30 04:48:06,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 1045 flow [2023-11-30 04:48:06,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-11-30 04:48:06,657 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-30 04:48:06,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-11-30 04:48:06,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-11-30 04:48:06,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:06,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-11-30 04:48:06,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:48:06,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:06,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:06,660 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -12 predicate places. [2023-11-30 04:48:06,660 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 164 transitions, 1045 flow [2023-11-30 04:48:06,661 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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:48:06,661 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:06,661 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] [2023-11-30 04:48:06,661 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:48:06,661 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:06,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:06,661 INFO L85 PathProgramCache]: Analyzing trace with hash 411731548, now seen corresponding path program 1 times [2023-11-30 04:48:06,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:06,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347105942] [2023-11-30 04:48:06,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:06,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:06,729 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:48:06,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:06,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347105942] [2023-11-30 04:48:06,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347105942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:06,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:06,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947182418] [2023-11-30 04:48:06,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:06,730 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:06,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:06,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:06,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:06,732 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 168 [2023-11-30 04:48:06,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 164 transitions, 1045 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:48:06,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:06,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 168 [2023-11-30 04:48:06,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:06,943 INFO L124 PetriNetUnfolderBase]: 246/826 cut-off events. [2023-11-30 04:48:06,943 INFO L125 PetriNetUnfolderBase]: For 2052/2124 co-relation queries the response was YES. [2023-11-30 04:48:06,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3657 conditions, 826 events. 246/826 cut-off events. For 2052/2124 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4745 event pairs, 19 based on Foata normal form. 2/699 useless extension candidates. Maximal degree in co-relation 3530. Up to 359 conditions per place. [2023-11-30 04:48:06,952 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 64 selfloop transitions, 2 changer transitions 2/174 dead transitions. [2023-11-30 04:48:06,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 1327 flow [2023-11-30 04:48:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:06,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-11-30 04:48:06,954 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2023-11-30 04:48:06,954 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-11-30 04:48:06,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-11-30 04:48:06,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:06,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-11-30 04:48:06,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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:48:06,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:06,957 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:06,957 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -11 predicate places. [2023-11-30 04:48:06,957 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 174 transitions, 1327 flow [2023-11-30 04:48:06,958 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:48:06,958 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:06,958 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] [2023-11-30 04:48:06,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:48:06,958 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:06,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash 411731547, now seen corresponding path program 1 times [2023-11-30 04:48:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695436256] [2023-11-30 04:48:06,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:07,003 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:48:07,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:07,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695436256] [2023-11-30 04:48:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695436256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:07,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347928746] [2023-11-30 04:48:07,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:07,004 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:07,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:07,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:07,006 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 168 [2023-11-30 04:48:07,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 174 transitions, 1327 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 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:48:07,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:07,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 168 [2023-11-30 04:48:07,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:07,234 INFO L124 PetriNetUnfolderBase]: 245/843 cut-off events. [2023-11-30 04:48:07,234 INFO L125 PetriNetUnfolderBase]: For 2611/2695 co-relation queries the response was YES. [2023-11-30 04:48:07,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4094 conditions, 843 events. 245/843 cut-off events. For 2611/2695 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4971 event pairs, 19 based on Foata normal form. 2/716 useless extension candidates. Maximal degree in co-relation 3958. Up to 368 conditions per place. [2023-11-30 04:48:07,244 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 67 selfloop transitions, 2 changer transitions 2/173 dead transitions. [2023-11-30 04:48:07,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 173 transitions, 1459 flow [2023-11-30 04:48:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-30 04:48:07,246 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7103174603174603 [2023-11-30 04:48:07,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-30 04:48:07,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-30 04:48:07,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:07,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-30 04:48:07,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 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:48:07,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:07,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:07,249 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -10 predicate places. [2023-11-30 04:48:07,249 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 173 transitions, 1459 flow [2023-11-30 04:48:07,249 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 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:48:07,249 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:07,249 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] [2023-11-30 04:48:07,250 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:48:07,250 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:07,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:07,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1615983372, now seen corresponding path program 1 times [2023-11-30 04:48:07,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:07,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761998283] [2023-11-30 04:48:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:07,395 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:48:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761998283] [2023-11-30 04:48:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761998283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:07,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:07,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:48:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939766915] [2023-11-30 04:48:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:07,397 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:48:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:07,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:48:07,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:48:07,398 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 168 [2023-11-30 04:48:07,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 173 transitions, 1459 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:07,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:07,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 168 [2023-11-30 04:48:07,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:07,610 INFO L124 PetriNetUnfolderBase]: 235/809 cut-off events. [2023-11-30 04:48:07,610 INFO L125 PetriNetUnfolderBase]: For 3258/3354 co-relation queries the response was YES. [2023-11-30 04:48:07,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4219 conditions, 809 events. 235/809 cut-off events. For 3258/3354 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4685 event pairs, 15 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 4080. Up to 368 conditions per place. [2023-11-30 04:48:07,620 INFO L140 encePairwiseOnDemand]: 164/168 looper letters, 61 selfloop transitions, 11 changer transitions 11/203 dead transitions. [2023-11-30 04:48:07,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 203 transitions, 2171 flow [2023-11-30 04:48:07,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:48:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:48:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 407 transitions. [2023-11-30 04:48:07,621 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8075396825396826 [2023-11-30 04:48:07,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 407 transitions. [2023-11-30 04:48:07,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 407 transitions. [2023-11-30 04:48:07,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:07,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 407 transitions. [2023-11-30 04:48:07,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 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:48:07,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:07,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 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:48:07,624 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -8 predicate places. [2023-11-30 04:48:07,624 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 203 transitions, 2171 flow [2023-11-30 04:48:07,625 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:48:07,625 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:07,625 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] [2023-11-30 04:48:07,625 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:48:07,625 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:07,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash -375628453, now seen corresponding path program 1 times [2023-11-30 04:48:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:07,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026344872] [2023-11-30 04:48:07,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:07,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:07,730 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:48:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026344872] [2023-11-30 04:48:07,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026344872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:07,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:07,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:48:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793660372] [2023-11-30 04:48:07,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:07,731 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:48:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:07,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:48:07,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:48:07,733 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 168 [2023-11-30 04:48:07,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 203 transitions, 2171 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 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:48:07,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:07,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 168 [2023-11-30 04:48:07,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:08,010 INFO L124 PetriNetUnfolderBase]: 233/824 cut-off events. [2023-11-30 04:48:08,011 INFO L125 PetriNetUnfolderBase]: For 3948/4056 co-relation queries the response was YES. [2023-11-30 04:48:08,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4549 conditions, 824 events. 233/824 cut-off events. For 3948/4056 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4860 event pairs, 13 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 4399. Up to 368 conditions per place. [2023-11-30 04:48:08,022 INFO L140 encePairwiseOnDemand]: 161/168 looper letters, 81 selfloop transitions, 16 changer transitions 11/211 dead transitions. [2023-11-30 04:48:08,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 211 transitions, 2499 flow [2023-11-30 04:48:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:48:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:48:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-11-30 04:48:08,025 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7232142857142857 [2023-11-30 04:48:08,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-11-30 04:48:08,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-11-30 04:48:08,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:08,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-11-30 04:48:08,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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:48:08,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:48:08,028 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:48:08,029 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -6 predicate places. [2023-11-30 04:48:08,029 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 211 transitions, 2499 flow [2023-11-30 04:48:08,029 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 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:48:08,029 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:08,029 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] [2023-11-30 04:48:08,030 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:48:08,030 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:08,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -375628452, now seen corresponding path program 1 times [2023-11-30 04:48:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450591478] [2023-11-30 04:48:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:08,328 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:48:08,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:08,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450591478] [2023-11-30 04:48:08,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450591478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:08,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:08,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:48:08,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089449978] [2023-11-30 04:48:08,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:08,329 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:48:08,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:08,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:48:08,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:48:08,331 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 168 [2023-11-30 04:48:08,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 211 transitions, 2499 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:48:08,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:08,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 168 [2023-11-30 04:48:08,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:08,613 INFO L124 PetriNetUnfolderBase]: 231/819 cut-off events. [2023-11-30 04:48:08,613 INFO L125 PetriNetUnfolderBase]: For 4787/4907 co-relation queries the response was YES. [2023-11-30 04:48:08,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4786 conditions, 819 events. 231/819 cut-off events. For 4787/4907 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4828 event pairs, 11 based on Foata normal form. 0/702 useless extension candidates. Maximal degree in co-relation 4626. Up to 368 conditions per place. [2023-11-30 04:48:08,623 INFO L140 encePairwiseOnDemand]: 165/168 looper letters, 73 selfloop transitions, 11 changer transitions 12/210 dead transitions. [2023-11-30 04:48:08,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 210 transitions, 2669 flow [2023-11-30 04:48:08,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:48:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:48:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2023-11-30 04:48:08,625 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7291666666666666 [2023-11-30 04:48:08,625 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2023-11-30 04:48:08,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2023-11-30 04:48:08,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:08,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2023-11-30 04:48:08,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.5) internal successors, (490), 4 states have internal predecessors, (490), 0 states have call successors, (0), 0 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:48:08,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:48:08,628 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:48:08,629 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, -4 predicate places. [2023-11-30 04:48:08,629 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 210 transitions, 2669 flow [2023-11-30 04:48:08,629 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:48:08,629 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:08,629 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] [2023-11-30 04:48:08,629 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:48:08,630 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:08,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -769950052, now seen corresponding path program 1 times [2023-11-30 04:48:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992801030] [2023-11-30 04:48:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:08,787 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:48:08,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992801030] [2023-11-30 04:48:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992801030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:48:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13953452] [2023-11-30 04:48:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:08,789 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:48:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:08,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:48:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:48:08,790 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 168 [2023-11-30 04:48:08,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 210 transitions, 2669 flow. Second operand has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 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:48:08,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:08,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 168 [2023-11-30 04:48:08,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:09,032 INFO L124 PetriNetUnfolderBase]: 189/707 cut-off events. [2023-11-30 04:48:09,032 INFO L125 PetriNetUnfolderBase]: For 5486/5618 co-relation queries the response was YES. [2023-11-30 04:48:09,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 707 events. 189/707 cut-off events. For 5486/5618 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3881 event pairs, 11 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 4223. Up to 309 conditions per place. [2023-11-30 04:48:09,040 INFO L140 encePairwiseOnDemand]: 155/168 looper letters, 77 selfloop transitions, 22 changer transitions 14/212 dead transitions. [2023-11-30 04:48:09,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 212 transitions, 2943 flow [2023-11-30 04:48:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:48:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:48:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 685 transitions. [2023-11-30 04:48:09,042 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6795634920634921 [2023-11-30 04:48:09,042 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 685 transitions. [2023-11-30 04:48:09,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 685 transitions. [2023-11-30 04:48:09,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:09,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 685 transitions. [2023-11-30 04:48:09,044 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:48:09,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 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:48:09,046 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 168.0) internal successors, (1176), 7 states have internal predecessors, (1176), 0 states have call successors, (0), 0 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:48:09,047 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, 1 predicate places. [2023-11-30 04:48:09,047 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 212 transitions, 2943 flow [2023-11-30 04:48:09,047 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 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:48:09,047 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:09,047 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] [2023-11-30 04:48:09,047 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:48:09,048 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:09,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:09,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1191950865, now seen corresponding path program 1 times [2023-11-30 04:48:09,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:09,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842477877] [2023-11-30 04:48:09,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:09,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:09,319 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:48:09,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:09,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842477877] [2023-11-30 04:48:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842477877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:09,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:09,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:48:09,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179958012] [2023-11-30 04:48:09,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:09,320 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:48:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:09,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:48:09,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:48:09,321 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 168 [2023-11-30 04:48:09,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 212 transitions, 2943 flow. Second operand has 9 states, 9 states have (on average 106.44444444444444) internal successors, (958), 9 states have internal predecessors, (958), 0 states have call successors, (0), 0 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:48:09,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:09,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 168 [2023-11-30 04:48:09,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:09,663 INFO L124 PetriNetUnfolderBase]: 147/612 cut-off events. [2023-11-30 04:48:09,663 INFO L125 PetriNetUnfolderBase]: For 5559/5703 co-relation queries the response was YES. [2023-11-30 04:48:09,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 612 events. 147/612 cut-off events. For 5559/5703 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3081 event pairs, 11 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 3747. Up to 250 conditions per place. [2023-11-30 04:48:09,670 INFO L140 encePairwiseOnDemand]: 154/168 looper letters, 79 selfloop transitions, 18 changer transitions 19/214 dead transitions. [2023-11-30 04:48:09,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 214 transitions, 3227 flow [2023-11-30 04:48:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:48:09,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:48:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 885 transitions. [2023-11-30 04:48:09,673 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6584821428571429 [2023-11-30 04:48:09,673 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 885 transitions. [2023-11-30 04:48:09,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 885 transitions. [2023-11-30 04:48:09,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:09,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 885 transitions. [2023-11-30 04:48:09,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.625) internal successors, (885), 8 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:48:09,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 168.0) internal successors, (1512), 9 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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:48:09,678 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 168.0) internal successors, (1512), 9 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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:48:09,679 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, 8 predicate places. [2023-11-30 04:48:09,679 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 214 transitions, 3227 flow [2023-11-30 04:48:09,679 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.44444444444444) internal successors, (958), 9 states have internal predecessors, (958), 0 states have call successors, (0), 0 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:48:09,679 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:09,679 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:48:09,679 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:48:09,680 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:09,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1288222867, now seen corresponding path program 1 times [2023-11-30 04:48:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:09,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643157087] [2023-11-30 04:48:09,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:09,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:10,213 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:48:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:10,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643157087] [2023-11-30 04:48:10,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643157087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:10,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:10,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:48:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527557735] [2023-11-30 04:48:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:10,214 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 04:48:10,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:10,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 04:48:10,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-30 04:48:10,216 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 168 [2023-11-30 04:48:10,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 214 transitions, 3227 flow. Second operand has 13 states, 13 states have (on average 101.92307692307692) internal successors, (1325), 13 states have internal predecessors, (1325), 0 states have call successors, (0), 0 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:48:10,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:10,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 168 [2023-11-30 04:48:10,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:11,036 INFO L124 PetriNetUnfolderBase]: 438/1474 cut-off events. [2023-11-30 04:48:11,037 INFO L125 PetriNetUnfolderBase]: For 14241/15071 co-relation queries the response was YES. [2023-11-30 04:48:11,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9641 conditions, 1474 events. 438/1474 cut-off events. For 14241/15071 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9983 event pairs, 23 based on Foata normal form. 5/1398 useless extension candidates. Maximal degree in co-relation 9447. Up to 507 conditions per place. [2023-11-30 04:48:11,047 INFO L140 encePairwiseOnDemand]: 147/168 looper letters, 71 selfloop transitions, 46 changer transitions 185/397 dead transitions. [2023-11-30 04:48:11,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 397 transitions, 8375 flow [2023-11-30 04:48:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 04:48:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 04:48:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1928 transitions. [2023-11-30 04:48:11,052 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6375661375661376 [2023-11-30 04:48:11,052 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1928 transitions. [2023-11-30 04:48:11,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1928 transitions. [2023-11-30 04:48:11,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:11,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1928 transitions. [2023-11-30 04:48:11,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 107.11111111111111) internal successors, (1928), 18 states have internal predecessors, (1928), 0 states have call successors, (0), 0 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:48:11,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 168.0) internal successors, (3192), 19 states have internal predecessors, (3192), 0 states have call successors, (0), 0 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:48:11,063 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 168.0) internal successors, (3192), 19 states have internal predecessors, (3192), 0 states have call successors, (0), 0 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:48:11,063 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, 25 predicate places. [2023-11-30 04:48:11,063 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 397 transitions, 8375 flow [2023-11-30 04:48:11,064 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 101.92307692307692) internal successors, (1325), 13 states have internal predecessors, (1325), 0 states have call successors, (0), 0 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:48:11,064 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:48:11,064 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, 1, 1] [2023-11-30 04:48:11,064 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:48:11,064 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2023-11-30 04:48:11,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:48:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1417704332, now seen corresponding path program 1 times [2023-11-30 04:48:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:48:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201021988] [2023-11-30 04:48:11,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:48:11,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:48:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:48:11,488 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:48:11,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:48:11,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201021988] [2023-11-30 04:48:11,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201021988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:48:11,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:48:11,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:48:11,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328569913] [2023-11-30 04:48:11,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:48:11,489 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:48:11,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:48:11,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:48:11,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:48:11,491 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 168 [2023-11-30 04:48:11,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 397 transitions, 8375 flow. Second operand has 11 states, 11 states have (on average 104.18181818181819) internal successors, (1146), 11 states have internal predecessors, (1146), 0 states have call successors, (0), 0 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:48:11,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:48:11,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 168 [2023-11-30 04:48:11,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:48:11,973 INFO L124 PetriNetUnfolderBase]: 392/1353 cut-off events. [2023-11-30 04:48:11,973 INFO L125 PetriNetUnfolderBase]: For 15758/16340 co-relation queries the response was YES. [2023-11-30 04:48:11,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9023 conditions, 1353 events. 392/1353 cut-off events. For 15758/16340 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 8922 event pairs, 20 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 8818. Up to 410 conditions per place. [2023-11-30 04:48:11,982 INFO L140 encePairwiseOnDemand]: 156/168 looper letters, 0 selfloop transitions, 0 changer transitions 383/383 dead transitions. [2023-11-30 04:48:11,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 383 transitions, 8515 flow [2023-11-30 04:48:11,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:48:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:48:11,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 965 transitions. [2023-11-30 04:48:11,985 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6382275132275133 [2023-11-30 04:48:11,986 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 965 transitions. [2023-11-30 04:48:11,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 965 transitions. [2023-11-30 04:48:11,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:48:11,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 965 transitions. [2023-11-30 04:48:11,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.22222222222223) internal successors, (965), 9 states have internal predecessors, (965), 0 states have call successors, (0), 0 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:48:11,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:48:11,991 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:48:11,992 INFO L307 CegarLoopForPetriNet]: 172 programPoint places, 29 predicate places. [2023-11-30 04:48:11,992 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 383 transitions, 8515 flow [2023-11-30 04:48:11,992 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 104.18181818181819) internal successors, (1146), 11 states have internal predecessors, (1146), 0 states have call successors, (0), 0 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:48:12,004 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe007_power.oepc-thin001_power.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:48:12,049 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 59 remaining) [2023-11-30 04:48:12,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 59 remaining) [2023-11-30 04:48:12,050 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 59 remaining) [2023-11-30 04:48:12,051 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 59 remaining) [2023-11-30 04:48:12,052 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 59 remaining) [2023-11-30 04:48:12,053 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 59 remaining) [2023-11-30 04:48:12,054 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 59 remaining) [2023-11-30 04:48:12,055 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 59 remaining) [2023-11-30 04:48:12,055 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:48:12,056 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:48:12,061 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:48:12,061 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:48:12,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:48:12 BasicIcfg [2023-11-30 04:48:12,068 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:48:12,068 INFO L158 Benchmark]: Toolchain (without parser) took 11130.85ms. Allocated memory was 509.6MB in the beginning and 859.8MB in the end (delta: 350.2MB). Free memory was 456.0MB in the beginning and 391.3MB in the end (delta: 64.7MB). Peak memory consumption was 415.3MB. Max. memory is 16.0GB. [2023-11-30 04:48:12,068 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 352.3MB. Free memory is still 302.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:48:12,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.25ms. Allocated memory is still 509.6MB. Free memory was 455.6MB in the beginning and 432.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:12,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.80ms. Allocated memory is still 509.6MB. Free memory was 432.0MB in the beginning and 429.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:12,069 INFO L158 Benchmark]: Boogie Preprocessor took 55.12ms. Allocated memory is still 509.6MB. Free memory was 429.6MB in the beginning and 427.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:48:12,069 INFO L158 Benchmark]: RCFGBuilder took 1063.95ms. Allocated memory is still 509.6MB. Free memory was 427.1MB in the beginning and 377.5MB in the end (delta: 49.6MB). Peak memory consumption was 50.5MB. Max. memory is 16.0GB. [2023-11-30 04:48:12,070 INFO L158 Benchmark]: TraceAbstraction took 9450.80ms. Allocated memory was 509.6MB in the beginning and 859.8MB in the end (delta: 350.2MB). Free memory was 376.5MB in the beginning and 391.3MB in the end (delta: -14.8MB). Peak memory consumption was 337.5MB. Max. memory is 16.0GB. [2023-11-30 04:48:12,071 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.15ms. Allocated memory is still 352.3MB. Free memory is still 302.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 508.25ms. Allocated memory is still 509.6MB. Free memory was 455.6MB in the beginning and 432.0MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.80ms. Allocated memory is still 509.6MB. Free memory was 432.0MB in the beginning and 429.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.12ms. Allocated memory is still 509.6MB. Free memory was 429.6MB in the beginning and 427.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1063.95ms. Allocated memory is still 509.6MB. Free memory was 427.1MB in the beginning and 377.5MB in the end (delta: 49.6MB). Peak memory consumption was 50.5MB. Max. memory is 16.0GB. * TraceAbstraction took 9450.80ms. Allocated memory was 509.6MB in the beginning and 859.8MB in the end (delta: 350.2MB). Free memory was 376.5MB in the beginning and 391.3MB in the end (delta: -14.8MB). Peak memory consumption was 337.5MB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 215 locations, 59 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: 9.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 537 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1130 IncrementalHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 154 mSDtfsCounter, 1130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8515occurred in iteration=15, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1156 NumberOfCodeBlocks, 1156 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1141 ConstructedInterpolants, 0 QuantifiedInterpolants, 5555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:48:12,091 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...