/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:08:22,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:08:22,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:08:22,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:08:22,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:08:22,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:08:22,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:08:22,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:08:22,174 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:08:22,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:08:22,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:08:22,177 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:08:22,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:08:22,179 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:08:22,179 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:08:22,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:08:22,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:08:22,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:08:22,179 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:08:22,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:08:22,180 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:08:22,180 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:08:22,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:08:22,180 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:08:22,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:08:22,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:22,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:08:22,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:08:22,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:08:22,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:08:22,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:08:22,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:08:22,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:08:22,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:08:22,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:08:22,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:08:22,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:08:22,403 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:08:22,403 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:08:22,404 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i [2023-12-05 21:08:23,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:08:23,715 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:08:23,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i [2023-12-05 21:08:23,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c91ebdc2/807d1b4f63104be88e10fc0afa3df9fc/FLAG8322611cc [2023-12-05 21:08:23,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c91ebdc2/807d1b4f63104be88e10fc0afa3df9fc [2023-12-05 21:08:23,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:08:23,770 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:08:23,771 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:23,771 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:08:23,774 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:08:23,775 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:23" (1/1) ... [2023-12-05 21:08:23,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100f18c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:23, skipping insertion in model container [2023-12-05 21:08:23,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:23" (1/1) ... [2023-12-05 21:08:23,824 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:08:24,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:24,136 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:08:24,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:24,205 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:24,205 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:24,210 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:08:24,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24 WrapperNode [2023-12-05 21:08:24,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:24,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:24,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:08:24,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:08:24,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,282 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-12-05 21:08:24,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:24,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:08:24,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:08:24,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:08:24,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:08:24,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:08:24,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:08:24,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:08:24,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (1/1) ... [2023-12-05 21:08:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:24,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:08:24,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:08:24,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:08:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:08:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:08:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:08:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:08:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:08:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:08:24,390 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:08:24,390 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:08:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:08:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:08:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:08:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:08:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:08:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:08:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:08:24,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:08:24,393 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:08:24,572 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:08:24,580 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:08:25,042 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:08:25,304 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:08:25,304 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:08:25,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:25 BoogieIcfgContainer [2023-12-05 21:08:25,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:08:25,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:08:25,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:08:25,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:08:25,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:08:23" (1/3) ... [2023-12-05 21:08:25,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5922536a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:25, skipping insertion in model container [2023-12-05 21:08:25,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:24" (2/3) ... [2023-12-05 21:08:25,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5922536a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:25, skipping insertion in model container [2023-12-05 21:08:25,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:25" (3/3) ... [2023-12-05 21:08:25,312 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2023-12-05 21:08:25,326 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:08:25,326 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-12-05 21:08:25,326 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:08:25,412 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:08:25,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 175 transitions, 362 flow [2023-12-05 21:08:25,521 INFO L124 PetriNetUnfolderBase]: 3/172 cut-off events. [2023-12-05 21:08:25,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:25,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 172 events. 3/172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 249 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2023-12-05 21:08:25,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 175 transitions, 362 flow [2023-12-05 21:08:25,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 172 transitions, 353 flow [2023-12-05 21:08:25,547 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:08:25,554 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;@f6f3cec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:08:25,555 INFO L363 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2023-12-05 21:08:25,566 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:08:25,566 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-12-05 21:08:25,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:25,567 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:25,567 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:25,568 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:25,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:25,571 INFO L85 PathProgramCache]: Analyzing trace with hash -736744896, now seen corresponding path program 1 times [2023-12-05 21:08:25,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:25,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138655212] [2023-12-05 21:08:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:25,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:25,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138655212] [2023-12-05 21:08:25,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138655212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:25,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:25,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052441007] [2023-12-05 21:08:25,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:25,865 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:25,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:25,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:25,900 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 175 [2023-12-05 21:08:25,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 172 transitions, 353 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-12-05 21:08:25,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:25,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 175 [2023-12-05 21:08:25,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:27,436 INFO L124 PetriNetUnfolderBase]: 4781/9525 cut-off events. [2023-12-05 21:08:27,436 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:08:27,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16457 conditions, 9525 events. 4781/9525 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 84419 event pairs, 3061 based on Foata normal form. 304/5221 useless extension candidates. Maximal degree in co-relation 16382. Up to 4440 conditions per place. [2023-12-05 21:08:27,501 INFO L140 encePairwiseOnDemand]: 149/175 looper letters, 56 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2023-12-05 21:08:27,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 159 transitions, 443 flow [2023-12-05 21:08:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-12-05 21:08:27,511 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8 [2023-12-05 21:08:27,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-12-05 21:08:27,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-12-05 21:08:27,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:27,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-12-05 21:08:27,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:27,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:27,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:27,524 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -22 predicate places. [2023-12-05 21:08:27,525 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 159 transitions, 443 flow [2023-12-05 21:08:27,525 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-12-05 21:08:27,525 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:27,525 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:27,525 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:08:27,526 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:27,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:27,526 INFO L85 PathProgramCache]: Analyzing trace with hash -736744895, now seen corresponding path program 1 times [2023-12-05 21:08:27,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:27,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11251491] [2023-12-05 21:08:27,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:27,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:27,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:27,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11251491] [2023-12-05 21:08:27,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11251491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:27,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:27,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:27,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267591407] [2023-12-05 21:08:27,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:27,663 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:27,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:27,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:27,666 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 175 [2023-12-05 21:08:27,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 159 transitions, 443 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-12-05 21:08:27,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:27,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 175 [2023-12-05 21:08:27,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:28,910 INFO L124 PetriNetUnfolderBase]: 4808/9559 cut-off events. [2023-12-05 21:08:28,911 INFO L125 PetriNetUnfolderBase]: For 712/1876 co-relation queries the response was YES. [2023-12-05 21:08:28,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23140 conditions, 9559 events. 4808/9559 cut-off events. For 712/1876 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 84615 event pairs, 3088 based on Foata normal form. 0/4948 useless extension candidates. Maximal degree in co-relation 23059. Up to 4954 conditions per place. [2023-12-05 21:08:28,994 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 66 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2023-12-05 21:08:28,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 172 transitions, 631 flow [2023-12-05 21:08:28,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-12-05 21:08:28,996 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7276190476190476 [2023-12-05 21:08:28,996 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-12-05 21:08:28,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-12-05 21:08:28,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:28,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-12-05 21:08:29,006 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-12-05 21:08:29,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:29,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:29,009 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -21 predicate places. [2023-12-05 21:08:29,009 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 172 transitions, 631 flow [2023-12-05 21:08:29,009 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-12-05 21:08:29,009 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:29,009 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:29,009 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:08:29,010 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:29,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1083565132, now seen corresponding path program 1 times [2023-12-05 21:08:29,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:29,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862747544] [2023-12-05 21:08:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:29,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:29,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:29,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862747544] [2023-12-05 21:08:29,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862747544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:29,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:29,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946041190] [2023-12-05 21:08:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:29,175 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:29,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:29,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:29,176 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 175 [2023-12-05 21:08:29,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 172 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:29,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:29,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 175 [2023-12-05 21:08:29,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:30,389 INFO L124 PetriNetUnfolderBase]: 3097/7065 cut-off events. [2023-12-05 21:08:30,390 INFO L125 PetriNetUnfolderBase]: For 1393/2151 co-relation queries the response was YES. [2023-12-05 21:08:30,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20848 conditions, 7065 events. 3097/7065 cut-off events. For 1393/2151 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 64915 event pairs, 866 based on Foata normal form. 0/4651 useless extension candidates. Maximal degree in co-relation 20756. Up to 3482 conditions per place. [2023-12-05 21:08:30,459 INFO L140 encePairwiseOnDemand]: 158/175 looper letters, 73 selfloop transitions, 15 changer transitions 0/187 dead transitions. [2023-12-05 21:08:30,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 187 transitions, 893 flow [2023-12-05 21:08:30,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:08:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:08:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 833 transitions. [2023-12-05 21:08:30,461 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-12-05 21:08:30,461 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 833 transitions. [2023-12-05 21:08:30,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 833 transitions. [2023-12-05 21:08:30,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:30,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 833 transitions. [2023-12-05 21:08:30,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.0) internal successors, (833), 7 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:30,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:30,466 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:30,466 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -17 predicate places. [2023-12-05 21:08:30,466 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 187 transitions, 893 flow [2023-12-05 21:08:30,467 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:30,467 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:30,467 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:30,467 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:08:30,467 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:30,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:30,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1083565131, now seen corresponding path program 1 times [2023-12-05 21:08:30,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:30,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405819075] [2023-12-05 21:08:30,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:30,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:30,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:30,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405819075] [2023-12-05 21:08:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405819075] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:30,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:08:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468902001] [2023-12-05 21:08:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:30,669 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:08:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:30,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:08:30,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:08:30,673 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 175 [2023-12-05 21:08:30,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 187 transitions, 893 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:30,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:30,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 175 [2023-12-05 21:08:30,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:31,126 INFO L124 PetriNetUnfolderBase]: 789/2431 cut-off events. [2023-12-05 21:08:31,126 INFO L125 PetriNetUnfolderBase]: For 1020/1214 co-relation queries the response was YES. [2023-12-05 21:08:31,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7250 conditions, 2431 events. 789/2431 cut-off events. For 1020/1214 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 20534 event pairs, 135 based on Foata normal form. 0/2063 useless extension candidates. Maximal degree in co-relation 7149. Up to 1141 conditions per place. [2023-12-05 21:08:31,139 INFO L140 encePairwiseOnDemand]: 166/175 looper letters, 48 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2023-12-05 21:08:31,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 160 transitions, 777 flow [2023-12-05 21:08:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-12-05 21:08:31,141 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6914285714285714 [2023-12-05 21:08:31,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-12-05 21:08:31,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-12-05 21:08:31,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:31,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-12-05 21:08:31,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,143 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,144 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -21 predicate places. [2023-12-05 21:08:31,144 INFO L500 AbstractCegarLoop]: Abstraction has has 158 places, 160 transitions, 777 flow [2023-12-05 21:08:31,145 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,145 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:31,145 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:31,145 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:08:31,145 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:31,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2049845846, now seen corresponding path program 1 times [2023-12-05 21:08:31,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:31,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783092039] [2023-12-05 21:08:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783092039] [2023-12-05 21:08:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783092039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:31,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:31,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:31,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916231937] [2023-12-05 21:08:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:31,197 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:31,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:31,198 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 175 [2023-12-05 21:08:31,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 160 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:31,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 175 [2023-12-05 21:08:31,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:31,526 INFO L124 PetriNetUnfolderBase]: 939/2578 cut-off events. [2023-12-05 21:08:31,526 INFO L125 PetriNetUnfolderBase]: For 2429/2693 co-relation queries the response was YES. [2023-12-05 21:08:31,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9484 conditions, 2578 events. 939/2578 cut-off events. For 2429/2693 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 21230 event pairs, 129 based on Foata normal form. 2/2152 useless extension candidates. Maximal degree in co-relation 9374. Up to 1296 conditions per place. [2023-12-05 21:08:31,545 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 57 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2023-12-05 21:08:31,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 160 transitions, 899 flow [2023-12-05 21:08:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:31,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:31,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-12-05 21:08:31,547 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.68 [2023-12-05 21:08:31,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-12-05 21:08:31,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-12-05 21:08:31,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:31,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-12-05 21:08:31,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,551 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -20 predicate places. [2023-12-05 21:08:31,551 INFO L500 AbstractCegarLoop]: Abstraction has has 159 places, 160 transitions, 899 flow [2023-12-05 21:08:31,552 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,552 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:31,552 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:31,552 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:08:31,553 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:31,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2049845847, now seen corresponding path program 1 times [2023-12-05 21:08:31,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:31,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089898939] [2023-12-05 21:08:31,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:31,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089898939] [2023-12-05 21:08:31,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089898939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:31,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:31,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:31,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663258375] [2023-12-05 21:08:31,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:31,642 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:31,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:31,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:31,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:31,643 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 175 [2023-12-05 21:08:31,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 160 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:31,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:31,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 175 [2023-12-05 21:08:31,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:32,054 INFO L124 PetriNetUnfolderBase]: 938/2596 cut-off events. [2023-12-05 21:08:32,055 INFO L125 PetriNetUnfolderBase]: For 3545/3945 co-relation queries the response was YES. [2023-12-05 21:08:32,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10874 conditions, 2596 events. 938/2596 cut-off events. For 3545/3945 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 21601 event pairs, 91 based on Foata normal form. 2/2170 useless extension candidates. Maximal degree in co-relation 10756. Up to 1296 conditions per place. [2023-12-05 21:08:32,072 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 65 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2023-12-05 21:08:32,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 172 transitions, 1181 flow [2023-12-05 21:08:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-12-05 21:08:32,073 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.699047619047619 [2023-12-05 21:08:32,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-12-05 21:08:32,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-12-05 21:08:32,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:32,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-12-05 21:08:32,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,077 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,078 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -19 predicate places. [2023-12-05 21:08:32,079 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 172 transitions, 1181 flow [2023-12-05 21:08:32,079 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,079 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:32,079 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:32,079 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:08:32,079 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:32,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2083260060, now seen corresponding path program 1 times [2023-12-05 21:08:32,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:32,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097390383] [2023-12-05 21:08:32,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:32,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097390383] [2023-12-05 21:08:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097390383] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:32,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:32,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501454168] [2023-12-05 21:08:32,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:32,134 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:32,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:32,136 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 175 [2023-12-05 21:08:32,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 172 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:32,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 175 [2023-12-05 21:08:32,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:32,513 INFO L124 PetriNetUnfolderBase]: 1085/2793 cut-off events. [2023-12-05 21:08:32,513 INFO L125 PetriNetUnfolderBase]: For 7017/7287 co-relation queries the response was YES. [2023-12-05 21:08:32,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13576 conditions, 2793 events. 1085/2793 cut-off events. For 7017/7287 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 22809 event pairs, 91 based on Foata normal form. 4/2308 useless extension candidates. Maximal degree in co-relation 13449. Up to 1459 conditions per place. [2023-12-05 21:08:32,534 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 71 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2023-12-05 21:08:32,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 173 transitions, 1347 flow [2023-12-05 21:08:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:32,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:32,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:08:32,536 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6780952380952381 [2023-12-05 21:08:32,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:08:32,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:08:32,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:32,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:08:32,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,538 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,539 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -18 predicate places. [2023-12-05 21:08:32,539 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 173 transitions, 1347 flow [2023-12-05 21:08:32,539 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,539 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:32,539 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:32,539 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:08:32,540 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:32,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2083260059, now seen corresponding path program 1 times [2023-12-05 21:08:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:32,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565190639] [2023-12-05 21:08:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:32,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:32,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565190639] [2023-12-05 21:08:32,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565190639] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:32,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:32,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:32,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154465297] [2023-12-05 21:08:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:32,606 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:32,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:32,607 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 175 [2023-12-05 21:08:32,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 173 transitions, 1347 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:32,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:32,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 175 [2023-12-05 21:08:32,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:33,056 INFO L124 PetriNetUnfolderBase]: 1081/2730 cut-off events. [2023-12-05 21:08:33,056 INFO L125 PetriNetUnfolderBase]: For 9085/9253 co-relation queries the response was YES. [2023-12-05 21:08:33,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14991 conditions, 2730 events. 1081/2730 cut-off events. For 9085/9253 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 22447 event pairs, 53 based on Foata normal form. 4/2245 useless extension candidates. Maximal degree in co-relation 14856. Up to 1459 conditions per place. [2023-12-05 21:08:33,077 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 79 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2023-12-05 21:08:33,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 185 transitions, 1707 flow [2023-12-05 21:08:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-12-05 21:08:33,078 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6971428571428572 [2023-12-05 21:08:33,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-12-05 21:08:33,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-12-05 21:08:33,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:33,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-12-05 21:08:33,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,081 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -17 predicate places. [2023-12-05 21:08:33,081 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 185 transitions, 1707 flow [2023-12-05 21:08:33,081 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,081 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:33,081 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:33,082 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:08:33,082 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:33,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1711580554, now seen corresponding path program 1 times [2023-12-05 21:08:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604410933] [2023-12-05 21:08:33,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:33,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604410933] [2023-12-05 21:08:33,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604410933] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:33,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:33,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901775150] [2023-12-05 21:08:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:33,170 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:33,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:33,171 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 175 [2023-12-05 21:08:33,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 185 transitions, 1707 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:33,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 175 [2023-12-05 21:08:33,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:33,539 INFO L124 PetriNetUnfolderBase]: 1055/2658 cut-off events. [2023-12-05 21:08:33,540 INFO L125 PetriNetUnfolderBase]: For 11854/12046 co-relation queries the response was YES. [2023-12-05 21:08:33,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15806 conditions, 2658 events. 1055/2658 cut-off events. For 11854/12046 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 21633 event pairs, 45 based on Foata normal form. 0/2181 useless extension candidates. Maximal degree in co-relation 15668. Up to 1459 conditions per place. [2023-12-05 21:08:33,563 INFO L140 encePairwiseOnDemand]: 171/175 looper letters, 103 selfloop transitions, 12 changer transitions 0/233 dead transitions. [2023-12-05 21:08:33,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 233 transitions, 2807 flow [2023-12-05 21:08:33,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions. [2023-12-05 21:08:33,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2023-12-05 21:08:33,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions. [2023-12-05 21:08:33,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions. [2023-12-05 21:08:33,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:33,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions. [2023-12-05 21:08:33,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,567 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,568 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -15 predicate places. [2023-12-05 21:08:33,568 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 233 transitions, 2807 flow [2023-12-05 21:08:33,569 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,569 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:33,569 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:33,569 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:08:33,569 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:33,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash -418168035, now seen corresponding path program 1 times [2023-12-05 21:08:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172090842] [2023-12-05 21:08:33,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:33,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:33,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:33,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172090842] [2023-12-05 21:08:33,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172090842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:33,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:33,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:08:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006152636] [2023-12-05 21:08:33,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:33,647 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:08:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:08:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:08:33,648 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 175 [2023-12-05 21:08:33,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 233 transitions, 2807 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:33,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:33,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 175 [2023-12-05 21:08:33,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:34,201 INFO L124 PetriNetUnfolderBase]: 1048/2653 cut-off events. [2023-12-05 21:08:34,201 INFO L125 PetriNetUnfolderBase]: For 14584/14800 co-relation queries the response was YES. [2023-12-05 21:08:34,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17078 conditions, 2653 events. 1048/2653 cut-off events. For 14584/14800 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 21705 event pairs, 41 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 16929. Up to 1459 conditions per place. [2023-12-05 21:08:34,227 INFO L140 encePairwiseOnDemand]: 167/175 looper letters, 114 selfloop transitions, 26 changer transitions 0/241 dead transitions. [2023-12-05 21:08:34,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 241 transitions, 3199 flow [2023-12-05 21:08:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:34,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-12-05 21:08:34,229 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.69 [2023-12-05 21:08:34,229 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-12-05 21:08:34,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-12-05 21:08:34,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:34,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-12-05 21:08:34,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,231 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,232 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -13 predicate places. [2023-12-05 21:08:34,232 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 241 transitions, 3199 flow [2023-12-05 21:08:34,232 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,232 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:34,232 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:34,232 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:08:34,233 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:34,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash -418168034, now seen corresponding path program 1 times [2023-12-05 21:08:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:34,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462408367] [2023-12-05 21:08:34,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:34,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:34,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:34,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462408367] [2023-12-05 21:08:34,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462408367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:34,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:34,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:08:34,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346918361] [2023-12-05 21:08:34,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:34,471 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:08:34,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:34,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:08:34,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:08:34,472 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 175 [2023-12-05 21:08:34,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 241 transitions, 3199 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:34,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:34,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 175 [2023-12-05 21:08:34,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:35,008 INFO L124 PetriNetUnfolderBase]: 1041/2672 cut-off events. [2023-12-05 21:08:35,008 INFO L125 PetriNetUnfolderBase]: For 17682/17922 co-relation queries the response was YES. [2023-12-05 21:08:35,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18151 conditions, 2672 events. 1041/2672 cut-off events. For 17682/17922 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 22079 event pairs, 37 based on Foata normal form. 0/2207 useless extension candidates. Maximal degree in co-relation 17992. Up to 1459 conditions per place. [2023-12-05 21:08:35,036 INFO L140 encePairwiseOnDemand]: 172/175 looper letters, 116 selfloop transitions, 12 changer transitions 0/240 dead transitions. [2023-12-05 21:08:35,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 240 transitions, 3433 flow [2023-12-05 21:08:35,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:08:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:08:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 486 transitions. [2023-12-05 21:08:35,038 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6942857142857143 [2023-12-05 21:08:35,038 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 486 transitions. [2023-12-05 21:08:35,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 486 transitions. [2023-12-05 21:08:35,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:35,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 486 transitions. [2023-12-05 21:08:35,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,041 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 175.0) internal successors, (875), 5 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,041 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -11 predicate places. [2023-12-05 21:08:35,041 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 240 transitions, 3433 flow [2023-12-05 21:08:35,041 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,041 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:35,042 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:35,042 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:08:35,042 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:35,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash 369149801, now seen corresponding path program 1 times [2023-12-05 21:08:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226870970] [2023-12-05 21:08:35,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:35,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226870970] [2023-12-05 21:08:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226870970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:35,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:35,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 21:08:35,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710721514] [2023-12-05 21:08:35,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:35,188 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 21:08:35,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:35,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 21:08:35,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-05 21:08:35,189 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 175 [2023-12-05 21:08:35,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 240 transitions, 3433 flow. Second operand has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:35,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 175 [2023-12-05 21:08:35,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:35,675 INFO L124 PetriNetUnfolderBase]: 813/2126 cut-off events. [2023-12-05 21:08:35,676 INFO L125 PetriNetUnfolderBase]: For 18978/19242 co-relation queries the response was YES. [2023-12-05 21:08:35,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15675 conditions, 2126 events. 813/2126 cut-off events. For 18978/19242 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 16417 event pairs, 37 based on Foata normal form. 0/1787 useless extension candidates. Maximal degree in co-relation 15505. Up to 1162 conditions per place. [2023-12-05 21:08:35,700 INFO L140 encePairwiseOnDemand]: 160/175 looper letters, 116 selfloop transitions, 32 changer transitions 0/245 dead transitions. [2023-12-05 21:08:35,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 245 transitions, 3849 flow [2023-12-05 21:08:35,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:08:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:08:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2023-12-05 21:08:35,702 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2023-12-05 21:08:35,702 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 680 transitions. [2023-12-05 21:08:35,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 680 transitions. [2023-12-05 21:08:35,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:35,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 680 transitions. [2023-12-05 21:08:35,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,706 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 175.0) internal successors, (1225), 7 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,706 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, -6 predicate places. [2023-12-05 21:08:35,706 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 245 transitions, 3849 flow [2023-12-05 21:08:35,707 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.85714285714286) internal successors, (748), 7 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,707 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:35,707 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:35,707 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:08:35,707 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:35,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:35,707 INFO L85 PathProgramCache]: Analyzing trace with hash 513283302, now seen corresponding path program 1 times [2023-12-05 21:08:35,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735113944] [2023-12-05 21:08:35,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:35,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:35,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:35,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735113944] [2023-12-05 21:08:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735113944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:35,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:35,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:08:35,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040145179] [2023-12-05 21:08:35,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:35,982 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:08:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:08:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:08:35,984 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 175 [2023-12-05 21:08:35,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 245 transitions, 3849 flow. Second operand has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:35,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:35,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 175 [2023-12-05 21:08:35,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:36,392 INFO L124 PetriNetUnfolderBase]: 585/1670 cut-off events. [2023-12-05 21:08:36,392 INFO L125 PetriNetUnfolderBase]: For 16795/17083 co-relation queries the response was YES. [2023-12-05 21:08:36,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12787 conditions, 1670 events. 585/1670 cut-off events. For 16795/17083 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 12181 event pairs, 37 based on Foata normal form. 0/1457 useless extension candidates. Maximal degree in co-relation 12606. Up to 865 conditions per place. [2023-12-05 21:08:36,405 INFO L140 encePairwiseOnDemand]: 159/175 looper letters, 128 selfloop transitions, 26 changer transitions 0/250 dead transitions. [2023-12-05 21:08:36,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 250 transitions, 4287 flow [2023-12-05 21:08:36,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:08:36,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:08:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 877 transitions. [2023-12-05 21:08:36,407 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6264285714285714 [2023-12-05 21:08:36,407 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 877 transitions. [2023-12-05 21:08:36,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 877 transitions. [2023-12-05 21:08:36,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:36,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 877 transitions. [2023-12-05 21:08:36,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,412 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 175.0) internal successors, (1575), 9 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,412 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, 1 predicate places. [2023-12-05 21:08:36,412 INFO L500 AbstractCegarLoop]: Abstraction has has 180 places, 250 transitions, 4287 flow [2023-12-05 21:08:36,413 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 104.44444444444444) internal successors, (940), 9 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,413 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:36,413 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:36,413 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:08:36,413 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 72 more)] === [2023-12-05 21:08:36,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash -660987398, now seen corresponding path program 1 times [2023-12-05 21:08:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923253025] [2023-12-05 21:08:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:08:36,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:36,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923253025] [2023-12-05 21:08:36,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923253025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:36,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:36,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:08:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685942164] [2023-12-05 21:08:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:36,788 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:08:36,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:08:36,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:08:36,789 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 175 [2023-12-05 21:08:36,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 250 transitions, 4287 flow. Second operand has 11 states, 11 states have (on average 102.18181818181819) internal successors, (1124), 11 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:36,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:36,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 175 [2023-12-05 21:08:36,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:37,079 INFO L124 PetriNetUnfolderBase]: 312/951 cut-off events. [2023-12-05 21:08:37,079 INFO L125 PetriNetUnfolderBase]: For 11498/11810 co-relation queries the response was YES. [2023-12-05 21:08:37,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7400 conditions, 951 events. 312/951 cut-off events. For 11498/11810 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5224 event pairs, 16 based on Foata normal form. 0/927 useless extension candidates. Maximal degree in co-relation 7208. Up to 385 conditions per place. [2023-12-05 21:08:37,085 INFO L140 encePairwiseOnDemand]: 162/175 looper letters, 0 selfloop transitions, 0 changer transitions 232/232 dead transitions. [2023-12-05 21:08:37,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 232 transitions, 4057 flow [2023-12-05 21:08:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:08:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:08:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 954 transitions. [2023-12-05 21:08:37,089 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2023-12-05 21:08:37,089 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 954 transitions. [2023-12-05 21:08:37,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 954 transitions. [2023-12-05 21:08:37,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:37,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 954 transitions. [2023-12-05 21:08:37,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.0) internal successors, (954), 9 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 175.0) internal successors, (1750), 10 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,095 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 175.0) internal successors, (1750), 10 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,096 INFO L308 CegarLoopForPetriNet]: 179 programPoint places, 4 predicate places. [2023-12-05 21:08:37,096 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 232 transitions, 4057 flow [2023-12-05 21:08:37,097 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 102.18181818181819) internal successors, (1124), 11 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:37,109 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/rfi006_rmo.i_BEv2_AllErrorsAtOnce [2023-12-05 21:08:37,164 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 75 remaining) [2023-12-05 21:08:37,168 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 75 remaining) [2023-12-05 21:08:37,169 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 75 remaining) [2023-12-05 21:08:37,169 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 75 remaining) [2023-12-05 21:08:37,169 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 75 remaining) [2023-12-05 21:08:37,169 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 75 remaining) [2023-12-05 21:08:37,169 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 75 remaining) [2023-12-05 21:08:37,169 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 75 remaining) [2023-12-05 21:08:37,169 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 75 remaining) [2023-12-05 21:08:37,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 75 remaining) [2023-12-05 21:08:37,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 75 remaining) [2023-12-05 21:08:37,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 75 remaining) [2023-12-05 21:08:37,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 75 remaining) [2023-12-05 21:08:37,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 75 remaining) [2023-12-05 21:08:37,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 75 remaining) [2023-12-05 21:08:37,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 75 remaining) [2023-12-05 21:08:37,170 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 75 remaining) [2023-12-05 21:08:37,171 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 75 remaining) [2023-12-05 21:08:37,171 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 75 remaining) [2023-12-05 21:08:37,171 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 75 remaining) [2023-12-05 21:08:37,171 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 75 remaining) [2023-12-05 21:08:37,171 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 75 remaining) [2023-12-05 21:08:37,171 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 75 remaining) [2023-12-05 21:08:37,171 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 75 remaining) [2023-12-05 21:08:37,171 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 75 remaining) [2023-12-05 21:08:37,172 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 75 remaining) [2023-12-05 21:08:37,173 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 75 remaining) [2023-12-05 21:08:37,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 75 remaining) [2023-12-05 21:08:37,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 75 remaining) [2023-12-05 21:08:37,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 75 remaining) [2023-12-05 21:08:37,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 75 remaining) [2023-12-05 21:08:37,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 75 remaining) [2023-12-05 21:08:37,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 75 remaining) [2023-12-05 21:08:37,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 75 remaining) [2023-12-05 21:08:37,174 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 75 remaining) [2023-12-05 21:08:37,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 75 remaining) [2023-12-05 21:08:37,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 75 remaining) [2023-12-05 21:08:37,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 75 remaining) [2023-12-05 21:08:37,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 75 remaining) [2023-12-05 21:08:37,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 75 remaining) [2023-12-05 21:08:37,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 75 remaining) [2023-12-05 21:08:37,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 75 remaining) [2023-12-05 21:08:37,175 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 75 remaining) [2023-12-05 21:08:37,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 75 remaining) [2023-12-05 21:08:37,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 75 remaining) [2023-12-05 21:08:37,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 75 remaining) [2023-12-05 21:08:37,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 75 remaining) [2023-12-05 21:08:37,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 75 remaining) [2023-12-05 21:08:37,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 75 remaining) [2023-12-05 21:08:37,176 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 75 remaining) [2023-12-05 21:08:37,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 75 remaining) [2023-12-05 21:08:37,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 75 remaining) [2023-12-05 21:08:37,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 75 remaining) [2023-12-05 21:08:37,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 75 remaining) [2023-12-05 21:08:37,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 75 remaining) [2023-12-05 21:08:37,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 75 remaining) [2023-12-05 21:08:37,177 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 75 remaining) [2023-12-05 21:08:37,178 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 75 remaining) [2023-12-05 21:08:37,178 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:08:37,178 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:37,183 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:08:37,184 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:08:37,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:08:37 BasicIcfg [2023-12-05 21:08:37,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:08:37,191 INFO L158 Benchmark]: Toolchain (without parser) took 13420.70ms. Allocated memory was 303.0MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 247.9MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 405.3MB. Max. memory is 8.0GB. [2023-12-05 21:08:37,191 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 213.9MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:08:37,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.32ms. Allocated memory is still 303.0MB. Free memory was 247.8MB in the beginning and 223.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-05 21:08:37,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.42ms. Allocated memory is still 303.0MB. Free memory was 223.4MB in the beginning and 221.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:08:37,192 INFO L158 Benchmark]: Boogie Preprocessor took 34.14ms. Allocated memory is still 303.0MB. Free memory was 221.0MB in the beginning and 218.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:08:37,192 INFO L158 Benchmark]: RCFGBuilder took 988.42ms. Allocated memory is still 303.0MB. Free memory was 218.6MB in the beginning and 175.8MB in the end (delta: 42.8MB). Peak memory consumption was 43.7MB. Max. memory is 8.0GB. [2023-12-05 21:08:37,192 INFO L158 Benchmark]: TraceAbstraction took 11883.07ms. Allocated memory was 303.0MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 175.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 332.3MB. Max. memory is 8.0GB. [2023-12-05 21:08:37,193 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 213.9MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 440.32ms. Allocated memory is still 303.0MB. Free memory was 247.8MB in the beginning and 223.4MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.42ms. Allocated memory is still 303.0MB. Free memory was 223.4MB in the beginning and 221.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.14ms. Allocated memory is still 303.0MB. Free memory was 221.0MB in the beginning and 218.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 988.42ms. Allocated memory is still 303.0MB. Free memory was 218.6MB in the beginning and 175.8MB in the end (delta: 42.8MB). Peak memory consumption was 43.7MB. Max. memory is 8.0GB. * TraceAbstraction took 11883.07ms. Allocated memory was 303.0MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 175.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 332.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 230 locations, 75 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: 11.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 516 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 516 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 963 IncrementalHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 139 mSDtfsCounter, 963 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4287occurred in iteration=13, InterpolantAutomatonStates: 63, 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, 1.9s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1028 ConstructedInterpolants, 0 QuantifiedInterpolants, 4211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:08:37,207 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...