/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:09:46,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:09:46,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:09:46,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:09:46,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:09:46,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:09:46,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:09:46,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:09:46,413 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:09:46,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:09:46,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:09:46,416 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:09:46,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:09:46,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:09:46,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:09:46,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:09:46,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:09:46,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:09:46,418 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:09:46,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:09:46,419 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:09:46,419 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:09:46,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:09:46,420 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:09:46,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:09:46,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:46,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:09:46,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:09:46,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:09:46,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:09:46,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:09:46,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:09:46,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:09:46,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:09:46,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:09:46,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:09:46,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:09:46,651 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:09:46,652 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:09:46,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-12-05 21:09:47,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:09:47,940 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:09:47,940 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-12-05 21:09:47,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7213bddbc/ac0747cb61fd4db482baf3052fd39f21/FLAG625a6c893 [2023-12-05 21:09:47,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7213bddbc/ac0747cb61fd4db482baf3052fd39f21 [2023-12-05 21:09:47,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:09:47,972 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:09:47,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:47,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:09:47,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:09:47,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:47,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcaa8e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:47, skipping insertion in model container [2023-12-05 21:09:47,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:09:47" (1/1) ... [2023-12-05 21:09:48,019 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:09:48,318 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:48,327 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:09:48,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:09:48,383 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:48,383 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:09:48,388 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:09:48,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48 WrapperNode [2023-12-05 21:09:48,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:09:48,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:48,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:09:48,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:09:48,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,435 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2023-12-05 21:09:48,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:09:48,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:09:48,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:09:48,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:09:48,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:09:48,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:09:48,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:09:48,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:09:48,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (1/1) ... [2023-12-05 21:09:48,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:09:48,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:09:48,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:09:48,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:09:48,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:09:48,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:09:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:09:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:09:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:09:48,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:09:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:09:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:09:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:09:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:09:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:09:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:09:48,574 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:09:48,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:09:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:09:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:09:48,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:09:48,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:09:48,576 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:09:48,733 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:09:48,741 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:09:49,273 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:09:49,690 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:09:49,691 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:09:49,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:49 BoogieIcfgContainer [2023-12-05 21:09:49,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:09:49,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:09:49,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:09:49,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:09:49,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:09:47" (1/3) ... [2023-12-05 21:09:49,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ed48af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:49, skipping insertion in model container [2023-12-05 21:09:49,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:09:48" (2/3) ... [2023-12-05 21:09:49,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ed48af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:09:49, skipping insertion in model container [2023-12-05 21:09:49,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:09:49" (3/3) ... [2023-12-05 21:09:49,698 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2023-12-05 21:09:49,712 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:09:49,713 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2023-12-05 21:09:49,713 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:09:49,860 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:09:49,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 216 places, 206 transitions, 428 flow [2023-12-05 21:09:49,980 INFO L124 PetriNetUnfolderBase]: 3/202 cut-off events. [2023-12-05 21:09:49,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:49,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 202 events. 3/202 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 327 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 144. Up to 2 conditions per place. [2023-12-05 21:09:49,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 216 places, 206 transitions, 428 flow [2023-12-05 21:09:49,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 212 places, 202 transitions, 416 flow [2023-12-05 21:09:50,011 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:09:50,017 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;@3375a343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:09:50,017 INFO L363 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2023-12-05 21:09:50,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:09:50,034 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2023-12-05 21:09:50,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:09:50,034 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:50,035 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:50,035 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:50,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash -266535757, now seen corresponding path program 1 times [2023-12-05 21:09:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249919209] [2023-12-05 21:09:50,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:50,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:50,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:50,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249919209] [2023-12-05 21:09:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249919209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503697433] [2023-12-05 21:09:50,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:50,381 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:50,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:50,406 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 206 [2023-12-05 21:09:50,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 202 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:50,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:50,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 206 [2023-12-05 21:09:50,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:54,835 INFO L124 PetriNetUnfolderBase]: 13860/25692 cut-off events. [2023-12-05 21:09:54,835 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-12-05 21:09:54,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45340 conditions, 25692 events. 13860/25692 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 233765 event pairs, 8946 based on Foata normal form. 684/12786 useless extension candidates. Maximal degree in co-relation 45260. Up to 12689 conditions per place. [2023-12-05 21:09:55,119 INFO L140 encePairwiseOnDemand]: 176/206 looper letters, 73 selfloop transitions, 2 changer transitions 0/190 dead transitions. [2023-12-05 21:09:55,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 190 transitions, 542 flow [2023-12-05 21:09:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2023-12-05 21:09:55,133 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7766990291262136 [2023-12-05 21:09:55,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2023-12-05 21:09:55,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2023-12-05 21:09:55,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:55,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2023-12-05 21:09:55,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:55,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:55,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:55,149 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -26 predicate places. [2023-12-05 21:09:55,150 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 190 transitions, 542 flow [2023-12-05 21:09:55,150 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:55,151 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:55,151 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:55,151 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:09:55,151 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:55,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash -266535756, now seen corresponding path program 1 times [2023-12-05 21:09:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:55,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626353567] [2023-12-05 21:09:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:55,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:55,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:55,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626353567] [2023-12-05 21:09:55,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626353567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:55,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:55,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:09:55,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379331473] [2023-12-05 21:09:55,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:55,324 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:09:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:55,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:09:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:09:55,326 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 206 [2023-12-05 21:09:55,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 190 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:55,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:55,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 206 [2023-12-05 21:09:55,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:09:59,244 INFO L124 PetriNetUnfolderBase]: 13925/25796 cut-off events. [2023-12-05 21:09:59,244 INFO L125 PetriNetUnfolderBase]: For 1797/4521 co-relation queries the response was YES. [2023-12-05 21:09:59,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64152 conditions, 25796 events. 13925/25796 cut-off events. For 1797/4521 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 234544 event pairs, 9011 based on Foata normal form. 0/12159 useless extension candidates. Maximal degree in co-relation 64066. Up to 13896 conditions per place. [2023-12-05 21:09:59,520 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 87 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2023-12-05 21:09:59,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 208 transitions, 792 flow [2023-12-05 21:09:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:09:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:09:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-12-05 21:09:59,522 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7216828478964401 [2023-12-05 21:09:59,522 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-12-05 21:09:59,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-12-05 21:09:59,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:09:59,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-12-05 21:09:59,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:59,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:59,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:59,526 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -25 predicate places. [2023-12-05 21:09:59,526 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 208 transitions, 792 flow [2023-12-05 21:09:59,526 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:59,526 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:09:59,527 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:09:59,527 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:09:59,527 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:09:59,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:09:59,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1028801510, now seen corresponding path program 1 times [2023-12-05 21:09:59,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:09:59,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52154379] [2023-12-05 21:09:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:09:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:09:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:09:59,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:09:59,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:09:59,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52154379] [2023-12-05 21:09:59,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52154379] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:09:59,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:09:59,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:09:59,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728806857] [2023-12-05 21:09:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:09:59,884 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:09:59,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:09:59,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:09:59,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:09:59,888 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 206 [2023-12-05 21:09:59,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 208 transitions, 792 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:09:59,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:09:59,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 206 [2023-12-05 21:09:59,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:03,094 INFO L124 PetriNetUnfolderBase]: 8985/18350 cut-off events. [2023-12-05 21:10:03,094 INFO L125 PetriNetUnfolderBase]: For 3603/5425 co-relation queries the response was YES. [2023-12-05 21:10:03,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56860 conditions, 18350 events. 8985/18350 cut-off events. For 3603/5425 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 174065 event pairs, 2145 based on Foata normal form. 0/11299 useless extension candidates. Maximal degree in co-relation 56763. Up to 10365 conditions per place. [2023-12-05 21:10:03,298 INFO L140 encePairwiseOnDemand]: 184/206 looper letters, 96 selfloop transitions, 18 changer transitions 0/227 dead transitions. [2023-12-05 21:10:03,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 227 transitions, 1128 flow [2023-12-05 21:10:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:10:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:10:03,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 971 transitions. [2023-12-05 21:10:03,301 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.673370319001387 [2023-12-05 21:10:03,301 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 971 transitions. [2023-12-05 21:10:03,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 971 transitions. [2023-12-05 21:10:03,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:03,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 971 transitions. [2023-12-05 21:10:03,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.71428571428572) internal successors, (971), 7 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,306 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,307 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -22 predicate places. [2023-12-05 21:10:03,307 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 227 transitions, 1128 flow [2023-12-05 21:10:03,308 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,308 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:03,308 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:03,308 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:10:03,308 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:03,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1028801511, now seen corresponding path program 1 times [2023-12-05 21:10:03,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:03,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378873464] [2023-12-05 21:10:03,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:03,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:03,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:03,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378873464] [2023-12-05 21:10:03,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378873464] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:03,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:03,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:03,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795835029] [2023-12-05 21:10:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:03,475 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:03,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:03,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:03,477 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 206 [2023-12-05 21:10:03,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 227 transitions, 1128 flow. Second operand has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:03,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:03,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 206 [2023-12-05 21:10:03,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:04,288 INFO L124 PetriNetUnfolderBase]: 1465/3584 cut-off events. [2023-12-05 21:10:04,289 INFO L125 PetriNetUnfolderBase]: For 1254/3324 co-relation queries the response was YES. [2023-12-05 21:10:04,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12857 conditions, 3584 events. 1465/3584 cut-off events. For 1254/3324 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 28143 event pairs, 679 based on Foata normal form. 0/2857 useless extension candidates. Maximal degree in co-relation 12749. Up to 2084 conditions per place. [2023-12-05 21:10:04,354 INFO L140 encePairwiseOnDemand]: 184/206 looper letters, 75 selfloop transitions, 7 changer transitions 0/192 dead transitions. [2023-12-05 21:10:04,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 192 transitions, 1012 flow [2023-12-05 21:10:04,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:10:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:10:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2023-12-05 21:10:04,359 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.639967637540453 [2023-12-05 21:10:04,359 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2023-12-05 21:10:04,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2023-12-05 21:10:04,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:04,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2023-12-05 21:10:04,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,363 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,378 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -27 predicate places. [2023-12-05 21:10:04,378 INFO L500 AbstractCegarLoop]: Abstraction has has 185 places, 192 transitions, 1012 flow [2023-12-05 21:10:04,379 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,379 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:04,379 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:04,379 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:10:04,379 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:04,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 68290050, now seen corresponding path program 1 times [2023-12-05 21:10:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:04,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94949715] [2023-12-05 21:10:04,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:04,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:04,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94949715] [2023-12-05 21:10:04,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94949715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:04,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:04,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724712634] [2023-12-05 21:10:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:04,534 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:04,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:04,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:04,536 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 206 [2023-12-05 21:10:04,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 192 transitions, 1012 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:04,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:04,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 206 [2023-12-05 21:10:04,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:05,528 INFO L124 PetriNetUnfolderBase]: 1792/4417 cut-off events. [2023-12-05 21:10:05,543 INFO L125 PetriNetUnfolderBase]: For 5993/6879 co-relation queries the response was YES. [2023-12-05 21:10:05,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17492 conditions, 4417 events. 1792/4417 cut-off events. For 5993/6879 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 37098 event pairs, 178 based on Foata normal form. 2/3614 useless extension candidates. Maximal degree in co-relation 17376. Up to 2412 conditions per place. [2023-12-05 21:10:05,622 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 86 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2023-12-05 21:10:05,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 209 transitions, 1362 flow [2023-12-05 21:10:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:05,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-12-05 21:10:05,626 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6893203883495146 [2023-12-05 21:10:05,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-12-05 21:10:05,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-12-05 21:10:05,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:05,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-12-05 21:10:05,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,633 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -26 predicate places. [2023-12-05 21:10:05,633 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 209 transitions, 1362 flow [2023-12-05 21:10:05,633 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,633 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:05,634 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:05,636 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:10:05,636 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:05,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:05,637 INFO L85 PathProgramCache]: Analyzing trace with hash 68290049, now seen corresponding path program 1 times [2023-12-05 21:10:05,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:05,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325352001] [2023-12-05 21:10:05,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:05,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:05,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:05,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325352001] [2023-12-05 21:10:05,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325352001] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:05,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:05,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:05,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368133168] [2023-12-05 21:10:05,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:05,701 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:05,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:05,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:05,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:05,702 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 206 [2023-12-05 21:10:05,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 209 transitions, 1362 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:05,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:05,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 206 [2023-12-05 21:10:05,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:06,456 INFO L124 PetriNetUnfolderBase]: 1791/4414 cut-off events. [2023-12-05 21:10:06,457 INFO L125 PetriNetUnfolderBase]: For 7856/9070 co-relation queries the response was YES. [2023-12-05 21:10:06,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20358 conditions, 4414 events. 1791/4414 cut-off events. For 7856/9070 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 36995 event pairs, 178 based on Foata normal form. 2/3611 useless extension candidates. Maximal degree in co-relation 20233. Up to 2565 conditions per place. [2023-12-05 21:10:06,510 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 91 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2023-12-05 21:10:06,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 208 transitions, 1538 flow [2023-12-05 21:10:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:06,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-12-05 21:10:06,512 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6634304207119741 [2023-12-05 21:10:06,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-12-05 21:10:06,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-12-05 21:10:06,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:06,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-12-05 21:10:06,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:06,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:06,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:06,515 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -25 predicate places. [2023-12-05 21:10:06,515 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 208 transitions, 1538 flow [2023-12-05 21:10:06,515 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:06,515 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:06,516 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:06,516 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:10:06,516 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:06,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:06,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1778819684, now seen corresponding path program 1 times [2023-12-05 21:10:06,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:06,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402795328] [2023-12-05 21:10:06,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402795328] [2023-12-05 21:10:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402795328] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:06,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:06,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886156566] [2023-12-05 21:10:06,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:06,556 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:06,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:06,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:06,557 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 206 [2023-12-05 21:10:06,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 208 transitions, 1538 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:06,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:06,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 206 [2023-12-05 21:10:06,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:07,420 INFO L124 PetriNetUnfolderBase]: 2118/4905 cut-off events. [2023-12-05 21:10:07,420 INFO L125 PetriNetUnfolderBase]: For 15010/16552 co-relation queries the response was YES. [2023-12-05 21:10:07,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26012 conditions, 4905 events. 2118/4905 cut-off events. For 15010/16552 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 40678 event pairs, 254 based on Foata normal form. 2/3958 useless extension candidates. Maximal degree in co-relation 25878. Up to 2902 conditions per place. [2023-12-05 21:10:07,477 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 92 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2023-12-05 21:10:07,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 208 transitions, 1730 flow [2023-12-05 21:10:07,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-12-05 21:10:07,479 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6634304207119741 [2023-12-05 21:10:07,479 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-12-05 21:10:07,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-12-05 21:10:07,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:07,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-12-05 21:10:07,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:07,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:07,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:07,482 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -24 predicate places. [2023-12-05 21:10:07,482 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 208 transitions, 1730 flow [2023-12-05 21:10:07,482 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:07,482 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:07,482 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:07,483 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:10:07,483 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:07,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1778819683, now seen corresponding path program 1 times [2023-12-05 21:10:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:07,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473006073] [2023-12-05 21:10:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:07,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:07,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:07,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473006073] [2023-12-05 21:10:07,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473006073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:07,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:07,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:07,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753438591] [2023-12-05 21:10:07,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:07,540 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:07,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:07,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:07,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:07,541 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 206 [2023-12-05 21:10:07,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 208 transitions, 1730 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:07,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:07,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 206 [2023-12-05 21:10:07,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:08,383 INFO L124 PetriNetUnfolderBase]: 2117/4901 cut-off events. [2023-12-05 21:10:08,384 INFO L125 PetriNetUnfolderBase]: For 20075/21945 co-relation queries the response was YES. [2023-12-05 21:10:08,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28961 conditions, 4901 events. 2117/4901 cut-off events. For 20075/21945 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 40394 event pairs, 178 based on Foata normal form. 2/3954 useless extension candidates. Maximal degree in co-relation 28819. Up to 2902 conditions per place. [2023-12-05 21:10:08,444 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 102 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2023-12-05 21:10:08,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 224 transitions, 2200 flow [2023-12-05 21:10:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:08,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:10:08,446 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.686084142394822 [2023-12-05 21:10:08,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:10:08,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:10:08,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:08,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:10:08,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:08,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:08,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:08,449 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -23 predicate places. [2023-12-05 21:10:08,449 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 224 transitions, 2200 flow [2023-12-05 21:10:08,449 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:08,449 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:08,449 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:08,449 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:10:08,449 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:08,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1967390921, now seen corresponding path program 1 times [2023-12-05 21:10:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:08,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158804584] [2023-12-05 21:10:08,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:08,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-12-05 21:10:08,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:08,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158804584] [2023-12-05 21:10:08,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158804584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:08,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:08,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:08,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832415144] [2023-12-05 21:10:08,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:08,490 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:08,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:08,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:08,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:08,491 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 206 [2023-12-05 21:10:08,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 224 transitions, 2200 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:08,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:08,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 206 [2023-12-05 21:10:08,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:09,456 INFO L124 PetriNetUnfolderBase]: 2438/5413 cut-off events. [2023-12-05 21:10:09,456 INFO L125 PetriNetUnfolderBase]: For 31639/32395 co-relation queries the response was YES. [2023-12-05 21:10:09,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35538 conditions, 5413 events. 2438/5413 cut-off events. For 31639/32395 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 44546 event pairs, 178 based on Foata normal form. 6/4339 useless extension candidates. Maximal degree in co-relation 35387. Up to 3245 conditions per place. [2023-12-05 21:10:09,530 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 111 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2023-12-05 21:10:09,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 226 transitions, 2468 flow [2023-12-05 21:10:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:09,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:09,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-12-05 21:10:09,532 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6618122977346278 [2023-12-05 21:10:09,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-12-05 21:10:09,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-12-05 21:10:09,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:09,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-12-05 21:10:09,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,535 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -22 predicate places. [2023-12-05 21:10:09,536 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 226 transitions, 2468 flow [2023-12-05 21:10:09,536 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,536 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:09,536 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:09,536 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:10:09,536 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:09,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:09,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1967390922, now seen corresponding path program 1 times [2023-12-05 21:10:09,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:09,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378338277] [2023-12-05 21:10:09,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:09,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:09,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:09,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:09,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378338277] [2023-12-05 21:10:09,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378338277] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:09,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:09,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754311714] [2023-12-05 21:10:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:09,615 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:09,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:09,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:09,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:09,617 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 206 [2023-12-05 21:10:09,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 226 transitions, 2468 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:09,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:09,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 206 [2023-12-05 21:10:09,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:10,919 INFO L124 PetriNetUnfolderBase]: 2431/5246 cut-off events. [2023-12-05 21:10:10,919 INFO L125 PetriNetUnfolderBase]: For 38748/39072 co-relation queries the response was YES. [2023-12-05 21:10:10,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38554 conditions, 5246 events. 2431/5246 cut-off events. For 38748/39072 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42527 event pairs, 102 based on Foata normal form. 6/4172 useless extension candidates. Maximal degree in co-relation 38395. Up to 3245 conditions per place. [2023-12-05 21:10:10,977 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 121 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2023-12-05 21:10:10,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 242 transitions, 3042 flow [2023-12-05 21:10:10,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-12-05 21:10:10,979 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6844660194174758 [2023-12-05 21:10:10,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-12-05 21:10:10,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-12-05 21:10:10,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:10,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-12-05 21:10:10,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:10,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:10,991 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:10,991 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -21 predicate places. [2023-12-05 21:10:10,991 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 242 transitions, 3042 flow [2023-12-05 21:10:10,991 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:10,992 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:10,992 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:10,992 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:10:10,992 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:10,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash 610924177, now seen corresponding path program 1 times [2023-12-05 21:10:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:10,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637869013] [2023-12-05 21:10:10,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:10,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:11,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637869013] [2023-12-05 21:10:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637869013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:11,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:11,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069460960] [2023-12-05 21:10:11,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:11,115 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:11,116 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 206 [2023-12-05 21:10:11,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 242 transitions, 3042 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:11,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:11,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 206 [2023-12-05 21:10:11,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:12,180 INFO L124 PetriNetUnfolderBase]: 2389/5201 cut-off events. [2023-12-05 21:10:12,180 INFO L125 PetriNetUnfolderBase]: For 45527/45887 co-relation queries the response was YES. [2023-12-05 21:10:12,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40548 conditions, 5201 events. 2389/5201 cut-off events. For 45527/45887 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42331 event pairs, 90 based on Foata normal form. 0/4139 useless extension candidates. Maximal degree in co-relation 40386. Up to 3245 conditions per place. [2023-12-05 21:10:12,246 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 173 selfloop transitions, 17 changer transitions 0/325 dead transitions. [2023-12-05 21:10:12,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 325 transitions, 5257 flow [2023-12-05 21:10:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-12-05 21:10:12,248 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2023-12-05 21:10:12,248 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-12-05 21:10:12,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-12-05 21:10:12,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:12,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-12-05 21:10:12,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:12,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:12,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:12,251 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -19 predicate places. [2023-12-05 21:10:12,251 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 325 transitions, 5257 flow [2023-12-05 21:10:12,251 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:12,251 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:12,251 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:12,251 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:10:12,251 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:12,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:12,252 INFO L85 PathProgramCache]: Analyzing trace with hash 124000482, now seen corresponding path program 1 times [2023-12-05 21:10:12,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:12,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921977823] [2023-12-05 21:10:12,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:12,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:12,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:12,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921977823] [2023-12-05 21:10:12,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921977823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:12,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:10:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946346280] [2023-12-05 21:10:12,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:12,346 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:10:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:10:12,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:10:12,347 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 206 [2023-12-05 21:10:12,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 325 transitions, 5257 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:12,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:12,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 206 [2023-12-05 21:10:12,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:13,500 INFO L124 PetriNetUnfolderBase]: 2377/5180 cut-off events. [2023-12-05 21:10:13,500 INFO L125 PetriNetUnfolderBase]: For 54586/54982 co-relation queries the response was YES. [2023-12-05 21:10:13,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43363 conditions, 5180 events. 2377/5180 cut-off events. For 54586/54982 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42101 event pairs, 84 based on Foata normal form. 0/4127 useless extension candidates. Maximal degree in co-relation 43190. Up to 3245 conditions per place. [2023-12-05 21:10:13,573 INFO L140 encePairwiseOnDemand]: 196/206 looper letters, 179 selfloop transitions, 44 changer transitions 0/337 dead transitions. [2023-12-05 21:10:13,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 337 transitions, 5923 flow [2023-12-05 21:10:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:13,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-12-05 21:10:13,575 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6783980582524272 [2023-12-05 21:10:13,575 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-12-05 21:10:13,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-12-05 21:10:13,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:13,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-12-05 21:10:13,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:13,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:13,578 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:13,578 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -17 predicate places. [2023-12-05 21:10:13,578 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 337 transitions, 5923 flow [2023-12-05 21:10:13,578 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:13,578 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:13,579 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:13,579 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:10:13,579 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:13,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash 124000483, now seen corresponding path program 1 times [2023-12-05 21:10:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:13,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577243554] [2023-12-05 21:10:13,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:13,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:13,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:13,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577243554] [2023-12-05 21:10:13,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577243554] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:13,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:13,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:13,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768185836] [2023-12-05 21:10:13,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:13,768 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:13,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:13,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:13,769 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 206 [2023-12-05 21:10:13,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 337 transitions, 5923 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:13,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:13,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 206 [2023-12-05 21:10:13,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:15,037 INFO L124 PetriNetUnfolderBase]: 2365/5164 cut-off events. [2023-12-05 21:10:15,037 INFO L125 PetriNetUnfolderBase]: For 63361/63793 co-relation queries the response was YES. [2023-12-05 21:10:15,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45719 conditions, 5164 events. 2365/5164 cut-off events. For 63361/63793 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 42058 event pairs, 78 based on Foata normal form. 0/4120 useless extension candidates. Maximal degree in co-relation 45536. Up to 3245 conditions per place. [2023-12-05 21:10:15,112 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 190 selfloop transitions, 17 changer transitions 0/336 dead transitions. [2023-12-05 21:10:15,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 336 transitions, 6311 flow [2023-12-05 21:10:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:10:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:10:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-12-05 21:10:15,114 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6820388349514563 [2023-12-05 21:10:15,114 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-12-05 21:10:15,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-12-05 21:10:15,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:15,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-12-05 21:10:15,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,117 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,117 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -15 predicate places. [2023-12-05 21:10:15,117 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 336 transitions, 6311 flow [2023-12-05 21:10:15,117 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,118 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:15,118 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:15,118 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:10:15,118 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:15,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1991620759, now seen corresponding path program 1 times [2023-12-05 21:10:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737865240] [2023-12-05 21:10:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:15,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:15,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:15,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737865240] [2023-12-05 21:10:15,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737865240] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:15,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:15,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:10:15,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113061054] [2023-12-05 21:10:15,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:15,495 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:10:15,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:15,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:10:15,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:10:15,497 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 206 [2023-12-05 21:10:15,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 336 transitions, 6311 flow. Second operand has 11 states, 11 states have (on average 117.36363636363636) internal successors, (1291), 11 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:15,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:15,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 206 [2023-12-05 21:10:15,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:17,333 INFO L124 PetriNetUnfolderBase]: 3045/7019 cut-off events. [2023-12-05 21:10:17,333 INFO L125 PetriNetUnfolderBase]: For 84509/87059 co-relation queries the response was YES. [2023-12-05 21:10:17,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61731 conditions, 7019 events. 3045/7019 cut-off events. For 84509/87059 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 60531 event pairs, 106 based on Foata normal form. 0/5868 useless extension candidates. Maximal degree in co-relation 61536. Up to 3866 conditions per place. [2023-12-05 21:10:17,451 INFO L140 encePairwiseOnDemand]: 181/206 looper letters, 339 selfloop transitions, 113 changer transitions 5/564 dead transitions. [2023-12-05 21:10:17,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 564 transitions, 13105 flow [2023-12-05 21:10:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 21:10:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-05 21:10:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1874 transitions. [2023-12-05 21:10:17,455 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6064724919093851 [2023-12-05 21:10:17,455 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1874 transitions. [2023-12-05 21:10:17,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1874 transitions. [2023-12-05 21:10:17,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:17,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1874 transitions. [2023-12-05 21:10:17,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 124.93333333333334) internal successors, (1874), 15 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:17,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 206.0) internal successors, (3296), 16 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:17,462 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 206.0) internal successors, (3296), 16 states have internal predecessors, (3296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:17,462 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, -1 predicate places. [2023-12-05 21:10:17,462 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 564 transitions, 13105 flow [2023-12-05 21:10:17,463 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 117.36363636363636) internal successors, (1291), 11 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:17,463 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:17,463 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:17,463 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:10:17,463 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:17,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:17,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1380446418, now seen corresponding path program 1 times [2023-12-05 21:10:17,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:17,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806583822] [2023-12-05 21:10:17,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:17,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806583822] [2023-12-05 21:10:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806583822] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:17,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:17,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:10:17,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694028108] [2023-12-05 21:10:17,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:17,708 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:10:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:17,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:10:17,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:10:17,709 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 206 [2023-12-05 21:10:17,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 564 transitions, 13105 flow. Second operand has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:17,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:17,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 206 [2023-12-05 21:10:17,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:19,145 INFO L124 PetriNetUnfolderBase]: 2515/5833 cut-off events. [2023-12-05 21:10:19,145 INFO L125 PetriNetUnfolderBase]: For 87157/88825 co-relation queries the response was YES. [2023-12-05 21:10:19,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54821 conditions, 5833 events. 2515/5833 cut-off events. For 87157/88825 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 47870 event pairs, 105 based on Foata normal form. 0/4961 useless extension candidates. Maximal degree in co-relation 54615. Up to 3187 conditions per place. [2023-12-05 21:10:19,237 INFO L140 encePairwiseOnDemand]: 186/206 looper letters, 381 selfloop transitions, 69 changer transitions 5/569 dead transitions. [2023-12-05 21:10:19,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 569 transitions, 14165 flow [2023-12-05 21:10:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:10:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:10:19,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1013 transitions. [2023-12-05 21:10:19,239 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6146844660194175 [2023-12-05 21:10:19,239 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1013 transitions. [2023-12-05 21:10:19,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1013 transitions. [2023-12-05 21:10:19,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:19,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1013 transitions. [2023-12-05 21:10:19,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.625) internal successors, (1013), 8 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,243 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 206.0) internal successors, (1854), 9 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,244 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, 6 predicate places. [2023-12-05 21:10:19,244 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 569 transitions, 14165 flow [2023-12-05 21:10:19,244 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.77777777777777) internal successors, (1078), 9 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,244 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:19,244 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:19,244 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:10:19,244 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:19,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1603045106, now seen corresponding path program 1 times [2023-12-05 21:10:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:19,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398178033] [2023-12-05 21:10:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:19,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:19,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398178033] [2023-12-05 21:10:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398178033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:19,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:10:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377443168] [2023-12-05 21:10:19,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:19,550 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:10:19,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:10:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:10:19,551 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 206 [2023-12-05 21:10:19,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 569 transitions, 14165 flow. Second operand has 11 states, 11 states have (on average 117.45454545454545) internal successors, (1292), 11 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:19,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:19,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 206 [2023-12-05 21:10:19,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:20,777 INFO L124 PetriNetUnfolderBase]: 1926/4763 cut-off events. [2023-12-05 21:10:20,777 INFO L125 PetriNetUnfolderBase]: For 75839/77711 co-relation queries the response was YES. [2023-12-05 21:10:20,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45954 conditions, 4763 events. 1926/4763 cut-off events. For 75839/77711 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 38033 event pairs, 105 based on Foata normal form. 0/4209 useless extension candidates. Maximal degree in co-relation 45737. Up to 2449 conditions per place. [2023-12-05 21:10:20,844 INFO L140 encePairwiseOnDemand]: 185/206 looper letters, 403 selfloop transitions, 50 changer transitions 10/576 dead transitions. [2023-12-05 21:10:20,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 576 transitions, 15315 flow [2023-12-05 21:10:20,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:10:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:10:20,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1233 transitions. [2023-12-05 21:10:20,846 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5985436893203884 [2023-12-05 21:10:20,846 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1233 transitions. [2023-12-05 21:10:20,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1233 transitions. [2023-12-05 21:10:20,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:20,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1233 transitions. [2023-12-05 21:10:20,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.3) internal successors, (1233), 10 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 206.0) internal successors, (2266), 11 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,851 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 206.0) internal successors, (2266), 11 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,851 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, 15 predicate places. [2023-12-05 21:10:20,851 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 576 transitions, 15315 flow [2023-12-05 21:10:20,852 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 117.45454545454545) internal successors, (1292), 11 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:20,852 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:20,852 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:20,852 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:10:20,852 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:20,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:20,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1369944449, now seen corresponding path program 1 times [2023-12-05 21:10:20,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:20,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086789964] [2023-12-05 21:10:20,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:20,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:21,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086789964] [2023-12-05 21:10:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086789964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:21,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:21,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 21:10:21,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450281127] [2023-12-05 21:10:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:21,676 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 21:10:21,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:21,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 21:10:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-05 21:10:21,677 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 206 [2023-12-05 21:10:21,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 576 transitions, 15315 flow. Second operand has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:21,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:21,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 206 [2023-12-05 21:10:21,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:23,812 INFO L124 PetriNetUnfolderBase]: 2338/6062 cut-off events. [2023-12-05 21:10:23,812 INFO L125 PetriNetUnfolderBase]: For 83814/89291 co-relation queries the response was YES. [2023-12-05 21:10:23,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60360 conditions, 6062 events. 2338/6062 cut-off events. For 83814/89291 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 51581 event pairs, 162 based on Foata normal form. 23/5529 useless extension candidates. Maximal degree in co-relation 60131. Up to 2870 conditions per place. [2023-12-05 21:10:23,874 INFO L140 encePairwiseOnDemand]: 177/206 looper letters, 199 selfloop transitions, 124 changer transitions 287/715 dead transitions. [2023-12-05 21:10:23,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 715 transitions, 20716 flow [2023-12-05 21:10:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-05 21:10:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-12-05 21:10:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2613 transitions. [2023-12-05 21:10:23,878 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5765666372462489 [2023-12-05 21:10:23,878 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 2613 transitions. [2023-12-05 21:10:23,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 2613 transitions. [2023-12-05 21:10:23,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:23,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 2613 transitions. [2023-12-05 21:10:23,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 118.77272727272727) internal successors, (2613), 22 states have internal predecessors, (2613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 206.0) internal successors, (4738), 23 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,887 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 206.0) internal successors, (4738), 23 states have internal predecessors, (4738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,887 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, 36 predicate places. [2023-12-05 21:10:23,887 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 715 transitions, 20716 flow [2023-12-05 21:10:23,888 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 113.0) internal successors, (1695), 15 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:23,888 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:23,888 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:23,888 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:10:23,888 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2023-12-05 21:10:23,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1315027652, now seen corresponding path program 1 times [2023-12-05 21:10:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317679061] [2023-12-05 21:10:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317679061] [2023-12-05 21:10:24,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317679061] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:24,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:24,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:10:24,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821360851] [2023-12-05 21:10:24,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:24,348 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:10:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:24,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:10:24,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:10:24,349 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 206 [2023-12-05 21:10:24,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 715 transitions, 20716 flow. Second operand has 13 states, 13 states have (on average 115.23076923076923) internal successors, (1498), 13 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:24,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:24,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 206 [2023-12-05 21:10:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:25,750 INFO L124 PetriNetUnfolderBase]: 1692/4369 cut-off events. [2023-12-05 21:10:25,750 INFO L125 PetriNetUnfolderBase]: For 70881/80408 co-relation queries the response was YES. [2023-12-05 21:10:25,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45209 conditions, 4369 events. 1692/4369 cut-off events. For 70881/80408 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 34013 event pairs, 80 based on Foata normal form. 0/4246 useless extension candidates. Maximal degree in co-relation 44969. Up to 1777 conditions per place. [2023-12-05 21:10:25,781 INFO L140 encePairwiseOnDemand]: 189/206 looper letters, 0 selfloop transitions, 0 changer transitions 689/689 dead transitions. [2023-12-05 21:10:25,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 689 transitions, 20922 flow [2023-12-05 21:10:25,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:10:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:10:25,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1317 transitions. [2023-12-05 21:10:25,784 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5812003530450133 [2023-12-05 21:10:25,784 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1317 transitions. [2023-12-05 21:10:25,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1317 transitions. [2023-12-05 21:10:25,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:25,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1317 transitions. [2023-12-05 21:10:25,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.72727272727273) internal successors, (1317), 11 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:25,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 206.0) internal successors, (2472), 12 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:25,788 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 206.0) internal successors, (2472), 12 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:25,788 INFO L308 CegarLoopForPetriNet]: 212 programPoint places, 39 predicate places. [2023-12-05 21:10:25,789 INFO L500 AbstractCegarLoop]: Abstraction has has 251 places, 689 transitions, 20922 flow [2023-12-05 21:10:25,789 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.23076923076923) internal successors, (1498), 13 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:25,801 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe019_power.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:10:25,841 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 86 remaining) [2023-12-05 21:10:25,842 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 86 remaining) [2023-12-05 21:10:25,842 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 86 remaining) [2023-12-05 21:10:25,842 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 86 remaining) [2023-12-05 21:10:25,842 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 86 remaining) [2023-12-05 21:10:25,842 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 86 remaining) [2023-12-05 21:10:25,842 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 86 remaining) [2023-12-05 21:10:25,842 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 86 remaining) [2023-12-05 21:10:25,842 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 86 remaining) [2023-12-05 21:10:25,843 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 86 remaining) [2023-12-05 21:10:25,844 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 86 remaining) [2023-12-05 21:10:25,845 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 86 remaining) [2023-12-05 21:10:25,846 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 86 remaining) [2023-12-05 21:10:25,847 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 86 remaining) [2023-12-05 21:10:25,848 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 86 remaining) [2023-12-05 21:10:25,849 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 86 remaining) [2023-12-05 21:10:25,849 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 86 remaining) [2023-12-05 21:10:25,849 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 86 remaining) [2023-12-05 21:10:25,849 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 86 remaining) [2023-12-05 21:10:25,849 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 21:10:25,849 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:25,853 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:10:25,853 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:10:25,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:10:25 BasicIcfg [2023-12-05 21:10:25,858 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:10:25,859 INFO L158 Benchmark]: Toolchain (without parser) took 37887.01ms. Allocated memory was 282.1MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 234.7MB in the beginning and 4.5GB in the end (delta: -4.2GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-05 21:10:25,859 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory was 117.9MB in the beginning and 117.8MB in the end (delta: 128.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:10:25,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.48ms. Allocated memory is still 282.1MB. Free memory was 234.2MB in the beginning and 208.5MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-05 21:10:25,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.58ms. Allocated memory is still 282.1MB. Free memory was 208.5MB in the beginning and 205.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:25,859 INFO L158 Benchmark]: Boogie Preprocessor took 36.64ms. Allocated memory is still 282.1MB. Free memory was 205.8MB in the beginning and 203.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:25,859 INFO L158 Benchmark]: RCFGBuilder took 1218.54ms. Allocated memory is still 282.1MB. Free memory was 203.2MB in the beginning and 133.7MB in the end (delta: 69.5MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:25,860 INFO L158 Benchmark]: TraceAbstraction took 36164.57ms. Allocated memory was 282.1MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 133.2MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-12-05 21:10:25,860 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory was 117.9MB in the beginning and 117.8MB in the end (delta: 128.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 416.48ms. Allocated memory is still 282.1MB. Free memory was 234.2MB in the beginning and 208.5MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.58ms. Allocated memory is still 282.1MB. Free memory was 208.5MB in the beginning and 205.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.64ms. Allocated memory is still 282.1MB. Free memory was 205.8MB in the beginning and 203.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1218.54ms. Allocated memory is still 282.1MB. Free memory was 203.2MB in the beginning and 133.7MB in the end (delta: 69.5MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. * TraceAbstraction took 36164.57ms. Allocated memory was 282.1MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 133.2MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 266 locations, 86 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 36.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1111 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1111 mSDsluCounter, 375 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2421 IncrementalHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 332 mSolverCounterUnsat, 219 mSDtfsCounter, 2421 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20922occurred in iteration=18, InterpolantAutomatonStates: 114, 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, 3.5s InterpolantComputationTime, 1528 NumberOfCodeBlocks, 1528 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1510 ConstructedInterpolants, 0 QuantifiedInterpolants, 9126 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:10:25,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...