/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:51:07,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:51:07,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:51:07,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:51:07,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:51:07,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:51:07,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:51:07,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:51:07,443 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:51:07,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:51:07,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:51:07,446 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:51:07,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:51:07,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:51:07,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:51:07,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:51:07,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:51:07,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:51:07,447 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:51:07,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:51:07,447 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:51:07,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:51:07,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:51:07,448 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:51:07,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:51:07,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:51:07,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:51:07,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:51:07,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:51:07,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:51:07,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:51:07,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:51:07,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:51:07,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:51:07,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:51:07,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:51:07,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:51:07,635 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:51:07,635 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:51:07,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i [2023-11-30 04:51:08,576 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:51:08,779 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:51:08,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i [2023-11-30 04:51:08,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4dd7042/28179fe7777548309ecc831700815bfe/FLAG2137b1795 [2023-11-30 04:51:08,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a4dd7042/28179fe7777548309ecc831700815bfe [2023-11-30 04:51:08,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:51:08,807 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:51:08,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:51:08,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:51:08,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:51:08,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:51:08" (1/1) ... [2023-11-30 04:51:08,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad51b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:08, skipping insertion in model container [2023-11-30 04:51:08,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:51:08" (1/1) ... [2023-11-30 04:51:08,845 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:51:09,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:51:09,168 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:51:09,236 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:51:09,260 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:51:09,260 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:51:09,265 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:51:09,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09 WrapperNode [2023-11-30 04:51:09,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:51:09,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:51:09,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:51:09,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:51:09,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,294 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,322 INFO L138 Inliner]: procedures = 176, calls = 87, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 237 [2023-11-30 04:51:09,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:51:09,323 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:51:09,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:51:09,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:51:09,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:51:09,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:51:09,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:51:09,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:51:09,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (1/1) ... [2023-11-30 04:51:09,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:51:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:51:09,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:51:09,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:51:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:51:09,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:51:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:51:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:51:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:51:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:51:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:51:09,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:51:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:51:09,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:51:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:51:09,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:51:09,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:51:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:51:09,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:51:09,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:51:09,400 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:51:09,534 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:51:09,535 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:51:09,950 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:51:10,661 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:51:10,661 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:51:10,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:51:10 BoogieIcfgContainer [2023-11-30 04:51:10,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:51:10,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:51:10,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:51:10,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:51:10,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:51:08" (1/3) ... [2023-11-30 04:51:10,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ed0604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:51:10, skipping insertion in model container [2023-11-30 04:51:10,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:51:09" (2/3) ... [2023-11-30 04:51:10,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ed0604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:51:10, skipping insertion in model container [2023-11-30 04:51:10,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:51:10" (3/3) ... [2023-11-30 04:51:10,669 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_power.i [2023-11-30 04:51:10,682 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:51:10,682 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2023-11-30 04:51:10,682 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:51:10,837 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:51:10,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 194 transitions, 400 flow [2023-11-30 04:51:11,065 INFO L124 PetriNetUnfolderBase]: 3/191 cut-off events. [2023-11-30 04:51:11,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:51:11,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 3/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 360 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 135. Up to 2 conditions per place. [2023-11-30 04:51:11,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 194 transitions, 400 flow [2023-11-30 04:51:11,080 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 191 transitions, 391 flow [2023-11-30 04:51:11,089 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:51:11,103 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;@60f72441, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:51:11,103 INFO L363 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2023-11-30 04:51:11,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:51:11,113 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-30 04:51:11,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:51:11,113 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:11,114 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:11,115 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:11,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:11,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1806377330, now seen corresponding path program 1 times [2023-11-30 04:51:11,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416208790] [2023-11-30 04:51:11,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:11,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416208790] [2023-11-30 04:51:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416208790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:11,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:11,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427616820] [2023-11-30 04:51:11,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:11,581 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:11,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:11,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:11,676 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 194 [2023-11-30 04:51:11,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 191 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:11,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:11,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 194 [2023-11-30 04:51:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:15,749 INFO L124 PetriNetUnfolderBase]: 11517/21572 cut-off events. [2023-11-30 04:51:15,750 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-30 04:51:15,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37928 conditions, 21572 events. 11517/21572 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1898. Compared 209857 event pairs, 7897 based on Foata normal form. 608/11438 useless extension candidates. Maximal degree in co-relation 37853. Up to 11212 conditions per place. [2023-11-30 04:51:15,918 INFO L140 encePairwiseOnDemand]: 154/194 looper letters, 66 selfloop transitions, 2 changer transitions 0/168 dead transitions. [2023-11-30 04:51:15,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 481 flow [2023-11-30 04:51:15,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-11-30 04:51:15,928 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7646048109965635 [2023-11-30 04:51:15,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-11-30 04:51:15,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-11-30 04:51:15,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:15,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-11-30 04:51:15,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:15,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:15,937 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:15,939 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -36 predicate places. [2023-11-30 04:51:15,939 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 168 transitions, 481 flow [2023-11-30 04:51:15,940 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:15,940 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:15,940 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:15,940 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:51:15,940 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:15,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1806377329, now seen corresponding path program 1 times [2023-11-30 04:51:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486925174] [2023-11-30 04:51:15,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:15,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:16,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:16,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486925174] [2023-11-30 04:51:16,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486925174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:16,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:16,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:16,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933604974] [2023-11-30 04:51:16,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:16,108 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:16,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:16,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:16,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:16,109 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 194 [2023-11-30 04:51:16,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 168 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:16,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:16,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 194 [2023-11-30 04:51:16,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:18,998 INFO L124 PetriNetUnfolderBase]: 11572/21666 cut-off events. [2023-11-30 04:51:18,998 INFO L125 PetriNetUnfolderBase]: For 1648/3970 co-relation queries the response was YES. [2023-11-30 04:51:19,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53831 conditions, 21666 events. 11572/21666 cut-off events. For 1648/3970 co-relation queries the response was YES. Maximal size of possible extension queue 1898. Compared 210854 event pairs, 7952 based on Foata normal form. 0/10919 useless extension candidates. Maximal degree in co-relation 53750. Up to 12278 conditions per place. [2023-11-30 04:51:19,123 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 80 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2023-11-30 04:51:19,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 185 transitions, 713 flow [2023-11-30 04:51:19,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:19,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-11-30 04:51:19,126 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6683848797250859 [2023-11-30 04:51:19,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-11-30 04:51:19,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-11-30 04:51:19,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:19,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-11-30 04:51:19,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:19,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:19,129 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:19,130 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -35 predicate places. [2023-11-30 04:51:19,130 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 185 transitions, 713 flow [2023-11-30 04:51:19,130 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:19,131 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:19,131 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:19,131 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:51:19,131 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:19,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash 197859962, now seen corresponding path program 1 times [2023-11-30 04:51:19,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:19,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954649120] [2023-11-30 04:51:19,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954649120] [2023-11-30 04:51:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954649120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:19,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:19,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:51:19,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37915955] [2023-11-30 04:51:19,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:19,281 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:51:19,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:19,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:51:19,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:51:19,284 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 194 [2023-11-30 04:51:19,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 185 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:19,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:19,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 194 [2023-11-30 04:51:19,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:21,505 INFO L124 PetriNetUnfolderBase]: 6796/14325 cut-off events. [2023-11-30 04:51:21,505 INFO L125 PetriNetUnfolderBase]: For 3316/4782 co-relation queries the response was YES. [2023-11-30 04:51:21,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43753 conditions, 14325 events. 6796/14325 cut-off events. For 3316/4782 co-relation queries the response was YES. Maximal size of possible extension queue 1059. Compared 140784 event pairs, 2178 based on Foata normal form. 0/9309 useless extension candidates. Maximal degree in co-relation 43661. Up to 7103 conditions per place. [2023-11-30 04:51:21,727 INFO L140 encePairwiseOnDemand]: 175/194 looper letters, 91 selfloop transitions, 15 changer transitions 0/204 dead transitions. [2023-11-30 04:51:21,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 204 transitions, 1035 flow [2023-11-30 04:51:21,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:51:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:51:21,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2023-11-30 04:51:21,730 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6244477172312224 [2023-11-30 04:51:21,730 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2023-11-30 04:51:21,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2023-11-30 04:51:21,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:21,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2023-11-30 04:51:21,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:21,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:21,748 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:21,749 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -32 predicate places. [2023-11-30 04:51:21,749 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 204 transitions, 1035 flow [2023-11-30 04:51:21,750 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:21,750 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:21,750 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:21,750 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:51:21,750 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:21,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash 197859963, now seen corresponding path program 1 times [2023-11-30 04:51:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:21,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271088593] [2023-11-30 04:51:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:21,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:21,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271088593] [2023-11-30 04:51:21,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271088593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:21,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:21,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:51:21,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022824742] [2023-11-30 04:51:21,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:21,996 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:51:21,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:21,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:51:22,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:51:22,001 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 194 [2023-11-30 04:51:22,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 204 transitions, 1035 flow. Second operand has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:22,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:22,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 194 [2023-11-30 04:51:22,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:22,758 INFO L124 PetriNetUnfolderBase]: 1248/3286 cut-off events. [2023-11-30 04:51:22,764 INFO L125 PetriNetUnfolderBase]: For 1650/2556 co-relation queries the response was YES. [2023-11-30 04:51:22,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11240 conditions, 3286 events. 1248/3286 cut-off events. For 1650/2556 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 26700 event pairs, 556 based on Foata normal form. 0/2765 useless extension candidates. Maximal degree in co-relation 11137. Up to 1610 conditions per place. [2023-11-30 04:51:22,801 INFO L140 encePairwiseOnDemand]: 174/194 looper letters, 74 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2023-11-30 04:51:22,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 177 transitions, 981 flow [2023-11-30 04:51:22,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:51:22,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:51:22,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-11-30 04:51:22,819 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5945017182130584 [2023-11-30 04:51:22,819 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-11-30 04:51:22,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-11-30 04:51:22,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:22,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-11-30 04:51:22,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:22,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:22,848 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 194.0) internal successors, (1358), 7 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:22,850 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -36 predicate places. [2023-11-30 04:51:22,850 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 177 transitions, 981 flow [2023-11-30 04:51:22,850 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.83333333333333) internal successors, (617), 6 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:22,850 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:22,851 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:22,851 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:51:22,851 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:22,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1455475392, now seen corresponding path program 1 times [2023-11-30 04:51:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755578524] [2023-11-30 04:51:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:22,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:22,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:22,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755578524] [2023-11-30 04:51:22,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755578524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682890852] [2023-11-30 04:51:22,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:22,910 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:22,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:22,912 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 194 [2023-11-30 04:51:22,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 177 transitions, 981 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:22,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:22,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 194 [2023-11-30 04:51:22,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:23,659 INFO L124 PetriNetUnfolderBase]: 1571/4011 cut-off events. [2023-11-30 04:51:23,660 INFO L125 PetriNetUnfolderBase]: For 3879/5759 co-relation queries the response was YES. [2023-11-30 04:51:23,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15739 conditions, 4011 events. 1571/4011 cut-off events. For 3879/5759 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 33990 event pairs, 666 based on Foata normal form. 2/3354 useless extension candidates. Maximal degree in co-relation 15627. Up to 2069 conditions per place. [2023-11-30 04:51:23,684 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 75 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2023-11-30 04:51:23,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 177 transitions, 1137 flow [2023-11-30 04:51:23,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-11-30 04:51:23,685 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6168384879725086 [2023-11-30 04:51:23,685 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-11-30 04:51:23,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-11-30 04:51:23,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:23,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-11-30 04:51:23,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:23,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:23,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:23,691 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -35 predicate places. [2023-11-30 04:51:23,691 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 177 transitions, 1137 flow [2023-11-30 04:51:23,691 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:23,691 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:23,691 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:23,692 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:51:23,692 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:23,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:23,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1455475391, now seen corresponding path program 1 times [2023-11-30 04:51:23,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:23,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901181962] [2023-11-30 04:51:23,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:23,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:23,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:23,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901181962] [2023-11-30 04:51:23,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901181962] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:23,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:23,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:23,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993186052] [2023-11-30 04:51:23,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:23,736 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:23,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:23,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:23,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:23,736 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 194 [2023-11-30 04:51:23,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 177 transitions, 1137 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:23,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:23,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 194 [2023-11-30 04:51:23,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:24,343 INFO L124 PetriNetUnfolderBase]: 1570/4006 cut-off events. [2023-11-30 04:51:24,344 INFO L125 PetriNetUnfolderBase]: For 8093/9117 co-relation queries the response was YES. [2023-11-30 04:51:24,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18007 conditions, 4006 events. 1570/4006 cut-off events. For 8093/9117 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 34149 event pairs, 301 based on Foata normal form. 4/3399 useless extension candidates. Maximal degree in co-relation 17887. Up to 2069 conditions per place. [2023-11-30 04:51:24,371 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 88 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-11-30 04:51:24,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 194 transitions, 1525 flow [2023-11-30 04:51:24,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:24,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:24,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-30 04:51:24,373 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6357388316151202 [2023-11-30 04:51:24,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-30 04:51:24,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-30 04:51:24,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:24,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-30 04:51:24,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:24,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:24,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:24,378 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -34 predicate places. [2023-11-30 04:51:24,378 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 194 transitions, 1525 flow [2023-11-30 04:51:24,379 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:24,379 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:24,379 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:24,379 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:51:24,379 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:24,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:24,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1675511381, now seen corresponding path program 1 times [2023-11-30 04:51:24,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:24,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868273257] [2023-11-30 04:51:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:24,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:24,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868273257] [2023-11-30 04:51:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868273257] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730734746] [2023-11-30 04:51:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:24,453 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:24,455 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 194 [2023-11-30 04:51:24,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 194 transitions, 1525 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:24,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:24,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 194 [2023-11-30 04:51:24,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:25,081 INFO L124 PetriNetUnfolderBase]: 1884/4316 cut-off events. [2023-11-30 04:51:25,081 INFO L125 PetriNetUnfolderBase]: For 15803/16125 co-relation queries the response was YES. [2023-11-30 04:51:25,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22906 conditions, 4316 events. 1884/4316 cut-off events. For 15803/16125 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 36092 event pairs, 111 based on Foata normal form. 8/3596 useless extension candidates. Maximal degree in co-relation 22778. Up to 2393 conditions per place. [2023-11-30 04:51:25,109 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 110 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2023-11-30 04:51:25,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 215 transitions, 2049 flow [2023-11-30 04:51:25,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:25,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-30 04:51:25,110 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6357388316151202 [2023-11-30 04:51:25,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-30 04:51:25,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-30 04:51:25,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:25,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-30 04:51:25,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,112 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,112 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -33 predicate places. [2023-11-30 04:51:25,112 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 215 transitions, 2049 flow [2023-11-30 04:51:25,113 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,113 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:25,113 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:25,113 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:51:25,113 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:25,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1675511382, now seen corresponding path program 1 times [2023-11-30 04:51:25,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:25,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764422676] [2023-11-30 04:51:25,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:25,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:25,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:25,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764422676] [2023-11-30 04:51:25,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764422676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:25,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:25,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:25,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846590449] [2023-11-30 04:51:25,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:25,146 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:25,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:25,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:25,147 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 194 [2023-11-30 04:51:25,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 215 transitions, 2049 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:25,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 194 [2023-11-30 04:51:25,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:25,845 INFO L124 PetriNetUnfolderBase]: 1874/4292 cut-off events. [2023-11-30 04:51:25,845 INFO L125 PetriNetUnfolderBase]: For 20193/20571 co-relation queries the response was YES. [2023-11-30 04:51:25,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25553 conditions, 4292 events. 1874/4292 cut-off events. For 20193/20571 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 35911 event pairs, 106 based on Foata normal form. 8/3572 useless extension candidates. Maximal degree in co-relation 25416. Up to 2411 conditions per place. [2023-11-30 04:51:25,883 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 113 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2023-11-30 04:51:25,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 214 transitions, 2267 flow [2023-11-30 04:51:25,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:25,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-30 04:51:25,888 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6134020618556701 [2023-11-30 04:51:25,895 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-30 04:51:25,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-30 04:51:25,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:25,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-30 04:51:25,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,898 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,898 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -32 predicate places. [2023-11-30 04:51:25,898 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 214 transitions, 2267 flow [2023-11-30 04:51:25,898 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:25,898 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:25,898 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:25,899 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:51:25,899 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:25,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1534605099, now seen corresponding path program 1 times [2023-11-30 04:51:25,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:25,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856615092] [2023-11-30 04:51:25,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:25,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:26,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856615092] [2023-11-30 04:51:26,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856615092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:26,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:26,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:51:26,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368115966] [2023-11-30 04:51:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:26,015 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:51:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:26,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:51:26,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:51:26,016 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 194 [2023-11-30 04:51:26,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 214 transitions, 2267 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:26,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:26,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 194 [2023-11-30 04:51:26,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:26,793 INFO L124 PetriNetUnfolderBase]: 1838/4124 cut-off events. [2023-11-30 04:51:26,794 INFO L125 PetriNetUnfolderBase]: For 25151/25817 co-relation queries the response was YES. [2023-11-30 04:51:26,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27075 conditions, 4124 events. 1838/4124 cut-off events. For 25151/25817 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 34097 event pairs, 58 based on Foata normal form. 0/3420 useless extension candidates. Maximal degree in co-relation 26935. Up to 2411 conditions per place. [2023-11-30 04:51:26,830 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 140 selfloop transitions, 12 changer transitions 0/269 dead transitions. [2023-11-30 04:51:26,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 269 transitions, 3561 flow [2023-11-30 04:51:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:51:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:51:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-11-30 04:51:26,832 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6924398625429553 [2023-11-30 04:51:26,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-11-30 04:51:26,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-11-30 04:51:26,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:26,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-11-30 04:51:26,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:26,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:26,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:26,834 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -30 predicate places. [2023-11-30 04:51:26,834 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 269 transitions, 3561 flow [2023-11-30 04:51:26,835 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:26,835 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:26,835 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:26,835 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:51:26,835 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:26,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1581955097, now seen corresponding path program 1 times [2023-11-30 04:51:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:26,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404689307] [2023-11-30 04:51:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:26,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:26,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404689307] [2023-11-30 04:51:26,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404689307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:26,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:26,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:51:26,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194980714] [2023-11-30 04:51:26,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:26,912 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:51:26,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:26,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:51:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:51:26,913 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 194 [2023-11-30 04:51:26,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 269 transitions, 3561 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:26,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:26,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 194 [2023-11-30 04:51:26,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:27,853 INFO L124 PetriNetUnfolderBase]: 1957/4798 cut-off events. [2023-11-30 04:51:27,853 INFO L125 PetriNetUnfolderBase]: For 33854/34516 co-relation queries the response was YES. [2023-11-30 04:51:27,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32055 conditions, 4798 events. 1957/4798 cut-off events. For 33854/34516 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 43598 event pairs, 66 based on Foata normal form. 15/4126 useless extension candidates. Maximal degree in co-relation 31904. Up to 2675 conditions per place. [2023-11-30 04:51:27,897 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 163 selfloop transitions, 49 changer transitions 0/312 dead transitions. [2023-11-30 04:51:27,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 312 transitions, 4825 flow [2023-11-30 04:51:27,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:51:27,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:51:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-11-30 04:51:27,901 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6237113402061856 [2023-11-30 04:51:27,901 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-11-30 04:51:27,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-11-30 04:51:27,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:27,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-11-30 04:51:27,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:27,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:27,903 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:27,904 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -28 predicate places. [2023-11-30 04:51:27,904 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 312 transitions, 4825 flow [2023-11-30 04:51:27,904 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:27,904 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:27,904 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:27,904 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:51:27,905 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:27,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:27,905 INFO L85 PathProgramCache]: Analyzing trace with hash 669250778, now seen corresponding path program 1 times [2023-11-30 04:51:27,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:27,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746674850] [2023-11-30 04:51:27,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:27,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:28,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:28,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746674850] [2023-11-30 04:51:28,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746674850] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:28,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:28,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 04:51:28,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842120962] [2023-11-30 04:51:28,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:28,100 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 04:51:28,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:28,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 04:51:28,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 04:51:28,101 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 194 [2023-11-30 04:51:28,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 312 transitions, 4825 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:28,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:28,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 194 [2023-11-30 04:51:28,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:29,046 INFO L124 PetriNetUnfolderBase]: 1929/4754 cut-off events. [2023-11-30 04:51:29,046 INFO L125 PetriNetUnfolderBase]: For 41017/41715 co-relation queries the response was YES. [2023-11-30 04:51:29,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33789 conditions, 4754 events. 1929/4754 cut-off events. For 41017/41715 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 43237 event pairs, 58 based on Foata normal form. 15/4098 useless extension candidates. Maximal degree in co-relation 33628. Up to 2675 conditions per place. [2023-11-30 04:51:29,081 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 189 selfloop transitions, 13 changer transitions 0/311 dead transitions. [2023-11-30 04:51:29,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 311 transitions, 5207 flow [2023-11-30 04:51:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:51:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:51:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-11-30 04:51:29,083 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6172680412371134 [2023-11-30 04:51:29,083 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-11-30 04:51:29,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-11-30 04:51:29,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:29,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-11-30 04:51:29,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:29,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:29,085 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:29,086 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -26 predicate places. [2023-11-30 04:51:29,086 INFO L500 AbstractCegarLoop]: Abstraction has has 172 places, 311 transitions, 5207 flow [2023-11-30 04:51:29,086 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:29,086 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:29,086 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:29,086 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:51:29,086 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:29,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:29,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2044739422, now seen corresponding path program 1 times [2023-11-30 04:51:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447835875] [2023-11-30 04:51:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:29,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:29,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:29,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447835875] [2023-11-30 04:51:29,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447835875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:29,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:29,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-30 04:51:29,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580837192] [2023-11-30 04:51:29,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:29,337 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-30 04:51:29,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:29,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-30 04:51:29,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-30 04:51:29,338 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 194 [2023-11-30 04:51:29,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 311 transitions, 5207 flow. Second operand has 9 states, 9 states have (on average 103.44444444444444) internal successors, (931), 9 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:29,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:29,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 194 [2023-11-30 04:51:29,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:30,050 INFO L124 PetriNetUnfolderBase]: 1431/3801 cut-off events. [2023-11-30 04:51:30,050 INFO L125 PetriNetUnfolderBase]: For 37007/37755 co-relation queries the response was YES. [2023-11-30 04:51:30,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28241 conditions, 3801 events. 1431/3801 cut-off events. For 37007/37755 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 33414 event pairs, 58 based on Foata normal form. 2/3384 useless extension candidates. Maximal degree in co-relation 28069. Up to 2033 conditions per place. [2023-11-30 04:51:30,084 INFO L140 encePairwiseOnDemand]: 177/194 looper letters, 209 selfloop transitions, 23 changer transitions 0/327 dead transitions. [2023-11-30 04:51:30,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 327 transitions, 6055 flow [2023-11-30 04:51:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-30 04:51:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-30 04:51:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 882 transitions. [2023-11-30 04:51:30,086 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5682989690721649 [2023-11-30 04:51:30,086 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 882 transitions. [2023-11-30 04:51:30,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 882 transitions. [2023-11-30 04:51:30,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:30,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 882 transitions. [2023-11-30 04:51:30,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:30,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 194.0) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:30,090 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 194.0) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:30,090 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -19 predicate places. [2023-11-30 04:51:30,090 INFO L500 AbstractCegarLoop]: Abstraction has has 179 places, 327 transitions, 6055 flow [2023-11-30 04:51:30,091 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 103.44444444444444) internal successors, (931), 9 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:30,091 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:51:30,091 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:30,091 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:51:30,091 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 96 more)] === [2023-11-30 04:51:30,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:51:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2096578411, now seen corresponding path program 1 times [2023-11-30 04:51:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:51:30,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501264040] [2023-11-30 04:51:30,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:51:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:51:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:51:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:51:30,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:51:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501264040] [2023-11-30 04:51:30,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501264040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:51:30,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:51:30,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:51:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700548395] [2023-11-30 04:51:30,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:51:30,413 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:51:30,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:51:30,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:51:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:51:30,415 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 194 [2023-11-30 04:51:30,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 327 transitions, 6055 flow. Second operand has 11 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:30,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:51:30,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 194 [2023-11-30 04:51:30,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:51:31,082 INFO L124 PetriNetUnfolderBase]: 828/2277 cut-off events. [2023-11-30 04:51:31,082 INFO L125 PetriNetUnfolderBase]: For 25403/26315 co-relation queries the response was YES. [2023-11-30 04:51:31,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17515 conditions, 2277 events. 828/2277 cut-off events. For 25403/26315 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16953 event pairs, 16 based on Foata normal form. 2/2238 useless extension candidates. Maximal degree in co-relation 17332. Up to 998 conditions per place. [2023-11-30 04:51:31,094 INFO L140 encePairwiseOnDemand]: 180/194 looper letters, 0 selfloop transitions, 0 changer transitions 309/309 dead transitions. [2023-11-30 04:51:31,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 309 transitions, 6017 flow [2023-11-30 04:51:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:51:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:51:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 957 transitions. [2023-11-30 04:51:31,108 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5481099656357389 [2023-11-30 04:51:31,108 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 957 transitions. [2023-11-30 04:51:31,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 957 transitions. [2023-11-30 04:51:31,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:51:31,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 957 transitions. [2023-11-30 04:51:31,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.33333333333333) internal successors, (957), 9 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:31,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:31,117 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:31,127 INFO L307 CegarLoopForPetriNet]: 198 programPoint places, -17 predicate places. [2023-11-30 04:51:31,127 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 309 transitions, 6017 flow [2023-11-30 04:51:31,128 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.18181818181819) internal successors, (1113), 11 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:51:31,157 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe025_power.i_BEv2_AllErrorsAtOnce [2023-11-30 04:51:31,220 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 99 remaining) [2023-11-30 04:51:31,220 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 99 remaining) [2023-11-30 04:51:31,221 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 99 remaining) [2023-11-30 04:51:31,222 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 99 remaining) [2023-11-30 04:51:31,223 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 99 remaining) [2023-11-30 04:51:31,224 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 99 remaining) [2023-11-30 04:51:31,225 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 99 remaining) [2023-11-30 04:51:31,226 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 99 remaining) [2023-11-30 04:51:31,227 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 99 remaining) [2023-11-30 04:51:31,227 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:51:31,228 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:51:31,231 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:51:31,231 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:51:31,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:51:31 BasicIcfg [2023-11-30 04:51:31,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:51:31,236 INFO L158 Benchmark]: Toolchain (without parser) took 22429.67ms. Allocated memory was 501.2MB in the beginning and 5.4GB in the end (delta: 4.9GB). Free memory was 457.9MB in the beginning and 3.6GB in the end (delta: -3.2GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-11-30 04:51:31,236 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 373.3MB. Free memory was 325.8MB in the beginning and 325.6MB in the end (delta: 174.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:51:31,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.54ms. Allocated memory is still 501.2MB. Free memory was 457.6MB in the beginning and 430.7MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 04:51:31,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.02ms. Allocated memory is still 501.2MB. Free memory was 430.7MB in the beginning and 427.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:51:31,237 INFO L158 Benchmark]: Boogie Preprocessor took 28.05ms. Allocated memory is still 501.2MB. Free memory was 427.4MB in the beginning and 424.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:51:31,237 INFO L158 Benchmark]: RCFGBuilder took 1306.95ms. Allocated memory is still 501.2MB. Free memory was 424.7MB in the beginning and 434.1MB in the end (delta: -9.5MB). Peak memory consumption was 81.4MB. Max. memory is 16.0GB. [2023-11-30 04:51:31,237 INFO L158 Benchmark]: TraceAbstraction took 20571.04ms. Allocated memory was 501.2MB in the beginning and 5.4GB in the end (delta: 4.9GB). Free memory was 433.1MB in the beginning and 3.6GB in the end (delta: -3.2GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-11-30 04:51:31,238 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.13ms. Allocated memory is still 373.3MB. Free memory was 325.8MB in the beginning and 325.6MB in the end (delta: 174.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 459.54ms. Allocated memory is still 501.2MB. Free memory was 457.6MB in the beginning and 430.7MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.02ms. Allocated memory is still 501.2MB. Free memory was 430.7MB in the beginning and 427.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 28.05ms. Allocated memory is still 501.2MB. Free memory was 427.4MB in the beginning and 424.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1306.95ms. Allocated memory is still 501.2MB. Free memory was 424.7MB in the beginning and 434.1MB in the end (delta: -9.5MB). Peak memory consumption was 81.4MB. Max. memory is 16.0GB. * TraceAbstraction took 20571.04ms. Allocated memory was 501.2MB in the beginning and 5.4GB in the end (delta: 4.9GB). Free memory was 433.1MB in the beginning and 3.6GB in the end (delta: -3.2GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 256 locations, 99 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: 20.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 522 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 522 mSDsluCounter, 160 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1055 IncrementalHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 130 mSDtfsCounter, 1055 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6055occurred in iteration=12, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 953 NumberOfCodeBlocks, 953 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 940 ConstructedInterpolants, 0 QuantifiedInterpolants, 3670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 60 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:51:31,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...