/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:49:42,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:49:42,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:49:42,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:49:42,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:49:42,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:49:42,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:49:42,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:49:42,145 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:49:42,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:49:42,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:49:42,149 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:49:42,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:49:42,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:49:42,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:49:42,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:49:42,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:49:42,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:49:42,151 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:49:42,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:49:42,151 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:49:42,152 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:49:42,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:49:42,152 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:49:42,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:49:42,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:49:42,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:49:42,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:49:42,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:49:42,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:49:42,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:49:42,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:49:42,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:49:42,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:49:42,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:49:42,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:49:42,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:49:42,371 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:49:42,373 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:49:42,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2023-11-30 04:49:43,407 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:49:43,598 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:49:43,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_power.opt.i [2023-11-30 04:49:43,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f125fd3/2833ed12f91745f1a2c81fcbbee29443/FLAGe4fd8180e [2023-11-30 04:49:43,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f125fd3/2833ed12f91745f1a2c81fcbbee29443 [2023-11-30 04:49:43,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:49:43,644 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:49:43,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:49:43,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:49:43,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:49:43,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:49:43" (1/1) ... [2023-11-30 04:49:43,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e86c981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:43, skipping insertion in model container [2023-11-30 04:49:43,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:49:43" (1/1) ... [2023-11-30 04:49:43,750 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:49:44,054 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:49:44,063 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:49:44,134 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:49:44,164 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:49:44,164 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:49:44,169 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:49:44,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44 WrapperNode [2023-11-30 04:49:44,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:49:44,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:49:44,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:49:44,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:49:44,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,205 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,235 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 183 [2023-11-30 04:49:44,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:49:44,236 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:49:44,236 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:49:44,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:49:44,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:49:44,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:49:44,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:49:44,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:49:44,287 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (1/1) ... [2023-11-30 04:49:44,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:49:44,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:49:44,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:49:44,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:49:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:49:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:49:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:49:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:49:44,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:49:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:49:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:49:44,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:49:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:49:44,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:49:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:49:44,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:49:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:49:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:49:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:49:44,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:49:44,352 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:49:44,469 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:49:44,471 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:49:44,885 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:49:45,219 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:49:45,219 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:49:45,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:49:45 BoogieIcfgContainer [2023-11-30 04:49:45,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:49:45,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:49:45,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:49:45,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:49:45,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:49:43" (1/3) ... [2023-11-30 04:49:45,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197eca06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:49:45, skipping insertion in model container [2023-11-30 04:49:45,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:49:44" (2/3) ... [2023-11-30 04:49:45,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@197eca06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:49:45, skipping insertion in model container [2023-11-30 04:49:45,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:49:45" (3/3) ... [2023-11-30 04:49:45,227 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2023-11-30 04:49:45,240 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:49:45,240 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-11-30 04:49:45,240 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:49:45,348 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:49:45,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 180 transitions, 372 flow [2023-11-30 04:49:45,456 INFO L124 PetriNetUnfolderBase]: 3/177 cut-off events. [2023-11-30 04:49:45,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:49:45,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 177 events. 3/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 300 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 121. Up to 2 conditions per place. [2023-11-30 04:49:45,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 180 transitions, 372 flow [2023-11-30 04:49:45,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 177 transitions, 363 flow [2023-11-30 04:49:45,481 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:49:45,487 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;@3fc795fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:49:45,487 INFO L363 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2023-11-30 04:49:45,498 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:49:45,498 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-30 04:49:45,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:49:45,498 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:45,499 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:45,500 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:45,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:45,504 INFO L85 PathProgramCache]: Analyzing trace with hash 251828649, now seen corresponding path program 1 times [2023-11-30 04:49:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842466742] [2023-11-30 04:49:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:45,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:45,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842466742] [2023-11-30 04:49:45,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842466742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905777149] [2023-11-30 04:49:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:45,759 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:45,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:45,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:45,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:45,781 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 180 [2023-11-30 04:49:45,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 177 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:45,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:45,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 180 [2023-11-30 04:49:45,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:48,417 INFO L124 PetriNetUnfolderBase]: 8747/17061 cut-off events. [2023-11-30 04:49:48,418 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-30 04:49:48,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29543 conditions, 17061 events. 8747/17061 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 160366 event pairs, 5602 based on Foata normal form. 532/9280 useless extension candidates. Maximal degree in co-relation 29468. Up to 8001 conditions per place. [2023-11-30 04:49:48,607 INFO L140 encePairwiseOnDemand]: 150/180 looper letters, 62 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2023-11-30 04:49:48,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 163 transitions, 463 flow [2023-11-30 04:49:48,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:48,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-30 04:49:48,621 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7925925925925926 [2023-11-30 04:49:48,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-30 04:49:48,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-30 04:49:48,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:48,626 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-30 04:49:48,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:48,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:48,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:48,636 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -26 predicate places. [2023-11-30 04:49:48,637 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 163 transitions, 463 flow [2023-11-30 04:49:48,637 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:48,637 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:48,637 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:48,638 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:49:48,638 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:48,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:48,638 INFO L85 PathProgramCache]: Analyzing trace with hash 251828650, now seen corresponding path program 1 times [2023-11-30 04:49:48,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:48,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304594614] [2023-11-30 04:49:48,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:48,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:48,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:48,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:48,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304594614] [2023-11-30 04:49:48,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304594614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:48,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:48,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:48,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485411969] [2023-11-30 04:49:48,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:48,817 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:48,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:48,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:48,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:48,818 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 180 [2023-11-30 04:49:48,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 163 transitions, 463 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:48,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:48,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 180 [2023-11-30 04:49:48,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:51,071 INFO L124 PetriNetUnfolderBase]: 8795/17144 cut-off events. [2023-11-30 04:49:51,071 INFO L125 PetriNetUnfolderBase]: For 1397/3421 co-relation queries the response was YES. [2023-11-30 04:49:51,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41627 conditions, 17144 events. 8795/17144 cut-off events. For 1397/3421 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 160981 event pairs, 5650 based on Foata normal form. 0/8824 useless extension candidates. Maximal degree in co-relation 41546. Up to 8929 conditions per place. [2023-11-30 04:49:51,168 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 75 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2023-11-30 04:49:51,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 179 transitions, 681 flow [2023-11-30 04:49:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:51,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-30 04:49:51,170 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7074074074074074 [2023-11-30 04:49:51,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-30 04:49:51,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-30 04:49:51,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:51,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-30 04:49:51,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:51,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:51,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:51,173 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2023-11-30 04:49:51,174 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 179 transitions, 681 flow [2023-11-30 04:49:51,174 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:51,174 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:51,174 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:51,175 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:49:51,175 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:51,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:51,175 INFO L85 PathProgramCache]: Analyzing trace with hash 891846129, now seen corresponding path program 1 times [2023-11-30 04:49:51,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:51,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908409604] [2023-11-30 04:49:51,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908409604] [2023-11-30 04:49:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908409604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:51,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:51,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:49:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104060053] [2023-11-30 04:49:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:51,314 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:49:51,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:49:51,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:49:51,315 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 180 [2023-11-30 04:49:51,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 179 transitions, 681 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:51,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:51,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 180 [2023-11-30 04:49:51,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:52,255 INFO L124 PetriNetUnfolderBase]: 2515/5481 cut-off events. [2023-11-30 04:49:52,255 INFO L125 PetriNetUnfolderBase]: For 1644/2562 co-relation queries the response was YES. [2023-11-30 04:49:52,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15917 conditions, 5481 events. 2515/5481 cut-off events. For 1644/2562 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 45191 event pairs, 1480 based on Foata normal form. 0/3540 useless extension candidates. Maximal degree in co-relation 15827. Up to 3221 conditions per place. [2023-11-30 04:49:52,282 INFO L140 encePairwiseOnDemand]: 170/180 looper letters, 53 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2023-11-30 04:49:52,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 159 transitions, 671 flow [2023-11-30 04:49:52,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:49:52,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:49:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-11-30 04:49:52,284 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6680555555555555 [2023-11-30 04:49:52,284 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-11-30 04:49:52,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-11-30 04:49:52,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:52,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-11-30 04:49:52,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:52,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:52,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:52,288 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -30 predicate places. [2023-11-30 04:49:52,288 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 159 transitions, 671 flow [2023-11-30 04:49:52,289 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:52,289 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:52,289 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:52,289 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:49:52,289 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:52,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:52,290 INFO L85 PathProgramCache]: Analyzing trace with hash 891846128, now seen corresponding path program 1 times [2023-11-30 04:49:52,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:52,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077732827] [2023-11-30 04:49:52,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:52,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:52,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077732827] [2023-11-30 04:49:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077732827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:52,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:49:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93659412] [2023-11-30 04:49:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:52,452 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:49:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:49:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:49:52,453 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 180 [2023-11-30 04:49:52,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 159 transitions, 671 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:52,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:52,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 180 [2023-11-30 04:49:52,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:52,998 INFO L124 PetriNetUnfolderBase]: 1373/3704 cut-off events. [2023-11-30 04:49:52,998 INFO L125 PetriNetUnfolderBase]: For 2112/2420 co-relation queries the response was YES. [2023-11-30 04:49:53,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11793 conditions, 3704 events. 1373/3704 cut-off events. For 2112/2420 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 32446 event pairs, 227 based on Foata normal form. 0/3068 useless extension candidates. Maximal degree in co-relation 11692. Up to 1931 conditions per place. [2023-11-30 04:49:53,017 INFO L140 encePairwiseOnDemand]: 162/180 looper letters, 53 selfloop transitions, 15 changer transitions 0/165 dead transitions. [2023-11-30 04:49:53,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 165 transitions, 843 flow [2023-11-30 04:49:53,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:49:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:49:53,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 802 transitions. [2023-11-30 04:49:53,019 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6365079365079365 [2023-11-30 04:49:53,019 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 802 transitions. [2023-11-30 04:49:53,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 802 transitions. [2023-11-30 04:49:53,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:53,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 802 transitions. [2023-11-30 04:49:53,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.57142857142857) internal successors, (802), 7 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,023 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,023 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -26 predicate places. [2023-11-30 04:49:53,023 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 165 transitions, 843 flow [2023-11-30 04:49:53,024 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,024 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:53,024 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:53,024 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:49:53,024 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:53,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:53,024 INFO L85 PathProgramCache]: Analyzing trace with hash 41081340, now seen corresponding path program 1 times [2023-11-30 04:49:53,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:53,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064409841] [2023-11-30 04:49:53,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:53,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:53,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:53,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064409841] [2023-11-30 04:49:53,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064409841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:53,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:53,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866906102] [2023-11-30 04:49:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:53,060 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:53,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:53,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:53,061 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 180 [2023-11-30 04:49:53,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 165 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:53,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 180 [2023-11-30 04:49:53,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:53,672 INFO L124 PetriNetUnfolderBase]: 1635/4205 cut-off events. [2023-11-30 04:49:53,672 INFO L125 PetriNetUnfolderBase]: For 4692/5134 co-relation queries the response was YES. [2023-11-30 04:49:53,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15843 conditions, 4205 events. 1635/4205 cut-off events. For 4692/5134 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 36851 event pairs, 221 based on Foata normal form. 2/3460 useless extension candidates. Maximal degree in co-relation 15733. Up to 2198 conditions per place. [2023-11-30 04:49:53,694 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 64 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2023-11-30 04:49:53,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 165 transitions, 979 flow [2023-11-30 04:49:53,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-30 04:49:53,696 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2023-11-30 04:49:53,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-30 04:49:53,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-30 04:49:53,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:53,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-30 04:49:53,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,699 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,701 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -25 predicate places. [2023-11-30 04:49:53,701 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 165 transitions, 979 flow [2023-11-30 04:49:53,701 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,701 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:53,701 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:53,701 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:49:53,702 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:53,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 41081341, now seen corresponding path program 1 times [2023-11-30 04:49:53,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:53,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505740592] [2023-11-30 04:49:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:53,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505740592] [2023-11-30 04:49:53,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505740592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:53,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:53,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:53,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604314926] [2023-11-30 04:49:53,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:53,788 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:53,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:53,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:53,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:53,789 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 180 [2023-11-30 04:49:53,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 165 transitions, 979 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:53,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:53,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 180 [2023-11-30 04:49:53,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:54,412 INFO L124 PetriNetUnfolderBase]: 1634/4019 cut-off events. [2023-11-30 04:49:54,412 INFO L125 PetriNetUnfolderBase]: For 6724/7390 co-relation queries the response was YES. [2023-11-30 04:49:54,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17981 conditions, 4019 events. 1634/4019 cut-off events. For 6724/7390 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 34168 event pairs, 163 based on Foata normal form. 2/3274 useless extension candidates. Maximal degree in co-relation 17863. Up to 2198 conditions per place. [2023-11-30 04:49:54,441 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 75 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2023-11-30 04:49:54,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 180 transitions, 1317 flow [2023-11-30 04:49:54,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:54,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-11-30 04:49:54,442 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2023-11-30 04:49:54,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-11-30 04:49:54,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-11-30 04:49:54,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:54,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-11-30 04:49:54,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:54,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:54,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:54,445 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -24 predicate places. [2023-11-30 04:49:54,445 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 180 transitions, 1317 flow [2023-11-30 04:49:54,445 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:54,445 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:54,445 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:54,445 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:49:54,446 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:54,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1103057941, now seen corresponding path program 1 times [2023-11-30 04:49:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:54,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279146169] [2023-11-30 04:49:54,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:54,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:54,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:54,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279146169] [2023-11-30 04:49:54,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279146169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:54,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:54,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:54,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954414665] [2023-11-30 04:49:54,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:54,523 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:54,525 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 180 [2023-11-30 04:49:54,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 180 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:54,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:54,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 180 [2023-11-30 04:49:54,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:55,253 INFO L124 PetriNetUnfolderBase]: 1890/4305 cut-off events. [2023-11-30 04:49:55,254 INFO L125 PetriNetUnfolderBase]: For 13455/13671 co-relation queries the response was YES. [2023-11-30 04:49:55,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22376 conditions, 4305 events. 1890/4305 cut-off events. For 13455/13671 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 36011 event pairs, 87 based on Foata normal form. 6/3462 useless extension candidates. Maximal degree in co-relation 22250. Up to 2461 conditions per place. [2023-11-30 04:49:55,284 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 94 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2023-11-30 04:49:55,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 198 transitions, 1767 flow [2023-11-30 04:49:55,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-11-30 04:49:55,286 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2023-11-30 04:49:55,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-11-30 04:49:55,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-11-30 04:49:55,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:55,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-11-30 04:49:55,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:55,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:55,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:55,288 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -23 predicate places. [2023-11-30 04:49:55,288 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 198 transitions, 1767 flow [2023-11-30 04:49:55,288 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:55,288 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:55,289 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:55,289 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:49:55,289 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:55,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:55,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1103057942, now seen corresponding path program 1 times [2023-11-30 04:49:55,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:55,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53589185] [2023-11-30 04:49:55,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:55,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:55,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:55,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53589185] [2023-11-30 04:49:55,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53589185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:55,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:55,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:55,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107900009] [2023-11-30 04:49:55,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:55,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:55,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:55,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:55,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:55,321 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 180 [2023-11-30 04:49:55,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 198 transitions, 1767 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:55,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:55,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 180 [2023-11-30 04:49:55,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:55,983 INFO L124 PetriNetUnfolderBase]: 1883/4356 cut-off events. [2023-11-30 04:49:55,984 INFO L125 PetriNetUnfolderBase]: For 17045/17297 co-relation queries the response was YES. [2023-11-30 04:49:55,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25099 conditions, 4356 events. 1883/4356 cut-off events. For 17045/17297 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 36911 event pairs, 87 based on Foata normal form. 6/3513 useless extension candidates. Maximal degree in co-relation 24964. Up to 2476 conditions per place. [2023-11-30 04:49:56,017 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 97 selfloop transitions, 2 changer transitions 0/197 dead transitions. [2023-11-30 04:49:56,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 197 transitions, 1955 flow [2023-11-30 04:49:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:56,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-30 04:49:56,018 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2023-11-30 04:49:56,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-30 04:49:56,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-30 04:49:56,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:56,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-30 04:49:56,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,020 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,021 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -22 predicate places. [2023-11-30 04:49:56,021 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 197 transitions, 1955 flow [2023-11-30 04:49:56,021 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,021 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:56,021 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:56,021 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:49:56,021 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:56,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1741921998, now seen corresponding path program 1 times [2023-11-30 04:49:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:56,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704056256] [2023-11-30 04:49:56,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:56,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:56,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704056256] [2023-11-30 04:49:56,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704056256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:56,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:56,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:49:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267204962] [2023-11-30 04:49:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:56,096 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:49:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:56,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:49:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:49:56,096 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 180 [2023-11-30 04:49:56,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 197 transitions, 1955 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:56,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 180 [2023-11-30 04:49:56,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:56,718 INFO L124 PetriNetUnfolderBase]: 1857/4234 cut-off events. [2023-11-30 04:49:56,718 INFO L125 PetriNetUnfolderBase]: For 21920/22352 co-relation queries the response was YES. [2023-11-30 04:49:56,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26748 conditions, 4234 events. 1857/4234 cut-off events. For 21920/22352 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 35613 event pairs, 51 based on Foata normal form. 0/3403 useless extension candidates. Maximal degree in co-relation 26610. Up to 2476 conditions per place. [2023-11-30 04:49:56,754 INFO L140 encePairwiseOnDemand]: 176/180 looper letters, 112 selfloop transitions, 10 changer transitions 0/238 dead transitions. [2023-11-30 04:49:56,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 238 transitions, 2937 flow [2023-11-30 04:49:56,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:49:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:49:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-11-30 04:49:56,755 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.737037037037037 [2023-11-30 04:49:56,755 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-11-30 04:49:56,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-11-30 04:49:56,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:56,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-11-30 04:49:56,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,757 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,758 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -20 predicate places. [2023-11-30 04:49:56,758 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 238 transitions, 2937 flow [2023-11-30 04:49:56,758 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:56,758 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:56,758 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:56,758 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:49:56,759 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:56,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:56,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1050002435, now seen corresponding path program 1 times [2023-11-30 04:49:56,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:56,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282089338] [2023-11-30 04:49:56,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:56,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:56,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:56,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:56,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282089338] [2023-11-30 04:49:56,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282089338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:56,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:56,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:49:56,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757273944] [2023-11-30 04:49:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:56,818 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:49:56,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:56,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:49:56,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:49:56,819 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 180 [2023-11-30 04:49:56,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 238 transitions, 2937 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 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-11-30 04:49:56,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:56,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 180 [2023-11-30 04:49:56,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:57,708 INFO L124 PetriNetUnfolderBase]: 1962/4865 cut-off events. [2023-11-30 04:49:57,708 INFO L125 PetriNetUnfolderBase]: For 29518/30038 co-relation queries the response was YES. [2023-11-30 04:49:57,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31514 conditions, 4865 events. 1962/4865 cut-off events. For 29518/30038 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 45060 event pairs, 57 based on Foata normal form. 11/4057 useless extension candidates. Maximal degree in co-relation 31365. Up to 2711 conditions per place. [2023-11-30 04:49:57,746 INFO L140 encePairwiseOnDemand]: 171/180 looper letters, 129 selfloop transitions, 42 changer transitions 0/270 dead transitions. [2023-11-30 04:49:57,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 270 transitions, 3893 flow [2023-11-30 04:49:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:49:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:49:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2023-11-30 04:49:57,748 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6625 [2023-11-30 04:49:57,748 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 477 transitions. [2023-11-30 04:49:57,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 477 transitions. [2023-11-30 04:49:57,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:57,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 477 transitions. [2023-11-30 04:49:57,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:57,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:57,751 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:57,751 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -18 predicate places. [2023-11-30 04:49:57,751 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 270 transitions, 3893 flow [2023-11-30 04:49:57,751 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 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-11-30 04:49:57,751 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:57,751 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:57,752 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:49:57,752 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:57,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1851829886, now seen corresponding path program 1 times [2023-11-30 04:49:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98157920] [2023-11-30 04:49:57,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:57,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98157920] [2023-11-30 04:49:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98157920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:57,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:49:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780857902] [2023-11-30 04:49:57,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:57,929 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:49:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:49:57,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:49:57,930 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 180 [2023-11-30 04:49:57,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 270 transitions, 3893 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:57,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:57,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 180 [2023-11-30 04:49:57,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:58,845 INFO L124 PetriNetUnfolderBase]: 1942/4833 cut-off events. [2023-11-30 04:49:58,845 INFO L125 PetriNetUnfolderBase]: For 36325/36871 co-relation queries the response was YES. [2023-11-30 04:49:58,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33343 conditions, 4833 events. 1942/4833 cut-off events. For 36325/36871 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 44697 event pairs, 51 based on Foata normal form. 11/4037 useless extension candidates. Maximal degree in co-relation 33184. Up to 2711 conditions per place. [2023-11-30 04:49:58,890 INFO L140 encePairwiseOnDemand]: 177/180 looper letters, 150 selfloop transitions, 11 changer transitions 0/269 dead transitions. [2023-11-30 04:49:58,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 269 transitions, 4193 flow [2023-11-30 04:49:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:49:58,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:49:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-11-30 04:49:58,892 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6569444444444444 [2023-11-30 04:49:58,892 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-11-30 04:49:58,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-11-30 04:49:58,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:58,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-11-30 04:49:58,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:58,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:58,894 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:58,894 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -16 predicate places. [2023-11-30 04:49:58,895 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 269 transitions, 4193 flow [2023-11-30 04:49:58,895 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:58,895 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:58,895 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:58,895 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:49:58,895 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:58,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash -2130807561, now seen corresponding path program 1 times [2023-11-30 04:49:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:58,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930783067] [2023-11-30 04:49:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:49:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:49:59,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:49:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930783067] [2023-11-30 04:49:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930783067] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:49:59,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:49:59,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:49:59,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734950975] [2023-11-30 04:49:59,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:49:59,086 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:49:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:49:59,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:49:59,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:49:59,087 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 180 [2023-11-30 04:49:59,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 269 transitions, 4193 flow. Second operand has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:59,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:49:59,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 180 [2023-11-30 04:49:59,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:49:59,925 INFO L124 PetriNetUnfolderBase]: 1522/3873 cut-off events. [2023-11-30 04:49:59,925 INFO L125 PetriNetUnfolderBase]: For 37950/38536 co-relation queries the response was YES. [2023-11-30 04:49:59,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28837 conditions, 3873 events. 1522/3873 cut-off events. For 37950/38536 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 34161 event pairs, 51 based on Foata normal form. 0/3288 useless extension candidates. Maximal degree in co-relation 28667. Up to 2165 conditions per place. [2023-11-30 04:49:59,963 INFO L140 encePairwiseOnDemand]: 164/180 looper letters, 157 selfloop transitions, 28 changer transitions 0/280 dead transitions. [2023-11-30 04:49:59,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 280 transitions, 4827 flow [2023-11-30 04:49:59,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:49:59,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:49:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 675 transitions. [2023-11-30 04:49:59,965 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.625 [2023-11-30 04:49:59,965 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 675 transitions. [2023-11-30 04:49:59,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 675 transitions. [2023-11-30 04:49:59,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:49:59,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 675 transitions. [2023-11-30 04:49:59,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:59,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:59,968 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:59,968 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, -11 predicate places. [2023-11-30 04:49:59,968 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 280 transitions, 4827 flow [2023-11-30 04:49:59,969 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:49:59,969 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:49:59,969 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:49:59,969 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:49:59,969 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:49:59,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:49:59,969 INFO L85 PathProgramCache]: Analyzing trace with hash 990822786, now seen corresponding path program 1 times [2023-11-30 04:49:59,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:49:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726685181] [2023-11-30 04:49:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:49:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:49:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:00,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726685181] [2023-11-30 04:50:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726685181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:50:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301475200] [2023-11-30 04:50:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:00,252 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:50:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:50:00,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:50:00,254 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 180 [2023-11-30 04:50:00,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 280 transitions, 4827 flow. Second operand has 11 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:00,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:00,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 180 [2023-11-30 04:50:00,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:01,824 INFO L124 PetriNetUnfolderBase]: 2400/6172 cut-off events. [2023-11-30 04:50:01,824 INFO L125 PetriNetUnfolderBase]: For 67510/71285 co-relation queries the response was YES. [2023-11-30 04:50:01,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46379 conditions, 6172 events. 2400/6172 cut-off events. For 67510/71285 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 56819 event pairs, 71 based on Foata normal form. 24/5482 useless extension candidates. Maximal degree in co-relation 46197. Up to 2946 conditions per place. [2023-11-30 04:50:01,895 INFO L140 encePairwiseOnDemand]: 158/180 looper letters, 345 selfloop transitions, 80 changer transitions 12/529 dead transitions. [2023-11-30 04:50:01,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 529 transitions, 11727 flow [2023-11-30 04:50:01,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 04:50:01,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 04:50:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1528 transitions. [2023-11-30 04:50:01,898 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6063492063492063 [2023-11-30 04:50:01,898 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1528 transitions. [2023-11-30 04:50:01,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1528 transitions. [2023-11-30 04:50:01,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:01,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1528 transitions. [2023-11-30 04:50:01,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 109.14285714285714) internal successors, (1528), 14 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 180.0) internal successors, (2700), 15 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,905 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 180.0) internal successors, (2700), 15 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,905 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, 2 predicate places. [2023-11-30 04:50:01,905 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 529 transitions, 11727 flow [2023-11-30 04:50:01,906 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.0909090909091) internal successors, (1101), 11 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:01,906 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:01,906 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:01,906 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:50:01,906 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:50:01,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1588951294, now seen corresponding path program 1 times [2023-11-30 04:50:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320489153] [2023-11-30 04:50:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:02,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:02,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320489153] [2023-11-30 04:50:02,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320489153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:02,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:02,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:50:02,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126730632] [2023-11-30 04:50:02,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:02,128 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:50:02,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:02,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:50:02,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:50:02,129 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 180 [2023-11-30 04:50:02,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 529 transitions, 11727 flow. Second operand has 9 states, 9 states have (on average 102.44444444444444) internal successors, (922), 9 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:02,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:02,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 180 [2023-11-30 04:50:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:03,350 INFO L124 PetriNetUnfolderBase]: 1980/5303 cut-off events. [2023-11-30 04:50:03,350 INFO L125 PetriNetUnfolderBase]: For 63587/67476 co-relation queries the response was YES. [2023-11-30 04:50:03,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41492 conditions, 5303 events. 1980/5303 cut-off events. For 63587/67476 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 47545 event pairs, 66 based on Foata normal form. 2/4810 useless extension candidates. Maximal degree in co-relation 41299. Up to 2400 conditions per place. [2023-11-30 04:50:03,395 INFO L140 encePairwiseOnDemand]: 163/180 looper letters, 385 selfloop transitions, 43 changer transitions 12/540 dead transitions. [2023-11-30 04:50:03,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 540 transitions, 12915 flow [2023-11-30 04:50:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:50:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:50:03,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 869 transitions. [2023-11-30 04:50:03,397 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6034722222222222 [2023-11-30 04:50:03,397 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 869 transitions. [2023-11-30 04:50:03,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 869 transitions. [2023-11-30 04:50:03,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:03,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 869 transitions. [2023-11-30 04:50:03,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.625) internal successors, (869), 8 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,400 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 180.0) internal successors, (1620), 9 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,401 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, 9 predicate places. [2023-11-30 04:50:03,401 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 540 transitions, 12915 flow [2023-11-30 04:50:03,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 102.44444444444444) internal successors, (922), 9 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,401 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:03,401 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:03,401 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 04:50:03,401 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:50:03,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:03,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1306955190, now seen corresponding path program 1 times [2023-11-30 04:50:03,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:03,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746526316] [2023-11-30 04:50:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:03,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:03,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:03,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:03,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746526316] [2023-11-30 04:50:03,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746526316] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:03,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:03,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-30 04:50:03,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324387666] [2023-11-30 04:50:03,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:03,722 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 04:50:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:03,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 04:50:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-30 04:50:03,723 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 180 [2023-11-30 04:50:03,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 540 transitions, 12915 flow. Second operand has 13 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:03,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:03,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 180 [2023-11-30 04:50:03,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:05,343 INFO L124 PetriNetUnfolderBase]: 2145/6210 cut-off events. [2023-11-30 04:50:05,343 INFO L125 PetriNetUnfolderBase]: For 76629/82640 co-relation queries the response was YES. [2023-11-30 04:50:05,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49926 conditions, 6210 events. 2145/6210 cut-off events. For 76629/82640 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 58879 event pairs, 73 based on Foata normal form. 60/5832 useless extension candidates. Maximal degree in co-relation 49721. Up to 2579 conditions per place. [2023-11-30 04:50:05,392 INFO L140 encePairwiseOnDemand]: 156/180 looper letters, 209 selfloop transitions, 87 changer transitions 256/643 dead transitions. [2023-11-30 04:50:05,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 643 transitions, 16755 flow [2023-11-30 04:50:05,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 04:50:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 04:50:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1787 transitions. [2023-11-30 04:50:05,396 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5839869281045752 [2023-11-30 04:50:05,396 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1787 transitions. [2023-11-30 04:50:05,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1787 transitions. [2023-11-30 04:50:05,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:05,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1787 transitions. [2023-11-30 04:50:05,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 105.11764705882354) internal successors, (1787), 17 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:05,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 180.0) internal successors, (3240), 18 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:05,402 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 180.0) internal successors, (3240), 18 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:05,403 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, 25 predicate places. [2023-11-30 04:50:05,403 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 643 transitions, 16755 flow [2023-11-30 04:50:05,403 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 97.92307692307692) internal successors, (1273), 13 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:05,403 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:05,403 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:05,403 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 04:50:05,404 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:50:05,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2026265866, now seen corresponding path program 1 times [2023-11-30 04:50:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:05,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101170930] [2023-11-30 04:50:05,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:05,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:05,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:05,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:05,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101170930] [2023-11-30 04:50:05,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101170930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:05,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:05,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-30 04:50:05,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884842622] [2023-11-30 04:50:05,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:05,728 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-30 04:50:05,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:05,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-30 04:50:05,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-30 04:50:05,729 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 180 [2023-11-30 04:50:05,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 643 transitions, 16755 flow. Second operand has 14 states, 14 states have (on average 95.92857142857143) internal successors, (1343), 14 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:05,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:05,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 180 [2023-11-30 04:50:05,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:08,339 INFO L124 PetriNetUnfolderBase]: 4062/10324 cut-off events. [2023-11-30 04:50:08,339 INFO L125 PetriNetUnfolderBase]: For 171913/196050 co-relation queries the response was YES. [2023-11-30 04:50:08,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90911 conditions, 10324 events. 4062/10324 cut-off events. For 171913/196050 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 100257 event pairs, 70 based on Foata normal form. 88/9856 useless extension candidates. Maximal degree in co-relation 90693. Up to 4205 conditions per place. [2023-11-30 04:50:08,444 INFO L140 encePairwiseOnDemand]: 156/180 looper letters, 259 selfloop transitions, 67 changer transitions 668/1083 dead transitions. [2023-11-30 04:50:08,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 1083 transitions, 31438 flow [2023-11-30 04:50:08,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 04:50:08,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 04:50:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1868 transitions. [2023-11-30 04:50:08,447 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5765432098765432 [2023-11-30 04:50:08,447 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1868 transitions. [2023-11-30 04:50:08,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1868 transitions. [2023-11-30 04:50:08,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:08,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1868 transitions. [2023-11-30 04:50:08,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 103.77777777777777) internal successors, (1868), 18 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:08,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 180.0) internal successors, (3420), 19 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:08,454 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 180.0) internal successors, (3420), 19 states have internal predecessors, (3420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:08,454 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, 42 predicate places. [2023-11-30 04:50:08,454 INFO L500 AbstractCegarLoop]: Abstraction has has 226 places, 1083 transitions, 31438 flow [2023-11-30 04:50:08,455 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 95.92857142857143) internal successors, (1343), 14 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:08,455 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:50:08,455 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:08,455 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 04:50:08,455 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-11-30 04:50:08,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:50:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash 2079894356, now seen corresponding path program 2 times [2023-11-30 04:50:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:50:08,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382204671] [2023-11-30 04:50:08,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:50:08,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:50:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:50:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:50:08,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:50:08,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382204671] [2023-11-30 04:50:08,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382204671] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:50:08,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:50:08,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:50:08,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429414002] [2023-11-30 04:50:08,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:50:08,981 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:50:08,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:50:08,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:50:08,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:50:08,982 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 180 [2023-11-30 04:50:08,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 1083 transitions, 31438 flow. Second operand has 11 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:08,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:50:08,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 180 [2023-11-30 04:50:08,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:50:11,368 INFO L124 PetriNetUnfolderBase]: 3459/8989 cut-off events. [2023-11-30 04:50:11,369 INFO L125 PetriNetUnfolderBase]: For 156204/174620 co-relation queries the response was YES. [2023-11-30 04:50:11,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80963 conditions, 8989 events. 3459/8989 cut-off events. For 156204/174620 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 85813 event pairs, 80 based on Foata normal form. 2/8792 useless extension candidates. Maximal degree in co-relation 80734. Up to 3286 conditions per place. [2023-11-30 04:50:11,414 INFO L140 encePairwiseOnDemand]: 166/180 looper letters, 0 selfloop transitions, 0 changer transitions 1065/1065 dead transitions. [2023-11-30 04:50:11,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1065 transitions, 32722 flow [2023-11-30 04:50:11,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:50:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:50:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 943 transitions. [2023-11-30 04:50:11,428 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5820987654320988 [2023-11-30 04:50:11,428 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 943 transitions. [2023-11-30 04:50:11,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 943 transitions. [2023-11-30 04:50:11,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:50:11,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 943 transitions. [2023-11-30 04:50:11,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:11,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:11,435 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 180.0) internal successors, (1800), 10 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:11,435 INFO L307 CegarLoopForPetriNet]: 184 programPoint places, 44 predicate places. [2023-11-30 04:50:11,435 INFO L500 AbstractCegarLoop]: Abstraction has has 228 places, 1065 transitions, 32722 flow [2023-11-30 04:50:11,436 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:50:11,446 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe018_power.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:50:11,498 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 87 remaining) [2023-11-30 04:50:11,500 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 87 remaining) [2023-11-30 04:50:11,500 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 87 remaining) [2023-11-30 04:50:11,502 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 87 remaining) [2023-11-30 04:50:11,503 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 87 remaining) [2023-11-30 04:50:11,504 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 87 remaining) [2023-11-30 04:50:11,505 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 87 remaining) [2023-11-30 04:50:11,505 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 87 remaining) [2023-11-30 04:50:11,505 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 87 remaining) [2023-11-30 04:50:11,505 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 87 remaining) [2023-11-30 04:50:11,505 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 87 remaining) [2023-11-30 04:50:11,506 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 87 remaining) [2023-11-30 04:50:11,506 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 87 remaining) [2023-11-30 04:50:11,506 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 87 remaining) [2023-11-30 04:50:11,506 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 87 remaining) [2023-11-30 04:50:11,506 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 87 remaining) [2023-11-30 04:50:11,506 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 87 remaining) [2023-11-30 04:50:11,506 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 87 remaining) [2023-11-30 04:50:11,506 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 87 remaining) [2023-11-30 04:50:11,507 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 87 remaining) [2023-11-30 04:50:11,508 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 87 remaining) [2023-11-30 04:50:11,508 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 04:50:11,509 INFO L457 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:50:11,514 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:50:11,514 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:50:11,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:50:11 BasicIcfg [2023-11-30 04:50:11,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:50:11,521 INFO L158 Benchmark]: Toolchain (without parser) took 27875.26ms. Allocated memory was 486.5MB in the beginning and 5.4GB in the end (delta: 5.0GB). Free memory was 445.8MB in the beginning and 4.6GB in the end (delta: -4.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-11-30 04:50:11,521 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 358.6MB. Free memory is still 314.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:50:11,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.04ms. Allocated memory is still 486.5MB. Free memory was 445.7MB in the beginning and 420.1MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 04:50:11,521 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.53ms. Allocated memory is still 486.5MB. Free memory was 420.1MB in the beginning and 417.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:50:11,521 INFO L158 Benchmark]: Boogie Preprocessor took 49.83ms. Allocated memory is still 486.5MB. Free memory was 417.2MB in the beginning and 414.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:50:11,521 INFO L158 Benchmark]: RCFGBuilder took 934.39ms. Allocated memory is still 486.5MB. Free memory was 414.6MB in the beginning and 330.3MB in the end (delta: 84.3MB). Peak memory consumption was 86.0MB. Max. memory is 16.0GB. [2023-11-30 04:50:11,521 INFO L158 Benchmark]: TraceAbstraction took 26296.42ms. Allocated memory was 486.5MB in the beginning and 5.4GB in the end (delta: 5.0GB). Free memory was 330.3MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-11-30 04:50:11,522 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.14ms. Allocated memory is still 358.6MB. Free memory is still 314.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 525.04ms. Allocated memory is still 486.5MB. Free memory was 445.7MB in the beginning and 420.1MB in the end (delta: 25.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.53ms. Allocated memory is still 486.5MB. Free memory was 420.1MB in the beginning and 417.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.83ms. Allocated memory is still 486.5MB. Free memory was 417.2MB in the beginning and 414.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 934.39ms. Allocated memory is still 486.5MB. Free memory was 414.6MB in the beginning and 330.3MB in the end (delta: 84.3MB). Peak memory consumption was 86.0MB. Max. memory is 16.0GB. * TraceAbstraction took 26296.42ms. Allocated memory was 486.5MB in the beginning and 5.4GB in the end (delta: 5.0GB). Free memory was 330.3MB in the beginning and 4.6GB in the end (delta: -4.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 240 locations, 87 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: 26.1s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 925 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 925 mSDsluCounter, 388 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 203 mSDsCounter, 294 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2201 IncrementalHoareTripleChecker+Invalid, 2495 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 294 mSolverCounterUnsat, 185 mSDtfsCounter, 2201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32722occurred in iteration=17, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1336 NumberOfCodeBlocks, 1336 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1319 ConstructedInterpolants, 0 QuantifiedInterpolants, 7780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 48 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:50:11,553 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...