/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/thin002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:10:54,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:10:54,139 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:10:54,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:10:54,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:10:54,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:10:54,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:10:54,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:10:54,164 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:10:54,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:10:54,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:10:54,165 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:10:54,165 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:10:54,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:10:54,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:10:54,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:10:54,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:10:54,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:10:54,167 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:10:54,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:10:54,167 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:10:54,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:10:54,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:10:54,171 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:10:54,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:10:54,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:54,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:10:54,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:10:54,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:10:54,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:10:54,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:10:54,177 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:10:54,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:10:54,177 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:10:54,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:10:54,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:10:54,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:10:54,382 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:10:54,383 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:10:54,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2023-12-05 21:10:55,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:10:55,670 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:10:55,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2023-12-05 21:10:55,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc9d76f9/2ed1d263cccb44b494695ddb2d314f26/FLAG7e6c6a07c [2023-12-05 21:10:55,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cc9d76f9/2ed1d263cccb44b494695ddb2d314f26 [2023-12-05 21:10:55,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:10:55,724 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:10:55,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:55,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:10:55,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:10:55,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:55" (1/1) ... [2023-12-05 21:10:55,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dcfd3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:55, skipping insertion in model container [2023-12-05 21:10:55,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:55" (1/1) ... [2023-12-05 21:10:55,831 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:10:56,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:56,147 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:10:56,211 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:56,237 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:56,237 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:56,242 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:10:56,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56 WrapperNode [2023-12-05 21:10:56,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:56,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:56,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:10:56,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:10:56,249 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:10:56" (1/1) ... [2023-12-05 21:10:56,263 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:10:56" (1/1) ... [2023-12-05 21:10:56,280 INFO L138 Inliner]: procedures = 177, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 157 [2023-12-05 21:10:56,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:56,281 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:10:56,281 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:10:56,281 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:10:56,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,300 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:10:56,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:10:56,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:10:56,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:10:56,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (1/1) ... [2023-12-05 21:10:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:56,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:10:56,373 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:10:56,428 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:10:56,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:10:56,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:10:56,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:10:56,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:10:56,448 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:10:56,448 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:10:56,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:10:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:10:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:10:56,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:10:56,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:10:56,450 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:10:56,609 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:10:56,613 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:10:57,084 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:10:57,394 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:10:57,395 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:10:57,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:57 BoogieIcfgContainer [2023-12-05 21:10:57,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:10:57,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:10:57,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:10:57,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:10:57,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:10:55" (1/3) ... [2023-12-05 21:10:57,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfb5502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:57, skipping insertion in model container [2023-12-05 21:10:57,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:56" (2/3) ... [2023-12-05 21:10:57,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfb5502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:57, skipping insertion in model container [2023-12-05 21:10:57,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:57" (3/3) ... [2023-12-05 21:10:57,403 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2023-12-05 21:10:57,416 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:10:57,416 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-12-05 21:10:57,417 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:10:57,515 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:10:57,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 203 places, 193 transitions, 402 flow [2023-12-05 21:10:57,642 INFO L124 PetriNetUnfolderBase]: 3/189 cut-off events. [2023-12-05 21:10:57,642 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:57,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 189 events. 3/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 248 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-12-05 21:10:57,649 INFO L82 GeneralOperation]: Start removeDead. Operand has 203 places, 193 transitions, 402 flow [2023-12-05 21:10:57,653 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 189 transitions, 390 flow [2023-12-05 21:10:57,659 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:10:57,663 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;@1397bb83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:10:57,664 INFO L363 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-12-05 21:10:57,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:10:57,672 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2023-12-05 21:10:57,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:57,672 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:57,673 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:57,673 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:10:57,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash -935602879, now seen corresponding path program 1 times [2023-12-05 21:10:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735617451] [2023-12-05 21:10:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:57,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735617451] [2023-12-05 21:10:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735617451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:57,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:57,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:57,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484904877] [2023-12-05 21:10:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:57,996 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:58,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:58,037 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 193 [2023-12-05 21:10:58,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 189 transitions, 390 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:58,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:58,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 193 [2023-12-05 21:10:58,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:58,749 INFO L124 PetriNetUnfolderBase]: 886/2321 cut-off events. [2023-12-05 21:10:58,750 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:10:58,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3835 conditions, 2321 events. 886/2321 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16451 event pairs, 532 based on Foata normal form. 76/1436 useless extension candidates. Maximal degree in co-relation 3752. Up to 907 conditions per place. [2023-12-05 21:10:58,774 INFO L140 encePairwiseOnDemand]: 173/193 looper letters, 55 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2023-12-05 21:10:58,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 179 transitions, 484 flow [2023-12-05 21:10:58,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-12-05 21:10:58,789 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8169257340241797 [2023-12-05 21:10:58,789 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-12-05 21:10:58,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-12-05 21:10:58,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:58,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-12-05 21:10:58,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:58,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:58,802 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:58,806 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -16 predicate places. [2023-12-05 21:10:58,806 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 484 flow [2023-12-05 21:10:58,806 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:58,807 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:58,807 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:58,807 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:10:58,807 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:10:58,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:58,808 INFO L85 PathProgramCache]: Analyzing trace with hash -935602878, now seen corresponding path program 1 times [2023-12-05 21:10:58,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:58,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336794753] [2023-12-05 21:10:58,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:58,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:58,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:58,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:58,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336794753] [2023-12-05 21:10:58,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336794753] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:58,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578941645] [2023-12-05 21:10:58,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:58,927 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:58,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:58,929 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 193 [2023-12-05 21:10:58,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:58,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:58,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 193 [2023-12-05 21:10:58,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:59,553 INFO L124 PetriNetUnfolderBase]: 895/2337 cut-off events. [2023-12-05 21:10:59,554 INFO L125 PetriNetUnfolderBase]: For 202/514 co-relation queries the response was YES. [2023-12-05 21:10:59,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5241 conditions, 2337 events. 895/2337 cut-off events. For 202/514 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 16504 event pairs, 541 based on Foata normal form. 0/1377 useless extension candidates. Maximal degree in co-relation 5152. Up to 1010 conditions per place. [2023-12-05 21:10:59,576 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 61 selfloop transitions, 2 changer transitions 0/189 dead transitions. [2023-12-05 21:10:59,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 189 transitions, 650 flow [2023-12-05 21:10:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:59,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-12-05 21:10:59,578 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7754749568221071 [2023-12-05 21:10:59,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-12-05 21:10:59,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-12-05 21:10:59,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:59,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-12-05 21:10:59,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:59,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:59,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:59,582 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -15 predicate places. [2023-12-05 21:10:59,583 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 189 transitions, 650 flow [2023-12-05 21:10:59,583 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:59,583 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:59,584 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] [2023-12-05 21:10:59,584 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:10:59,584 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:10:59,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1793168568, now seen corresponding path program 1 times [2023-12-05 21:10:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489555984] [2023-12-05 21:10:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:59,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:59,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489555984] [2023-12-05 21:10:59,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489555984] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:59,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:59,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:10:59,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192337082] [2023-12-05 21:10:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:59,775 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:10:59,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:59,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:10:59,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:10:59,776 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 193 [2023-12-05 21:10:59,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 189 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:59,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:59,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 193 [2023-12-05 21:10:59,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:00,252 INFO L124 PetriNetUnfolderBase]: 649/1951 cut-off events. [2023-12-05 21:11:00,252 INFO L125 PetriNetUnfolderBase]: For 474/728 co-relation queries the response was YES. [2023-12-05 21:11:00,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5289 conditions, 1951 events. 649/1951 cut-off events. For 474/728 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13804 event pairs, 205 based on Foata normal form. 0/1385 useless extension candidates. Maximal degree in co-relation 5189. Up to 795 conditions per place. [2023-12-05 21:11:00,273 INFO L140 encePairwiseOnDemand]: 177/193 looper letters, 68 selfloop transitions, 14 changer transitions 0/202 dead transitions. [2023-12-05 21:11:00,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 202 transitions, 886 flow [2023-12-05 21:11:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:11:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:11:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 978 transitions. [2023-12-05 21:11:00,275 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7239082161361954 [2023-12-05 21:11:00,275 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 978 transitions. [2023-12-05 21:11:00,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 978 transitions. [2023-12-05 21:11:00,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:00,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 978 transitions. [2023-12-05 21:11:00,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.71428571428572) internal successors, (978), 7 states have internal predecessors, (978), 0 states have call successors, (0), 0 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:11:00,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 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:11:00,280 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 193.0) internal successors, (1544), 8 states have internal predecessors, (1544), 0 states have call successors, (0), 0 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:11:00,280 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -11 predicate places. [2023-12-05 21:11:00,280 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 202 transitions, 886 flow [2023-12-05 21:11:00,281 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 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:11:00,281 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:00,281 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] [2023-12-05 21:11:00,281 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:11:00,281 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:00,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:00,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1793168569, now seen corresponding path program 1 times [2023-12-05 21:11:00,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:00,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155729821] [2023-12-05 21:11:00,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:00,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:00,477 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:11:00,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:00,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155729821] [2023-12-05 21:11:00,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155729821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:00,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:11:00,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818277446] [2023-12-05 21:11:00,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:00,479 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:11:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:00,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:11:00,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:11:00,485 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 193 [2023-12-05 21:11:00,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 202 transitions, 886 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 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:11:00,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:00,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 193 [2023-12-05 21:11:00,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:00,713 INFO L124 PetriNetUnfolderBase]: 179/756 cut-off events. [2023-12-05 21:11:00,713 INFO L125 PetriNetUnfolderBase]: For 382/556 co-relation queries the response was YES. [2023-12-05 21:11:00,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 756 events. 179/756 cut-off events. For 382/556 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3973 event pairs, 93 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 2106. Up to 274 conditions per place. [2023-12-05 21:11:00,723 INFO L140 encePairwiseOnDemand]: 178/193 looper letters, 58 selfloop transitions, 7 changer transitions 0/182 dead transitions. [2023-12-05 21:11:00,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 182 transitions, 856 flow [2023-12-05 21:11:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 21:11:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 21:11:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2023-12-05 21:11:00,725 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.697754749568221 [2023-12-05 21:11:00,725 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2023-12-05 21:11:00,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2023-12-05 21:11:00,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:00,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2023-12-05 21:11:00,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 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:11:00,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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:11:00,729 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 193.0) internal successors, (1351), 7 states have internal predecessors, (1351), 0 states have call successors, (0), 0 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:11:00,730 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -12 predicate places. [2023-12-05 21:11:00,730 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 182 transitions, 856 flow [2023-12-05 21:11:00,730 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 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:11:00,730 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:00,731 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:11:00,731 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:11:00,731 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:00,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:00,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1008029356, now seen corresponding path program 1 times [2023-12-05 21:11:00,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:00,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55916643] [2023-12-05 21:11:00,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:00,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:00,795 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:11:00,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:00,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55916643] [2023-12-05 21:11:00,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55916643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:00,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:00,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:00,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305308305] [2023-12-05 21:11:00,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:00,797 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:00,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:00,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:00,798 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 193 [2023-12-05 21:11:00,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 182 transitions, 856 flow. Second operand has 3 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:11:00,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:00,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 193 [2023-12-05 21:11:00,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:01,005 INFO L124 PetriNetUnfolderBase]: 211/857 cut-off events. [2023-12-05 21:11:01,005 INFO L125 PetriNetUnfolderBase]: For 1026/1152 co-relation queries the response was YES. [2023-12-05 21:11:01,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 857 events. 211/857 cut-off events. For 1026/1152 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4796 event pairs, 19 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 2684. Up to 307 conditions per place. [2023-12-05 21:11:01,011 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 62 selfloop transitions, 2 changer transitions 0/192 dead transitions. [2023-12-05 21:11:01,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 192 transitions, 1088 flow [2023-12-05 21:11:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-12-05 21:11:01,013 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7547495682210709 [2023-12-05 21:11:01,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-12-05 21:11:01,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-12-05 21:11:01,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:01,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-12-05 21:11:01,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:11:01,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:01,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:01,017 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -11 predicate places. [2023-12-05 21:11:01,017 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 192 transitions, 1088 flow [2023-12-05 21:11:01,018 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:11:01,018 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:01,019 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:11:01,020 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:11:01,021 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:01,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1008029357, now seen corresponding path program 1 times [2023-12-05 21:11:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:01,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835601354] [2023-12-05 21:11:01,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:01,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:01,065 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:11:01,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:01,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835601354] [2023-12-05 21:11:01,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835601354] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:01,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:01,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:01,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133537491] [2023-12-05 21:11:01,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:01,066 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:01,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:01,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:01,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:01,067 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 193 [2023-12-05 21:11:01,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 192 transitions, 1088 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:01,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 193 [2023-12-05 21:11:01,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:01,241 INFO L124 PetriNetUnfolderBase]: 210/854 cut-off events. [2023-12-05 21:11:01,241 INFO L125 PetriNetUnfolderBase]: For 1426/1594 co-relation queries the response was YES. [2023-12-05 21:11:01,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 854 events. 210/854 cut-off events. For 1426/1594 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4776 event pairs, 19 based on Foata normal form. 2/756 useless extension candidates. Maximal degree in co-relation 3080. Up to 328 conditions per place. [2023-12-05 21:11:01,249 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 67 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2023-12-05 21:11:01,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 191 transitions, 1216 flow [2023-12-05 21:11:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:01,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:11:01,250 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7322970639032815 [2023-12-05 21:11:01,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:11:01,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:11:01,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:01,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:11:01,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:01,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:01,253 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -10 predicate places. [2023-12-05 21:11:01,253 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 191 transitions, 1216 flow [2023-12-05 21:11:01,253 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,253 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:01,254 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] [2023-12-05 21:11:01,254 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:11:01,254 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:01,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:01,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1165397038, now seen corresponding path program 1 times [2023-12-05 21:11:01,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:01,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933865219] [2023-12-05 21:11:01,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:01,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:01,292 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:11:01,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:01,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933865219] [2023-12-05 21:11:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933865219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:01,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483671127] [2023-12-05 21:11:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:01,293 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:01,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:01,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:01,294 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 193 [2023-12-05 21:11:01,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 191 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 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:11:01,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:01,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 193 [2023-12-05 21:11:01,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:01,556 INFO L124 PetriNetUnfolderBase]: 242/898 cut-off events. [2023-12-05 21:11:01,556 INFO L125 PetriNetUnfolderBase]: For 2422/2632 co-relation queries the response was YES. [2023-12-05 21:11:01,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 898 events. 242/898 cut-off events. For 2422/2632 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5039 event pairs, 29 based on Foata normal form. 2/785 useless extension candidates. Maximal degree in co-relation 3752. Up to 370 conditions per place. [2023-12-05 21:11:01,568 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 68 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2023-12-05 21:11:01,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 191 transitions, 1360 flow [2023-12-05 21:11:01,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-12-05 21:11:01,570 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7322970639032815 [2023-12-05 21:11:01,570 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-12-05 21:11:01,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-12-05 21:11:01,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:01,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-12-05 21:11:01,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:01,572 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:01,574 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -9 predicate places. [2023-12-05 21:11:01,574 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 191 transitions, 1360 flow [2023-12-05 21:11:01,574 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 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:11:01,574 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:01,574 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] [2023-12-05 21:11:01,575 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:11:01,575 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:01,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1165397039, now seen corresponding path program 1 times [2023-12-05 21:11:01,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:01,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865130732] [2023-12-05 21:11:01,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:01,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:01,648 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:11:01,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:01,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865130732] [2023-12-05 21:11:01,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865130732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:01,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:01,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:01,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644445445] [2023-12-05 21:11:01,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:01,650 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:01,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:01,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:01,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:01,651 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 193 [2023-12-05 21:11:01,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 191 transitions, 1360 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:01,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 193 [2023-12-05 21:11:01,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:01,864 INFO L124 PetriNetUnfolderBase]: 241/872 cut-off events. [2023-12-05 21:11:01,864 INFO L125 PetriNetUnfolderBase]: For 3168/3420 co-relation queries the response was YES. [2023-12-05 21:11:01,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4252 conditions, 872 events. 241/872 cut-off events. For 3168/3420 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4849 event pairs, 19 based on Foata normal form. 2/759 useless extension candidates. Maximal degree in co-relation 4107. Up to 370 conditions per place. [2023-12-05 21:11:01,873 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 71 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2023-12-05 21:11:01,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 200 transitions, 1656 flow [2023-12-05 21:11:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-12-05 21:11:01,875 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7512953367875648 [2023-12-05 21:11:01,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-12-05 21:11:01,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-12-05 21:11:01,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:01,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-12-05 21:11:01,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 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:11:01,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:01,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:01,879 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -8 predicate places. [2023-12-05 21:11:01,879 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 200 transitions, 1656 flow [2023-12-05 21:11:01,879 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:01,879 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:01,880 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:11:01,880 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:11:01,880 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:01,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:01,880 INFO L85 PathProgramCache]: Analyzing trace with hash 45733564, now seen corresponding path program 1 times [2023-12-05 21:11:01,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:01,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116337576] [2023-12-05 21:11:01,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:01,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:01,986 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:11:01,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:01,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116337576] [2023-12-05 21:11:01,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116337576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546929279] [2023-12-05 21:11:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:01,988 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:01,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:01,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:01,988 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 193 [2023-12-05 21:11:01,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 200 transitions, 1656 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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:11:01,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:01,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 193 [2023-12-05 21:11:01,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:02,346 INFO L124 PetriNetUnfolderBase]: 273/922 cut-off events. [2023-12-05 21:11:02,346 INFO L125 PetriNetUnfolderBase]: For 4708/4820 co-relation queries the response was YES. [2023-12-05 21:11:02,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 922 events. 273/922 cut-off events. For 4708/4820 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5181 event pairs, 19 based on Foata normal form. 2/794 useless extension candidates. Maximal degree in co-relation 4833. Up to 403 conditions per place. [2023-12-05 21:11:02,372 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 80 selfloop transitions, 2 changer transitions 2/210 dead transitions. [2023-12-05 21:11:02,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 210 transitions, 2012 flow [2023-12-05 21:11:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-12-05 21:11:02,385 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7512953367875648 [2023-12-05 21:11:02,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-12-05 21:11:02,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-12-05 21:11:02,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:02,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-12-05 21:11:02,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 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:11:02,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:02,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:02,388 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -7 predicate places. [2023-12-05 21:11:02,388 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 210 transitions, 2012 flow [2023-12-05 21:11:02,388 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 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:11:02,388 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:02,388 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:11:02,389 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:11:02,389 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:02,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash 45733563, now seen corresponding path program 1 times [2023-12-05 21:11:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181010227] [2023-12-05 21:11:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:02,458 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:11:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181010227] [2023-12-05 21:11:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181010227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:02,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376862440] [2023-12-05 21:11:02,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:02,459 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:02,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:02,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:02,460 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 193 [2023-12-05 21:11:02,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 210 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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:11:02,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:02,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 193 [2023-12-05 21:11:02,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:02,766 INFO L124 PetriNetUnfolderBase]: 272/919 cut-off events. [2023-12-05 21:11:02,766 INFO L125 PetriNetUnfolderBase]: For 5793/5919 co-relation queries the response was YES. [2023-12-05 21:11:02,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5441 conditions, 919 events. 272/919 cut-off events. For 5793/5919 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5129 event pairs, 19 based on Foata normal form. 2/791 useless extension candidates. Maximal degree in co-relation 5279. Up to 412 conditions per place. [2023-12-05 21:11:02,777 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 85 selfloop transitions, 2 changer transitions 2/209 dead transitions. [2023-12-05 21:11:02,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 209 transitions, 2176 flow [2023-12-05 21:11:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-12-05 21:11:02,778 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7288428324697754 [2023-12-05 21:11:02,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-12-05 21:11:02,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-12-05 21:11:02,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:02,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-12-05 21:11:02,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 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:11:02,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:02,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:02,781 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -6 predicate places. [2023-12-05 21:11:02,781 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 209 transitions, 2176 flow [2023-12-05 21:11:02,783 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 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:11:02,783 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:02,783 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:11:02,783 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:11:02,783 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:02,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1539257524, now seen corresponding path program 1 times [2023-12-05 21:11:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:02,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706839699] [2023-12-05 21:11:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:02,892 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:11:02,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:02,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706839699] [2023-12-05 21:11:02,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706839699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:02,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:02,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:11:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686661096] [2023-12-05 21:11:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:02,893 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:11:02,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:02,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:11:02,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:11:02,894 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 193 [2023-12-05 21:11:02,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 209 transitions, 2176 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 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:11:02,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:02,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 193 [2023-12-05 21:11:02,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:03,118 INFO L124 PetriNetUnfolderBase]: 262/900 cut-off events. [2023-12-05 21:11:03,119 INFO L125 PetriNetUnfolderBase]: For 6593/6731 co-relation queries the response was YES. [2023-12-05 21:11:03,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 900 events. 262/900 cut-off events. For 6593/6731 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5023 event pairs, 15 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 5413. Up to 412 conditions per place. [2023-12-05 21:11:03,129 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 73 selfloop transitions, 16 changer transitions 15/246 dead transitions. [2023-12-05 21:11:03,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 246 transitions, 3207 flow [2023-12-05 21:11:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:11:03,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:11:03,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-12-05 21:11:03,131 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8307426597582038 [2023-12-05 21:11:03,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-12-05 21:11:03,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-12-05 21:11:03,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:03,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-12-05 21:11:03,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:03,133 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:11:03,134 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -4 predicate places. [2023-12-05 21:11:03,134 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 246 transitions, 3207 flow [2023-12-05 21:11:03,134 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 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:11:03,134 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:03,134 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:03,134 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 21:11:03,134 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:03,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1567881699, now seen corresponding path program 1 times [2023-12-05 21:11:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972125620] [2023-12-05 21:11:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:03,402 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:11:03,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:03,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972125620] [2023-12-05 21:11:03,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972125620] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:03,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:03,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 21:11:03,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955179600] [2023-12-05 21:11:03,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:03,403 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 21:11:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 21:11:03,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 21:11:03,404 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 193 [2023-12-05 21:11:03,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 246 transitions, 3207 flow. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 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:11:03,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:03,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 193 [2023-12-05 21:11:03,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:03,647 INFO L124 PetriNetUnfolderBase]: 260/895 cut-off events. [2023-12-05 21:11:03,647 INFO L125 PetriNetUnfolderBase]: For 7682/7834 co-relation queries the response was YES. [2023-12-05 21:11:03,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5848 conditions, 895 events. 260/895 cut-off events. For 7682/7834 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4976 event pairs, 13 based on Foata normal form. 0/775 useless extension candidates. Maximal degree in co-relation 5673. Up to 412 conditions per place. [2023-12-05 21:11:03,661 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 91 selfloop transitions, 16 changer transitions 15/251 dead transitions. [2023-12-05 21:11:03,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 251 transitions, 3559 flow [2023-12-05 21:11:03,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:11:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:11:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-12-05 21:11:03,663 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7525906735751295 [2023-12-05 21:11:03,663 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-12-05 21:11:03,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-12-05 21:11:03,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:03,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-12-05 21:11:03,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 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:11:03,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,667 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:03,668 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, -2 predicate places. [2023-12-05 21:11:03,668 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 251 transitions, 3559 flow [2023-12-05 21:11:03,668 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 0 states have call successors, (0), 0 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:11:03,668 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:03,668 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:03,669 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:11:03,669 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:03,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:03,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1567881700, now seen corresponding path program 1 times [2023-12-05 21:11:03,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:03,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619060400] [2023-12-05 21:11:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:03,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:03,788 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:11:03,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:03,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619060400] [2023-12-05 21:11:03,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619060400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:03,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:03,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-05 21:11:03,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572238040] [2023-12-05 21:11:03,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:03,789 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-05 21:11:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:03,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-05 21:11:03,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-05 21:11:03,790 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 193 [2023-12-05 21:11:03,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 251 transitions, 3559 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 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:11:03,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:03,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 193 [2023-12-05 21:11:03,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:04,048 INFO L124 PetriNetUnfolderBase]: 258/895 cut-off events. [2023-12-05 21:11:04,049 INFO L125 PetriNetUnfolderBase]: For 9039/9205 co-relation queries the response was YES. [2023-12-05 21:11:04,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6187 conditions, 895 events. 258/895 cut-off events. For 9039/9205 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5040 event pairs, 11 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 6001. Up to 412 conditions per place. [2023-12-05 21:11:04,060 INFO L140 encePairwiseOnDemand]: 185/193 looper letters, 96 selfloop transitions, 24 changer transitions 16/257 dead transitions. [2023-12-05 21:11:04,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 257 transitions, 3917 flow [2023-12-05 21:11:04,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:11:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:11:04,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2023-12-05 21:11:04,062 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7435233160621761 [2023-12-05 21:11:04,062 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2023-12-05 21:11:04,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2023-12-05 21:11:04,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:04,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2023-12-05 21:11:04,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 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:11:04,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,065 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:11:04,066 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, 0 predicate places. [2023-12-05 21:11:04,066 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 257 transitions, 3917 flow [2023-12-05 21:11:04,066 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 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:11:04,066 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:04,066 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:04,066 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:11:04,067 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:04,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1327921186, now seen corresponding path program 1 times [2023-12-05 21:11:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220163563] [2023-12-05 21:11:04,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:04,400 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:11:04,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:04,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220163563] [2023-12-05 21:11:04,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220163563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:04,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:04,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:11:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791841025] [2023-12-05 21:11:04,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:04,401 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:11:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:04,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:11:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:11:04,403 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 193 [2023-12-05 21:11:04,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 257 transitions, 3917 flow. Second operand has 11 states, 11 states have (on average 124.36363636363636) internal successors, (1368), 11 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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:11:04,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:04,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 193 [2023-12-05 21:11:04,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:05,225 INFO L124 PetriNetUnfolderBase]: 681/2024 cut-off events. [2023-12-05 21:11:05,226 INFO L125 PetriNetUnfolderBase]: For 24031/24715 co-relation queries the response was YES. [2023-12-05 21:11:05,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13876 conditions, 2024 events. 681/2024 cut-off events. For 24031/24715 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14618 event pairs, 18 based on Foata normal form. 5/1825 useless extension candidates. Maximal degree in co-relation 13678. Up to 804 conditions per place. [2023-12-05 21:11:05,260 INFO L140 encePairwiseOnDemand]: 173/193 looper letters, 209 selfloop transitions, 78 changer transitions 42/443 dead transitions. [2023-12-05 21:11:05,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 443 transitions, 9280 flow [2023-12-05 21:11:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 21:11:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-05 21:11:05,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1962 transitions. [2023-12-05 21:11:05,264 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.677720207253886 [2023-12-05 21:11:05,264 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1962 transitions. [2023-12-05 21:11:05,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1962 transitions. [2023-12-05 21:11:05,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:05,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1962 transitions. [2023-12-05 21:11:05,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 130.8) internal successors, (1962), 15 states have internal predecessors, (1962), 0 states have call successors, (0), 0 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:11:05,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 193.0) internal successors, (3088), 16 states have internal predecessors, (3088), 0 states have call successors, (0), 0 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:11:05,273 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 193.0) internal successors, (3088), 16 states have internal predecessors, (3088), 0 states have call successors, (0), 0 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:11:05,273 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, 14 predicate places. [2023-12-05 21:11:05,274 INFO L500 AbstractCegarLoop]: Abstraction has has 213 places, 443 transitions, 9280 flow [2023-12-05 21:11:05,274 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.36363636363636) internal successors, (1368), 11 states have internal predecessors, (1368), 0 states have call successors, (0), 0 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:11:05,274 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:05,274 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:05,275 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 21:11:05,275 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:05,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:05,275 INFO L85 PathProgramCache]: Analyzing trace with hash -144241987, now seen corresponding path program 1 times [2023-12-05 21:11:05,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:05,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046142581] [2023-12-05 21:11:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:05,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:05,516 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:11:05,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:05,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046142581] [2023-12-05 21:11:05,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046142581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:05,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-05 21:11:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12368795] [2023-12-05 21:11:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:05,517 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-05 21:11:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-05 21:11:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-05 21:11:05,518 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 193 [2023-12-05 21:11:05,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 443 transitions, 9280 flow. Second operand has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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:11:05,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:05,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 193 [2023-12-05 21:11:05,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:06,127 INFO L124 PetriNetUnfolderBase]: 639/1872 cut-off events. [2023-12-05 21:11:06,127 INFO L125 PetriNetUnfolderBase]: For 24862/25862 co-relation queries the response was YES. [2023-12-05 21:11:06,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13804 conditions, 1872 events. 639/1872 cut-off events. For 24862/25862 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13021 event pairs, 18 based on Foata normal form. 1/1695 useless extension candidates. Maximal degree in co-relation 13595. Up to 745 conditions per place. [2023-12-05 21:11:06,153 INFO L140 encePairwiseOnDemand]: 178/193 looper letters, 229 selfloop transitions, 51 changer transitions 44/445 dead transitions. [2023-12-05 21:11:06,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 445 transitions, 9988 flow [2023-12-05 21:11:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-05 21:11:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-05 21:11:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1050 transitions. [2023-12-05 21:11:06,155 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6800518134715026 [2023-12-05 21:11:06,156 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1050 transitions. [2023-12-05 21:11:06,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1050 transitions. [2023-12-05 21:11:06,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:06,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1050 transitions. [2023-12-05 21:11:06,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.25) internal successors, (1050), 8 states have internal predecessors, (1050), 0 states have call successors, (0), 0 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:11:06,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 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:11:06,160 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 193.0) internal successors, (1737), 9 states have internal predecessors, (1737), 0 states have call successors, (0), 0 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:11:06,160 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, 21 predicate places. [2023-12-05 21:11:06,160 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 445 transitions, 9988 flow [2023-12-05 21:11:06,161 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.77777777777777) internal successors, (1141), 9 states have internal predecessors, (1141), 0 states have call successors, (0), 0 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:11:06,161 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:06,161 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:06,161 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:11:06,161 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:06,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash -531341821, now seen corresponding path program 1 times [2023-12-05 21:11:06,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:06,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061346392] [2023-12-05 21:11:06,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:11:06,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:06,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061346392] [2023-12-05 21:11:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061346392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:06,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:06,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-05 21:11:06,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225421801] [2023-12-05 21:11:06,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:06,495 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:11:06,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:06,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:11:06,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:11:06,496 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 193 [2023-12-05 21:11:06,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 445 transitions, 9988 flow. Second operand has 11 states, 11 states have (on average 124.45454545454545) internal successors, (1369), 11 states have internal predecessors, (1369), 0 states have call successors, (0), 0 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:11:06,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:06,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 193 [2023-12-05 21:11:06,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:07,071 INFO L124 PetriNetUnfolderBase]: 538/1677 cut-off events. [2023-12-05 21:11:07,072 INFO L125 PetriNetUnfolderBase]: For 23339/25050 co-relation queries the response was YES. [2023-12-05 21:11:07,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12700 conditions, 1677 events. 538/1677 cut-off events. For 23339/25050 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 11257 event pairs, 22 based on Foata normal form. 2/1560 useless extension candidates. Maximal degree in co-relation 12480. Up to 627 conditions per place. [2023-12-05 21:11:07,092 INFO L140 encePairwiseOnDemand]: 177/193 looper letters, 237 selfloop transitions, 38 changer transitions 54/449 dead transitions. [2023-12-05 21:11:07,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 449 transitions, 10774 flow [2023-12-05 21:11:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:11:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:11:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1282 transitions. [2023-12-05 21:11:07,095 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6642487046632124 [2023-12-05 21:11:07,095 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1282 transitions. [2023-12-05 21:11:07,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1282 transitions. [2023-12-05 21:11:07,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:07,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1282 transitions. [2023-12-05 21:11:07,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 128.2) internal successors, (1282), 10 states have internal predecessors, (1282), 0 states have call successors, (0), 0 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:11:07,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 193.0) internal successors, (2123), 11 states have internal predecessors, (2123), 0 states have call successors, (0), 0 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:11:07,101 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 193.0) internal successors, (2123), 11 states have internal predecessors, (2123), 0 states have call successors, (0), 0 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:11:07,101 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, 30 predicate places. [2023-12-05 21:11:07,101 INFO L500 AbstractCegarLoop]: Abstraction has has 229 places, 449 transitions, 10774 flow [2023-12-05 21:11:07,111 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 124.45454545454545) internal successors, (1369), 11 states have internal predecessors, (1369), 0 states have call successors, (0), 0 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:11:07,111 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:11:07,112 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:07,112 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 21:11:07,112 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-12-05 21:11:07,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:11:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 477018616, now seen corresponding path program 1 times [2023-12-05 21:11:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:11:07,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991266888] [2023-12-05 21:11:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:11:07,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:11:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:11:07,584 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:11:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:11:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991266888] [2023-12-05 21:11:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991266888] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:11:07,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:11:07,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 21:11:07,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905163101] [2023-12-05 21:11:07,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:11:07,585 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-05 21:11:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:11:07,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-05 21:11:07,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-05 21:11:07,586 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 193 [2023-12-05 21:11:07,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 449 transitions, 10774 flow. Second operand has 13 states, 13 states have (on average 122.23076923076923) internal successors, (1589), 13 states have internal predecessors, (1589), 0 states have call successors, (0), 0 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:11:07,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:11:07,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 193 [2023-12-05 21:11:07,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:11:08,115 INFO L124 PetriNetUnfolderBase]: 412/1328 cut-off events. [2023-12-05 21:11:08,116 INFO L125 PetriNetUnfolderBase]: For 21087/22107 co-relation queries the response was YES. [2023-12-05 21:11:08,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10429 conditions, 1328 events. 412/1328 cut-off events. For 21087/22107 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8015 event pairs, 16 based on Foata normal form. 1/1299 useless extension candidates. Maximal degree in co-relation 10198. Up to 433 conditions per place. [2023-12-05 21:11:08,128 INFO L140 encePairwiseOnDemand]: 179/193 looper letters, 0 selfloop transitions, 0 changer transitions 421/421 dead transitions. [2023-12-05 21:11:08,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 421 transitions, 10426 flow [2023-12-05 21:11:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 21:11:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 21:11:08,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1376 transitions. [2023-12-05 21:11:08,132 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6481394253414979 [2023-12-05 21:11:08,132 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1376 transitions. [2023-12-05 21:11:08,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1376 transitions. [2023-12-05 21:11:08,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:11:08,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1376 transitions. [2023-12-05 21:11:08,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 125.0909090909091) internal successors, (1376), 11 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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:11:08,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 193.0) internal successors, (2316), 12 states have internal predecessors, (2316), 0 states have call successors, (0), 0 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:11:08,137 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 193.0) internal successors, (2316), 12 states have internal predecessors, (2316), 0 states have call successors, (0), 0 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:11:08,137 INFO L308 CegarLoopForPetriNet]: 199 programPoint places, 36 predicate places. [2023-12-05 21:11:08,138 INFO L500 AbstractCegarLoop]: Abstraction has has 235 places, 421 transitions, 10426 flow [2023-12-05 21:11:08,138 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 122.23076923076923) internal successors, (1589), 13 states have internal predecessors, (1589), 0 states have call successors, (0), 0 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:11:08,150 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/thin002_power.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:11:08,188 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 62 remaining) [2023-12-05 21:11:08,189 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 62 remaining) [2023-12-05 21:11:08,190 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 62 remaining) [2023-12-05 21:11:08,191 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 62 remaining) [2023-12-05 21:11:08,192 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 62 remaining) [2023-12-05 21:11:08,192 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 62 remaining) [2023-12-05 21:11:08,192 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 62 remaining) [2023-12-05 21:11:08,192 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 62 remaining) [2023-12-05 21:11:08,192 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 62 remaining) [2023-12-05 21:11:08,192 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 62 remaining) [2023-12-05 21:11:08,192 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 62 remaining) [2023-12-05 21:11:08,192 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 62 remaining) [2023-12-05 21:11:08,193 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 62 remaining) [2023-12-05 21:11:08,194 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 62 remaining) [2023-12-05 21:11:08,195 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 62 remaining) [2023-12-05 21:11:08,195 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 62 remaining) [2023-12-05 21:11:08,195 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 62 remaining) [2023-12-05 21:11:08,195 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 62 remaining) [2023-12-05 21:11:08,195 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 62 remaining) [2023-12-05 21:11:08,196 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 62 remaining) [2023-12-05 21:11:08,196 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 21:11:08,197 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:11:08,202 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:11:08,202 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:11:08,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:11:08 BasicIcfg [2023-12-05 21:11:08,208 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:11:08,209 INFO L158 Benchmark]: Toolchain (without parser) took 12484.60ms. Allocated memory was 210.8MB in the beginning and 950.0MB in the end (delta: 739.2MB). Free memory was 163.7MB in the beginning and 744.3MB in the end (delta: -580.6MB). Peak memory consumption was 611.5MB. Max. memory is 8.0GB. [2023-12-05 21:11:08,209 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 210.8MB. Free memory was 167.4MB in the beginning and 167.2MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:11:08,209 INFO L158 Benchmark]: CACSL2BoogieTranslator took 509.29ms. Allocated memory is still 210.8MB. Free memory was 163.5MB in the beginning and 139.4MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:08,209 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.13ms. Allocated memory is still 210.8MB. Free memory was 139.4MB in the beginning and 136.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:08,209 INFO L158 Benchmark]: Boogie Preprocessor took 29.72ms. Allocated memory is still 210.8MB. Free memory was 136.9MB in the beginning and 134.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:11:08,210 INFO L158 Benchmark]: RCFGBuilder took 1078.17ms. Allocated memory is still 210.8MB. Free memory was 134.4MB in the beginning and 93.4MB in the end (delta: 40.9MB). Peak memory consumption was 42.8MB. Max. memory is 8.0GB. [2023-12-05 21:11:08,210 INFO L158 Benchmark]: TraceAbstraction took 10810.41ms. Allocated memory was 210.8MB in the beginning and 950.0MB in the end (delta: 739.2MB). Free memory was 92.9MB in the beginning and 744.3MB in the end (delta: -651.4MB). Peak memory consumption was 540.3MB. Max. memory is 8.0GB. [2023-12-05 21:11:08,211 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.17ms. Allocated memory is still 210.8MB. Free memory was 167.4MB in the beginning and 167.2MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 509.29ms. Allocated memory is still 210.8MB. Free memory was 163.5MB in the beginning and 139.4MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.13ms. Allocated memory is still 210.8MB. Free memory was 139.4MB in the beginning and 136.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.72ms. Allocated memory is still 210.8MB. Free memory was 136.9MB in the beginning and 134.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1078.17ms. Allocated memory is still 210.8MB. Free memory was 134.4MB in the beginning and 93.4MB in the end (delta: 40.9MB). Peak memory consumption was 42.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10810.41ms. Allocated memory was 210.8MB in the beginning and 950.0MB in the end (delta: 739.2MB). Free memory was 92.9MB in the beginning and 744.3MB in the end (delta: -651.4MB). Peak memory consumption was 540.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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 249 locations, 62 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: 10.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 760 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 760 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 119 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1505 IncrementalHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 202 mSDtfsCounter, 1505 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10774occurred in iteration=16, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1452 ConstructedInterpolants, 0 QuantifiedInterpolants, 7390 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:11:08,244 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...