/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/safe002_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:47:19,770 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:47:19,858 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:47:19,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:47:19,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:47:19,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:47:19,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:47:19,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:47:19,887 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:47:19,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:47:19,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:47:19,891 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:47:19,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:47:19,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:47:19,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:47:19,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:47:19,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:47:19,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:47:19,894 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:47:19,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:47:19,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:47:19,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:47:19,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:47:19,895 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:47:19,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:47:19,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:47:19,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:47:19,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:47:19,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:47:19,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:47:19,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:47:19,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:47:19,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:47:19,899 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:47:20,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:47:20,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:47:20,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:47:20,157 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:47:20,158 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:47:20,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i [2023-11-30 04:47:21,290 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:47:21,563 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:47:21,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_power.oepc.i [2023-11-30 04:47:21,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4391aace/9a187154fab646da86aa91202dccadf9/FLAG2487f4945 [2023-11-30 04:47:21,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4391aace/9a187154fab646da86aa91202dccadf9 [2023-11-30 04:47:21,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:47:21,606 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:47:21,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:47:21,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:47:21,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:47:21,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:47:21" (1/1) ... [2023-11-30 04:47:21,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af80b38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:21, skipping insertion in model container [2023-11-30 04:47:21,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:47:21" (1/1) ... [2023-11-30 04:47:21,669 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:47:22,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:47:22,104 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:47:22,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:47:22,194 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:47:22,194 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:47:22,200 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:47:22,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22 WrapperNode [2023-11-30 04:47:22,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:47:22,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:47:22,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:47:22,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:47:22,215 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:47:22" (1/1) ... [2023-11-30 04:47:22,243 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:47:22" (1/1) ... [2023-11-30 04:47:22,278 INFO L138 Inliner]: procedures = 176, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2023-11-30 04:47:22,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:47:22,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:47:22,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:47:22,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:47:22,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,328 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:47:22,339 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:47:22,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:47:22,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:47:22,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (1/1) ... [2023-11-30 04:47:22,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:47:22,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:47:22,385 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:47:22,387 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:47:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:47:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:47:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:47:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:47:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:47:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:47:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:47:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:47:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:47:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:47:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:47:22,405 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:47:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:47:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:47:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:47:22,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:47:22,407 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:47:22,541 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:47:22,543 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:47:23,191 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:47:23,730 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:47:23,730 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:47:23,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:47:23 BoogieIcfgContainer [2023-11-30 04:47:23,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:47:23,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:47:23,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:47:23,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:47:23,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:47:21" (1/3) ... [2023-11-30 04:47:23,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e0ae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:47:23, skipping insertion in model container [2023-11-30 04:47:23,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:47:22" (2/3) ... [2023-11-30 04:47:23,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e0ae6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:47:23, skipping insertion in model container [2023-11-30 04:47:23,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:47:23" (3/3) ... [2023-11-30 04:47:23,738 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_power.oepc.i [2023-11-30 04:47:23,751 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:47:23,752 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-11-30 04:47:23,752 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:47:23,873 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:47:23,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 197 transitions, 406 flow [2023-11-30 04:47:23,968 INFO L124 PetriNetUnfolderBase]: 3/194 cut-off events. [2023-11-30 04:47:23,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:47:23,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 194 events. 3/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 382 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-11-30 04:47:23,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 197 transitions, 406 flow [2023-11-30 04:47:23,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 194 transitions, 397 flow [2023-11-30 04:47:23,990 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:47:23,996 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;@75024b9c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:47:23,996 INFO L363 AbstractCegarLoop]: Starting to check reachability of 107 error locations. [2023-11-30 04:47:24,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:47:24,005 INFO L124 PetriNetUnfolderBase]: 0/57 cut-off events. [2023-11-30 04:47:24,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:47:24,005 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:24,005 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:47:24,006 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:24,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash -127113156, now seen corresponding path program 1 times [2023-11-30 04:47:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:24,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245707910] [2023-11-30 04:47:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:24,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:24,350 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:47:24,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:24,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245707910] [2023-11-30 04:47:24,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245707910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:24,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:24,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:24,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452352110] [2023-11-30 04:47:24,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:24,364 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:24,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:24,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:24,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:24,400 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 197 [2023-11-30 04:47:24,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:24,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:24,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 197 [2023-11-30 04:47:24,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:30,739 INFO L124 PetriNetUnfolderBase]: 17481/31841 cut-off events. [2023-11-30 04:47:30,739 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-30 04:47:30,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56489 conditions, 31841 events. 17481/31841 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 299201 event pairs, 11961 based on Foata normal form. 900/15509 useless extension candidates. Maximal degree in co-relation 56414. Up to 16876 conditions per place. [2023-11-30 04:47:31,002 INFO L140 encePairwiseOnDemand]: 157/197 looper letters, 74 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2023-11-30 04:47:31,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 175 transitions, 511 flow [2023-11-30 04:47:31,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:31,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-30 04:47:31,020 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7614213197969543 [2023-11-30 04:47:31,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-30 04:47:31,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-30 04:47:31,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:31,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-30 04:47:31,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 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:47:31,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:31,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:31,041 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -36 predicate places. [2023-11-30 04:47:31,041 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 175 transitions, 511 flow [2023-11-30 04:47:31,041 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:31,042 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:31,042 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:47:31,042 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:47:31,043 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:31,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:31,043 INFO L85 PathProgramCache]: Analyzing trace with hash -127113155, now seen corresponding path program 1 times [2023-11-30 04:47:31,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:31,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577225621] [2023-11-30 04:47:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:31,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:31,231 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:47:31,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:31,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577225621] [2023-11-30 04:47:31,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577225621] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:31,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:31,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433738708] [2023-11-30 04:47:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:31,234 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:31,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:31,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:31,236 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:47:31,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 175 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:31,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:31,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:47:31,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:36,228 INFO L124 PetriNetUnfolderBase]: 17543/31942 cut-off events. [2023-11-30 04:47:36,228 INFO L125 PetriNetUnfolderBase]: For 2060/6944 co-relation queries the response was YES. [2023-11-30 04:47:36,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80409 conditions, 31942 events. 17543/31942 cut-off events. For 2060/6944 co-relation queries the response was YES. Maximal size of possible extension queue 2518. Compared 299947 event pairs, 12023 based on Foata normal form. 0/14661 useless extension candidates. Maximal degree in co-relation 80328. Up to 18473 conditions per place. [2023-11-30 04:47:36,482 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 92 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2023-11-30 04:47:36,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 196 transitions, 783 flow [2023-11-30 04:47:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-30 04:47:36,484 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-30 04:47:36,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-30 04:47:36,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-30 04:47:36,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:36,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-30 04:47:36,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:36,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:36,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:36,489 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -35 predicate places. [2023-11-30 04:47:36,489 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 196 transitions, 783 flow [2023-11-30 04:47:36,490 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:36,490 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:36,490 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] [2023-11-30 04:47:36,491 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:47:36,491 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:36,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:36,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1334224858, now seen corresponding path program 1 times [2023-11-30 04:47:36,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:36,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087516172] [2023-11-30 04:47:36,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:36,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:36,694 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:47:36,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:36,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087516172] [2023-11-30 04:47:36,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087516172] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:36,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:36,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:47:36,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486043193] [2023-11-30 04:47:36,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:36,700 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:47:36,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:36,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:47:36,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:47:36,704 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197 [2023-11-30 04:47:36,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 196 transitions, 783 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:36,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:36,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197 [2023-11-30 04:47:36,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:40,172 INFO L124 PetriNetUnfolderBase]: 10538/20915 cut-off events. [2023-11-30 04:47:40,172 INFO L125 PetriNetUnfolderBase]: For 4146/7692 co-relation queries the response was YES. [2023-11-30 04:47:40,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66372 conditions, 20915 events. 10538/20915 cut-off events. For 4146/7692 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 200628 event pairs, 3002 based on Foata normal form. 0/12552 useless extension candidates. Maximal degree in co-relation 66280. Up to 11676 conditions per place. [2023-11-30 04:47:40,333 INFO L140 encePairwiseOnDemand]: 174/197 looper letters, 101 selfloop transitions, 19 changer transitions 0/217 dead transitions. [2023-11-30 04:47:40,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 217 transitions, 1145 flow [2023-11-30 04:47:40,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 04:47:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 04:47:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-11-30 04:47:40,336 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6243654822335025 [2023-11-30 04:47:40,336 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-11-30 04:47:40,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-11-30 04:47:40,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:40,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-11-30 04:47:40,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 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:47:40,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 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:47:40,342 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 0 states have call successors, (0), 0 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:47:40,343 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -32 predicate places. [2023-11-30 04:47:40,343 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 217 transitions, 1145 flow [2023-11-30 04:47:40,344 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:40,344 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:40,344 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] [2023-11-30 04:47:40,344 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:47:40,344 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:40,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:40,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1334224859, now seen corresponding path program 1 times [2023-11-30 04:47:40,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:40,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211931724] [2023-11-30 04:47:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:40,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:40,528 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:47:40,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211931724] [2023-11-30 04:47:40,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211931724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:40,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:40,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:47:40,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383673132] [2023-11-30 04:47:40,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:40,530 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:47:40,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:47:40,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:47:40,535 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 197 [2023-11-30 04:47:40,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 217 transitions, 1145 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:40,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:40,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 197 [2023-11-30 04:47:40,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:41,514 INFO L124 PetriNetUnfolderBase]: 2293/5544 cut-off events. [2023-11-30 04:47:41,514 INFO L125 PetriNetUnfolderBase]: For 2634/3264 co-relation queries the response was YES. [2023-11-30 04:47:41,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18827 conditions, 5544 events. 2293/5544 cut-off events. For 2634/3264 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 49309 event pairs, 319 based on Foata normal form. 0/4472 useless extension candidates. Maximal degree in co-relation 18726. Up to 3292 conditions per place. [2023-11-30 04:47:41,548 INFO L140 encePairwiseOnDemand]: 184/197 looper letters, 64 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2023-11-30 04:47:41,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 933 flow [2023-11-30 04:47:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:47:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:47:41,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-11-30 04:47:41,555 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6154822335025381 [2023-11-30 04:47:41,555 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-11-30 04:47:41,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-11-30 04:47:41,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:41,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-11-30 04:47:41,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 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:47:41,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:47:41,565 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:47:41,567 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -40 predicate places. [2023-11-30 04:47:41,567 INFO L500 AbstractCegarLoop]: Abstraction has has 161 places, 174 transitions, 933 flow [2023-11-30 04:47:41,567 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:41,567 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:41,568 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:47:41,568 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:47:41,568 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:41,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:41,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1087911293, now seen corresponding path program 1 times [2023-11-30 04:47:41,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:41,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220590727] [2023-11-30 04:47:41,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:41,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:41,677 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:47:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:41,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220590727] [2023-11-30 04:47:41,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220590727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:41,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:41,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:41,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809398103] [2023-11-30 04:47:41,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:41,679 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:41,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:41,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:41,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:41,681 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:47:41,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 174 transitions, 933 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:47:41,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:41,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:47:41,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:43,042 INFO L124 PetriNetUnfolderBase]: 2746/6081 cut-off events. [2023-11-30 04:47:43,042 INFO L125 PetriNetUnfolderBase]: For 7305/8197 co-relation queries the response was YES. [2023-11-30 04:47:43,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25045 conditions, 6081 events. 2746/6081 cut-off events. For 7305/8197 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 52362 event pairs, 240 based on Foata normal form. 2/4822 useless extension candidates. Maximal degree in co-relation 24936. Up to 3746 conditions per place. [2023-11-30 04:47:43,113 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 89 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-11-30 04:47:43,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 194 transitions, 1319 flow [2023-11-30 04:47:43,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-30 04:47:43,116 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6294416243654822 [2023-11-30 04:47:43,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-30 04:47:43,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-30 04:47:43,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:43,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-30 04:47:43,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:47:43,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:43,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:43,120 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -39 predicate places. [2023-11-30 04:47:43,120 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 194 transitions, 1319 flow [2023-11-30 04:47:43,120 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:47:43,121 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:43,121 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:47:43,121 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:47:43,121 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:43,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1087911292, now seen corresponding path program 1 times [2023-11-30 04:47:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:43,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128066180] [2023-11-30 04:47:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:43,198 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:47:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:43,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128066180] [2023-11-30 04:47:43,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128066180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:43,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:43,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:43,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238937619] [2023-11-30 04:47:43,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:43,201 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:43,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:43,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:43,202 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 197 [2023-11-30 04:47:43,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 194 transitions, 1319 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:47:43,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:43,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 197 [2023-11-30 04:47:43,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:44,317 INFO L124 PetriNetUnfolderBase]: 2745/6173 cut-off events. [2023-11-30 04:47:44,317 INFO L125 PetriNetUnfolderBase]: For 9472/10828 co-relation queries the response was YES. [2023-11-30 04:47:44,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29269 conditions, 6173 events. 2745/6173 cut-off events. For 9472/10828 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 53473 event pairs, 240 based on Foata normal form. 2/4914 useless extension candidates. Maximal degree in co-relation 29151. Up to 3750 conditions per place. [2023-11-30 04:47:44,360 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 92 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2023-11-30 04:47:44,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 193 transitions, 1499 flow [2023-11-30 04:47:44,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-30 04:47:44,362 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6040609137055838 [2023-11-30 04:47:44,362 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-30 04:47:44,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-30 04:47:44,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:44,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-30 04:47:44,363 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:47:44,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:44,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:44,365 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -38 predicate places. [2023-11-30 04:47:44,365 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 193 transitions, 1499 flow [2023-11-30 04:47:44,366 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:47:44,366 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:44,366 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:47:44,366 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:47:44,366 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:44,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1085166343, now seen corresponding path program 1 times [2023-11-30 04:47:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760828774] [2023-11-30 04:47:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:44,453 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:47:44,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:44,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760828774] [2023-11-30 04:47:44,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760828774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:44,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:44,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:44,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273953250] [2023-11-30 04:47:44,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:44,458 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:44,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:44,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:44,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:44,460 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 197 [2023-11-30 04:47:44,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 193 transitions, 1499 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:47:44,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:44,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 197 [2023-11-30 04:47:44,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:45,873 INFO L124 PetriNetUnfolderBase]: 3192/6707 cut-off events. [2023-11-30 04:47:45,873 INFO L125 PetriNetUnfolderBase]: For 19587/20019 co-relation queries the response was YES. [2023-11-30 04:47:45,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36784 conditions, 6707 events. 3192/6707 cut-off events. For 19587/20019 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 56905 event pairs, 144 based on Foata normal form. 6/5273 useless extension candidates. Maximal degree in co-relation 36658. Up to 4204 conditions per place. [2023-11-30 04:47:45,926 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 111 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2023-11-30 04:47:45,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 215 transitions, 2039 flow [2023-11-30 04:47:45,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:45,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-11-30 04:47:45,928 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6277495769881557 [2023-11-30 04:47:45,928 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-11-30 04:47:45,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-11-30 04:47:45,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:45,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-11-30 04:47:45,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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:47:45,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:45,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:45,930 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -37 predicate places. [2023-11-30 04:47:45,930 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 215 transitions, 2039 flow [2023-11-30 04:47:45,931 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:47:45,931 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:45,931 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:47:45,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:47:45,931 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:45,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1085166344, now seen corresponding path program 1 times [2023-11-30 04:47:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452039052] [2023-11-30 04:47:45,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:45,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452039052] [2023-11-30 04:47:45,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452039052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:45,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:45,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:45,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924191687] [2023-11-30 04:47:45,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:45,987 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:45,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:45,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:45,988 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 197 [2023-11-30 04:47:45,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 215 transitions, 2039 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:47:45,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:45,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 197 [2023-11-30 04:47:45,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:47,166 INFO L124 PetriNetUnfolderBase]: 3185/6694 cut-off events. [2023-11-30 04:47:47,166 INFO L125 PetriNetUnfolderBase]: For 24970/25474 co-relation queries the response was YES. [2023-11-30 04:47:47,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41275 conditions, 6694 events. 3185/6694 cut-off events. For 24970/25474 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 56881 event pairs, 144 based on Foata normal form. 6/5260 useless extension candidates. Maximal degree in co-relation 41140. Up to 4219 conditions per place. [2023-11-30 04:47:47,249 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 114 selfloop transitions, 2 changer transitions 0/214 dead transitions. [2023-11-30 04:47:47,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 214 transitions, 2261 flow [2023-11-30 04:47:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:47,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-11-30 04:47:47,265 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6023688663282571 [2023-11-30 04:47:47,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-11-30 04:47:47,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-11-30 04:47:47,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:47,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-11-30 04:47:47,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:47,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:47,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:47,274 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -36 predicate places. [2023-11-30 04:47:47,274 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 214 transitions, 2261 flow [2023-11-30 04:47:47,275 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:47:47,275 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:47,275 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:47:47,276 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:47:47,276 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:47,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:47,276 INFO L85 PathProgramCache]: Analyzing trace with hash -234937139, now seen corresponding path program 1 times [2023-11-30 04:47:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361553246] [2023-11-30 04:47:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:47,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:47:47,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:47,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361553246] [2023-11-30 04:47:47,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361553246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:47,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:47,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:47:47,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307563243] [2023-11-30 04:47:47,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:47,496 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:47:47,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:47,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:47:47,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:47:47,498 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 197 [2023-11-30 04:47:47,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 214 transitions, 2261 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:47,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:47,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 197 [2023-11-30 04:47:47,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:49,046 INFO L124 PetriNetUnfolderBase]: 3127/6728 cut-off events. [2023-11-30 04:47:49,046 INFO L125 PetriNetUnfolderBase]: For 31444/32020 co-relation queries the response was YES. [2023-11-30 04:47:49,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44110 conditions, 6728 events. 3127/6728 cut-off events. For 31444/32020 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 58629 event pairs, 126 based on Foata normal form. 0/5312 useless extension candidates. Maximal degree in co-relation 43972. Up to 4219 conditions per place. [2023-11-30 04:47:49,115 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 165 selfloop transitions, 12 changer transitions 0/293 dead transitions. [2023-11-30 04:47:49,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 293 transitions, 4043 flow [2023-11-30 04:47:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:47:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:47:49,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-11-30 04:47:49,117 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6920473773265652 [2023-11-30 04:47:49,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-11-30 04:47:49,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-11-30 04:47:49,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:49,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-11-30 04:47:49,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:49,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:49,120 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 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:47:49,121 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -34 predicate places. [2023-11-30 04:47:49,121 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 293 transitions, 4043 flow [2023-11-30 04:47:49,121 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:49,121 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:49,121 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:47:49,121 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:47:49,122 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:49,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash 292089244, now seen corresponding path program 1 times [2023-11-30 04:47:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:49,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944521846] [2023-11-30 04:47:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:49,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:49,419 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:47:49,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:49,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944521846] [2023-11-30 04:47:49,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944521846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:49,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:49,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:47:49,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823821284] [2023-11-30 04:47:49,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:49,421 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:47:49,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:49,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:47:49,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:47:49,423 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 197 [2023-11-30 04:47:49,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 293 transitions, 4043 flow. Second operand has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 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:47:49,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:49,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 197 [2023-11-30 04:47:49,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:50,696 INFO L124 PetriNetUnfolderBase]: 3093/6570 cut-off events. [2023-11-30 04:47:50,696 INFO L125 PetriNetUnfolderBase]: For 40670/41318 co-relation queries the response was YES. [2023-11-30 04:47:50,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46852 conditions, 6570 events. 3093/6570 cut-off events. For 40670/41318 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 56552 event pairs, 108 based on Foata normal form. 0/5178 useless extension candidates. Maximal degree in co-relation 46704. Up to 4219 conditions per place. [2023-11-30 04:47:50,753 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 178 selfloop transitions, 12 changer transitions 0/295 dead transitions. [2023-11-30 04:47:50,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 295 transitions, 4455 flow [2023-11-30 04:47:50,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:47:50,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:47:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-11-30 04:47:50,755 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6205583756345178 [2023-11-30 04:47:50,755 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-11-30 04:47:50,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-11-30 04:47:50,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:50,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-11-30 04:47:50,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 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:47:50,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:47:50,758 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 197.0) internal successors, (985), 5 states have internal predecessors, (985), 0 states have call successors, (0), 0 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:47:50,759 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -33 predicate places. [2023-11-30 04:47:50,759 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 295 transitions, 4455 flow [2023-11-30 04:47:50,759 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 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:47:50,759 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:50,760 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:50,760 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:47:50,760 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:50,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:50,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1034406581, now seen corresponding path program 1 times [2023-11-30 04:47:50,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:50,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608470339] [2023-11-30 04:47:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:50,975 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:47:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608470339] [2023-11-30 04:47:50,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608470339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:50,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:50,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 04:47:50,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123457608] [2023-11-30 04:47:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:50,976 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 04:47:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 04:47:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 04:47:50,978 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 197 [2023-11-30 04:47:50,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 295 transitions, 4455 flow. Second operand has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:50,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:50,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 197 [2023-11-30 04:47:50,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:52,092 INFO L124 PetriNetUnfolderBase]: 2363/5193 cut-off events. [2023-11-30 04:47:52,092 INFO L125 PetriNetUnfolderBase]: For 42783/43503 co-relation queries the response was YES. [2023-11-30 04:47:52,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39874 conditions, 5193 events. 2363/5193 cut-off events. For 42783/43503 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 43342 event pairs, 108 based on Foata normal form. 0/4185 useless extension candidates. Maximal degree in co-relation 39715. Up to 3288 conditions per place. [2023-11-30 04:47:52,143 INFO L140 encePairwiseOnDemand]: 177/197 looper letters, 166 selfloop transitions, 41 changer transitions 0/302 dead transitions. [2023-11-30 04:47:52,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 302 transitions, 5023 flow [2023-11-30 04:47:52,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 04:47:52,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 04:47:52,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 685 transitions. [2023-11-30 04:47:52,156 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5795262267343486 [2023-11-30 04:47:52,156 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 685 transitions. [2023-11-30 04:47:52,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 685 transitions. [2023-11-30 04:47:52,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:52,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 685 transitions. [2023-11-30 04:47:52,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.16666666666667) internal successors, (685), 6 states have internal predecessors, (685), 0 states have call successors, (0), 0 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:47:52,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 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:47:52,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 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:47:52,161 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -28 predicate places. [2023-11-30 04:47:52,161 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 302 transitions, 5023 flow [2023-11-30 04:47:52,161 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.85714285714286) internal successors, (734), 7 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:52,161 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:52,162 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:47:52,162 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:47:52,162 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:52,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash 669460758, now seen corresponding path program 1 times [2023-11-30 04:47:52,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:52,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67936652] [2023-11-30 04:47:52,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:52,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:52,576 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:47:52,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:52,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67936652] [2023-11-30 04:47:52,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67936652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:52,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:52,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:47:52,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625948596] [2023-11-30 04:47:52,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:52,577 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:47:52,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:52,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:47:52,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:47:52,579 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 197 [2023-11-30 04:47:52,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 302 transitions, 5023 flow. Second operand has 11 states, 11 states have (on average 101.0909090909091) internal successors, (1112), 11 states have internal predecessors, (1112), 0 states have call successors, (0), 0 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:47:52,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:52,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 197 [2023-11-30 04:47:52,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:53,675 INFO L124 PetriNetUnfolderBase]: 1633/3917 cut-off events. [2023-11-30 04:47:53,676 INFO L125 PetriNetUnfolderBase]: For 36291/37083 co-relation queries the response was YES. [2023-11-30 04:47:53,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31384 conditions, 3917 events. 1633/3917 cut-off events. For 36291/37083 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 31742 event pairs, 96 based on Foata normal form. 0/3299 useless extension candidates. Maximal degree in co-relation 31213. Up to 2357 conditions per place. [2023-11-30 04:47:53,710 INFO L140 encePairwiseOnDemand]: 174/197 looper letters, 225 selfloop transitions, 77 changer transitions 0/395 dead transitions. [2023-11-30 04:47:53,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 395 transitions, 7750 flow [2023-11-30 04:47:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 04:47:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 04:47:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1607 transitions. [2023-11-30 04:47:53,714 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.543824027072758 [2023-11-30 04:47:53,714 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1607 transitions. [2023-11-30 04:47:53,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1607 transitions. [2023-11-30 04:47:53,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:53,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1607 transitions. [2023-11-30 04:47:53,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 107.13333333333334) internal successors, (1607), 15 states have internal predecessors, (1607), 0 states have call successors, (0), 0 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:47:53,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 197.0) internal successors, (3152), 16 states have internal predecessors, (3152), 0 states have call successors, (0), 0 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:47:53,723 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 197.0) internal successors, (3152), 16 states have internal predecessors, (3152), 0 states have call successors, (0), 0 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:47:53,723 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -14 predicate places. [2023-11-30 04:47:53,723 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 395 transitions, 7750 flow [2023-11-30 04:47:53,724 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 101.0909090909091) internal successors, (1112), 11 states have internal predecessors, (1112), 0 states have call successors, (0), 0 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:47:53,724 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:47:53,724 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:47:53,724 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:47:53,724 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 104 more)] === [2023-11-30 04:47:53,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:47:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash -347799970, now seen corresponding path program 1 times [2023-11-30 04:47:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:47:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682468686] [2023-11-30 04:47:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:47:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:47:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:47:54,248 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:47:54,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:47:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682468686] [2023-11-30 04:47:54,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682468686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:47:54,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:47:54,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-30 04:47:54,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896491869] [2023-11-30 04:47:54,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:47:54,249 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-30 04:47:54,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:47:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-30 04:47:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-30 04:47:54,252 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 197 [2023-11-30 04:47:54,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 395 transitions, 7750 flow. Second operand has 11 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:54,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:47:54,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 197 [2023-11-30 04:47:54,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:47:54,793 INFO L124 PetriNetUnfolderBase]: 739/1740 cut-off events. [2023-11-30 04:47:54,793 INFO L125 PetriNetUnfolderBase]: For 19081/20197 co-relation queries the response was YES. [2023-11-30 04:47:54,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15030 conditions, 1740 events. 739/1740 cut-off events. For 19081/20197 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 9995 event pairs, 12 based on Foata normal form. 0/1701 useless extension candidates. Maximal degree in co-relation 14848. Up to 862 conditions per place. [2023-11-30 04:47:54,801 INFO L140 encePairwiseOnDemand]: 181/197 looper letters, 0 selfloop transitions, 0 changer transitions 351/351 dead transitions. [2023-11-30 04:47:54,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 351 transitions, 7122 flow [2023-11-30 04:47:54,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 04:47:54,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 04:47:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 951 transitions. [2023-11-30 04:47:54,805 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5363790186125211 [2023-11-30 04:47:54,805 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 951 transitions. [2023-11-30 04:47:54,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 951 transitions. [2023-11-30 04:47:54,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:47:54,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 951 transitions. [2023-11-30 04:47:54,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 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:47:54,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 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:47:54,810 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 197.0) internal successors, (1970), 10 states have internal predecessors, (1970), 0 states have call successors, (0), 0 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:47:54,810 INFO L307 CegarLoopForPetriNet]: 201 programPoint places, -14 predicate places. [2023-11-30 04:47:54,810 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 351 transitions, 7122 flow [2023-11-30 04:47:54,811 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.18181818181819) internal successors, (1102), 11 states have internal predecessors, (1102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:47:54,828 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe002_power.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:47:54,862 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 107 remaining) [2023-11-30 04:47:54,862 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 107 remaining) [2023-11-30 04:47:54,862 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 107 remaining) [2023-11-30 04:47:54,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 107 remaining) [2023-11-30 04:47:54,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 107 remaining) [2023-11-30 04:47:54,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 107 remaining) [2023-11-30 04:47:54,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 107 remaining) [2023-11-30 04:47:54,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 107 remaining) [2023-11-30 04:47:54,863 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 107 remaining) [2023-11-30 04:47:54,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 107 remaining) [2023-11-30 04:47:54,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 107 remaining) [2023-11-30 04:47:54,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 107 remaining) [2023-11-30 04:47:54,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 107 remaining) [2023-11-30 04:47:54,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 107 remaining) [2023-11-30 04:47:54,864 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 107 remaining) [2023-11-30 04:47:54,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 107 remaining) [2023-11-30 04:47:54,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 107 remaining) [2023-11-30 04:47:54,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 107 remaining) [2023-11-30 04:47:54,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 107 remaining) [2023-11-30 04:47:54,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 107 remaining) [2023-11-30 04:47:54,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 107 remaining) [2023-11-30 04:47:54,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 107 remaining) [2023-11-30 04:47:54,865 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 107 remaining) [2023-11-30 04:47:54,866 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 107 remaining) [2023-11-30 04:47:54,867 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 107 remaining) [2023-11-30 04:47:54,868 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 107 remaining) [2023-11-30 04:47:54,869 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 107 remaining) [2023-11-30 04:47:54,870 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 107 remaining) [2023-11-30 04:47:54,871 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 107 remaining) [2023-11-30 04:47:54,872 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 107 remaining) [2023-11-30 04:47:54,873 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 107 remaining) [2023-11-30 04:47:54,874 INFO L810 garLoopResultBuilder]: Registering result SAFE for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 107 remaining) [2023-11-30 04:47:54,875 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:47:54,875 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:47:54,880 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:47:54,880 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:47:54,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:47:54 BasicIcfg [2023-11-30 04:47:54,886 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:47:54,886 INFO L158 Benchmark]: Toolchain (without parser) took 33280.43ms. Allocated memory was 471.9MB in the beginning and 8.9GB in the end (delta: 8.4GB). Free memory was 420.8MB in the beginning and 5.9GB in the end (delta: -5.5GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-11-30 04:47:54,886 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 308.3MB. Free memory is still 254.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:47:54,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.74ms. Allocated memory is still 471.9MB. Free memory was 420.6MB in the beginning and 393.9MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 04:47:54,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.45ms. Allocated memory is still 471.9MB. Free memory was 393.9MB in the beginning and 391.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:47:54,887 INFO L158 Benchmark]: Boogie Preprocessor took 59.86ms. Allocated memory is still 471.9MB. Free memory was 390.9MB in the beginning and 388.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:47:54,887 INFO L158 Benchmark]: RCFGBuilder took 1392.21ms. Allocated memory is still 471.9MB. Free memory was 388.4MB in the beginning and 368.2MB in the end (delta: 20.2MB). Peak memory consumption was 82.8MB. Max. memory is 16.0GB. [2023-11-30 04:47:54,888 INFO L158 Benchmark]: TraceAbstraction took 31152.81ms. Allocated memory was 471.9MB in the beginning and 8.9GB in the end (delta: 8.4GB). Free memory was 367.2MB in the beginning and 5.9GB in the end (delta: -5.5GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-11-30 04:47:54,889 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 308.3MB. Free memory is still 254.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 592.74ms. Allocated memory is still 471.9MB. Free memory was 420.6MB in the beginning and 393.9MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 76.45ms. Allocated memory is still 471.9MB. Free memory was 393.9MB in the beginning and 391.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 59.86ms. Allocated memory is still 471.9MB. Free memory was 390.9MB in the beginning and 388.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1392.21ms. Allocated memory is still 471.9MB. Free memory was 388.4MB in the beginning and 368.2MB in the end (delta: 20.2MB). Peak memory consumption was 82.8MB. Max. memory is 16.0GB. * TraceAbstraction took 31152.81ms. Allocated memory was 471.9MB in the beginning and 8.9GB in the end (delta: 8.4GB). Free memory was 367.2MB in the beginning and 5.9GB in the end (delta: -5.5GB). Peak memory consumption was 2.9GB. 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 - 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, 262 locations, 107 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: 31.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 605 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1193 IncrementalHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 121 mSDtfsCounter, 1193 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7750occurred in iteration=12, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 957 NumberOfCodeBlocks, 957 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 944 ConstructedInterpolants, 0 QuantifiedInterpolants, 4138 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 64 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:47:54,904 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...