/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/weaver/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:35:14,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:35:14,797 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 05:35:14,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:35:14,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:35:14,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:35:14,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:35:14,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:35:14,822 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:35:14,824 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:35:14,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:35:14,825 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:35:14,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:35:14,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:35:14,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:35:14,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:35:14,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:35:14,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:35:14,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:35:14,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:35:14,827 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:35:14,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:35:14,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:35:14,828 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:35:14,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:35:14,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:35:14,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:35:14,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:35:14,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:35:14,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:35:14,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:35:14,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:35:14,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:35:14,829 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 05:35:15,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:35:15,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:35:15,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:35:15,061 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:35:15,062 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:35:15,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-11-30 05:35:16,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:35:16,216 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:35:16,217 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-11-30 05:35:16,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75cf7326d/ea4862c485254b72bb3b627e10a2af09/FLAGf94617f3b [2023-11-30 05:35:16,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75cf7326d/ea4862c485254b72bb3b627e10a2af09 [2023-11-30 05:35:16,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:35:16,238 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:35:16,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:35:16,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:35:16,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:35:16,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5683305d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16, skipping insertion in model container [2023-11-30 05:35:16,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:35:16,381 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:35:16,390 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:35:16,414 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:35:16,421 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:35:16,421 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:35:16,425 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:35:16,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16 WrapperNode [2023-11-30 05:35:16,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:35:16,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:35:16,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:35:16,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:35:16,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,457 INFO L138 Inliner]: procedures = 25, calls = 101, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 295 [2023-11-30 05:35:16,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:35:16,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:35:16,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:35:16,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:35:16,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:35:16,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:35:16,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:35:16,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:35:16,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (1/1) ... [2023-11-30 05:35:16,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:35:16,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:35:16,517 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 05:35:16,525 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 05:35:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:35:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:35:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:35:16,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:35:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 05:35:16,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 05:35:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 05:35:16,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 05:35:16,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 05:35:16,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 05:35:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 05:35:16,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 05:35:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:35:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-30 05:35:16,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-30 05:35:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-30 05:35:16,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-30 05:35:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 05:35:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 05:35:16,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:35:16,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:35:16,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:35:16,548 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 05:35:16,654 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:35:16,655 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:35:16,916 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:35:16,978 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:35:16,978 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 05:35:16,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:35:16 BoogieIcfgContainer [2023-11-30 05:35:16,979 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:35:16,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:35:16,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:35:16,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:35:16,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:35:16" (1/3) ... [2023-11-30 05:35:16,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42225ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:35:16, skipping insertion in model container [2023-11-30 05:35:16,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:35:16" (2/3) ... [2023-11-30 05:35:16,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42225ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:35:16, skipping insertion in model container [2023-11-30 05:35:16,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:35:16" (3/3) ... [2023-11-30 05:35:16,985 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-11-30 05:35:16,996 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:35:16,996 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-30 05:35:16,996 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:35:17,125 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-11-30 05:35:17,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 226 transitions, 494 flow [2023-11-30 05:35:17,221 INFO L124 PetriNetUnfolderBase]: 2/220 cut-off events. [2023-11-30 05:35:17,222 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:35:17,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 220 events. 2/220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 182 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 162. Up to 2 conditions per place. [2023-11-30 05:35:17,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 226 transitions, 494 flow [2023-11-30 05:35:17,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 189 transitions, 411 flow [2023-11-30 05:35:17,239 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:35:17,245 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;@4ac71598, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:35:17,245 INFO L363 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-11-30 05:35:17,265 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:35:17,265 INFO L124 PetriNetUnfolderBase]: 1/74 cut-off events. [2023-11-30 05:35:17,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:35:17,265 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:17,266 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] [2023-11-30 05:35:17,266 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:35:17,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:17,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1879166301, now seen corresponding path program 1 times [2023-11-30 05:35:17,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:17,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008684619] [2023-11-30 05:35:17,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:17,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:17,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 05:35:17,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008684619] [2023-11-30 05:35:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008684619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:17,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:17,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:17,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619112195] [2023-11-30 05:35:17,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:17,983 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:17,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:18,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:18,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:18,004 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 226 [2023-11-30 05:35:18,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 189 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:18,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:18,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 226 [2023-11-30 05:35:18,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:29,071 INFO L124 PetriNetUnfolderBase]: 79872/120548 cut-off events. [2023-11-30 05:35:29,071 INFO L125 PetriNetUnfolderBase]: For 3923/3923 co-relation queries the response was YES. [2023-11-30 05:35:29,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225002 conditions, 120548 events. 79872/120548 cut-off events. For 3923/3923 co-relation queries the response was YES. Maximal size of possible extension queue 4263. Compared 993073 event pairs, 79872 based on Foata normal form. 1/113044 useless extension candidates. Maximal degree in co-relation 183968. Up to 100348 conditions per place. [2023-11-30 05:35:30,317 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 61 selfloop transitions, 1 changer transitions 1/186 dead transitions. [2023-11-30 05:35:30,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 186 transitions, 529 flow [2023-11-30 05:35:30,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:30,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-11-30 05:35:30,327 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7551622418879056 [2023-11-30 05:35:30,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-11-30 05:35:30,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-11-30 05:35:30,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:30,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-11-30 05:35:30,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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 05:35:30,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:35:30,335 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:35:30,339 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2023-11-30 05:35:30,340 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 186 transitions, 529 flow [2023-11-30 05:35:30,340 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:30,340 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:30,340 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] [2023-11-30 05:35:30,340 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:35:30,341 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:35:30,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:30,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1879166302, now seen corresponding path program 1 times [2023-11-30 05:35:30,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:30,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447026149] [2023-11-30 05:35:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:30,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:30,908 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 05:35:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:30,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447026149] [2023-11-30 05:35:30,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447026149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:30,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:30,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 05:35:30,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311825476] [2023-11-30 05:35:30,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:30,911 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 05:35:30,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:30,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 05:35:30,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-30 05:35:30,913 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 226 [2023-11-30 05:35:30,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 186 transitions, 529 flow. Second operand has 5 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 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 05:35:30,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:30,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 226 [2023-11-30 05:35:30,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:41,880 INFO L124 PetriNetUnfolderBase]: 70998/106552 cut-off events. [2023-11-30 05:35:41,880 INFO L125 PetriNetUnfolderBase]: For 18175/20223 co-relation queries the response was YES. [2023-11-30 05:35:42,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288145 conditions, 106552 events. 70998/106552 cut-off events. For 18175/20223 co-relation queries the response was YES. Maximal size of possible extension queue 3335. Compared 855152 event pairs, 70998 based on Foata normal form. 0/102462 useless extension candidates. Maximal degree in co-relation 212977. Up to 90105 conditions per place. [2023-11-30 05:35:42,812 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 69 selfloop transitions, 1 changer transitions 1/184 dead transitions. [2023-11-30 05:35:42,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 184 transitions, 661 flow [2023-11-30 05:35:42,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:42,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2023-11-30 05:35:42,814 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7212389380530974 [2023-11-30 05:35:42,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2023-11-30 05:35:42,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2023-11-30 05:35:42,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:42,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2023-11-30 05:35:42,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.0) internal successors, (489), 3 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 05:35:42,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:35:42,818 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:35:42,818 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2023-11-30 05:35:42,818 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 184 transitions, 661 flow [2023-11-30 05:35:42,819 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 0 states have call successors, (0), 0 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 05:35:42,819 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:42,819 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] [2023-11-30 05:35:42,819 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:35:42,819 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:35:42,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:42,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1567383702, now seen corresponding path program 1 times [2023-11-30 05:35:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381387731] [2023-11-30 05:35:42,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:42,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:35:43,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:43,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381387731] [2023-11-30 05:35:43,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381387731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:43,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:43,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:35:43,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885783476] [2023-11-30 05:35:43,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:43,060 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:35:43,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:43,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:35:43,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:35:43,061 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 226 [2023-11-30 05:35:43,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 184 transitions, 661 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:43,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:43,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 226 [2023-11-30 05:35:43,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:52,141 INFO L124 PetriNetUnfolderBase]: 63312/96802 cut-off events. [2023-11-30 05:35:52,141 INFO L125 PetriNetUnfolderBase]: For 33101/39243 co-relation queries the response was YES. [2023-11-30 05:35:52,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340307 conditions, 96802 events. 63312/96802 cut-off events. For 33101/39243 co-relation queries the response was YES. Maximal size of possible extension queue 3325. Compared 794199 event pairs, 63312 based on Foata normal form. 1026/94768 useless extension candidates. Maximal degree in co-relation 278449. Up to 80363 conditions per place. [2023-11-30 05:35:53,306 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 65 selfloop transitions, 1 changer transitions 1/180 dead transitions. [2023-11-30 05:35:53,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 180 transitions, 773 flow [2023-11-30 05:35:53,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:53,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-11-30 05:35:53,308 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7182890855457227 [2023-11-30 05:35:53,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-11-30 05:35:53,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-11-30 05:35:53,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:53,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-11-30 05:35:53,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 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 05:35:53,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:35:53,311 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:35:53,311 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, -2 predicate places. [2023-11-30 05:35:53,311 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 180 transitions, 773 flow [2023-11-30 05:35:53,312 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:53,312 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:53,312 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] [2023-11-30 05:35:53,312 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:35:53,312 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:35:53,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash 689864349, now seen corresponding path program 1 times [2023-11-30 05:35:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:53,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64514712] [2023-11-30 05:35:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:53,486 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 05:35:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64514712] [2023-11-30 05:35:53,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64514712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:35:53,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16040147] [2023-11-30 05:35:53,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:53,488 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:35:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:35:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:35:53,493 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 226 [2023-11-30 05:35:53,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 180 transitions, 773 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 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 05:35:53,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:53,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 226 [2023-11-30 05:35:53,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:03,443 INFO L124 PetriNetUnfolderBase]: 61728/94650 cut-off events. [2023-11-30 05:36:03,444 INFO L125 PetriNetUnfolderBase]: For 58544/68768 co-relation queries the response was YES. [2023-11-30 05:36:03,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410283 conditions, 94650 events. 61728/94650 cut-off events. For 58544/68768 co-relation queries the response was YES. Maximal size of possible extension queue 3325. Compared 781710 event pairs, 61728 based on Foata normal form. 264/92134 useless extension candidates. Maximal degree in co-relation 343559. Up to 78235 conditions per place. [2023-11-30 05:36:04,350 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 61 selfloop transitions, 1 changer transitions 1/176 dead transitions. [2023-11-30 05:36:04,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 176 transitions, 869 flow [2023-11-30 05:36:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:36:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:36:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-11-30 05:36:04,351 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7123893805309734 [2023-11-30 05:36:04,351 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-11-30 05:36:04,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-11-30 05:36:04,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:04,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-11-30 05:36:04,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:36:04,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:04,354 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:04,355 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, -4 predicate places. [2023-11-30 05:36:04,356 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 176 transitions, 869 flow [2023-11-30 05:36:04,356 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 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 05:36:04,356 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:04,356 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] [2023-11-30 05:36:04,356 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:36:04,356 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:36:04,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1180841505, now seen corresponding path program 1 times [2023-11-30 05:36:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:04,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794200508] [2023-11-30 05:36:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:04,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:04,513 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 05:36:04,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:04,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794200508] [2023-11-30 05:36:04,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794200508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:04,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:04,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:36:04,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317463355] [2023-11-30 05:36:04,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:04,515 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:36:04,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:04,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:36:04,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:36:04,516 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 226 [2023-11-30 05:36:04,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 176 transitions, 869 flow. Second operand has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 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 05:36:04,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:04,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 226 [2023-11-30 05:36:04,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:16,928 INFO L124 PetriNetUnfolderBase]: 61152/93722 cut-off events. [2023-11-30 05:36:16,929 INFO L125 PetriNetUnfolderBase]: For 93244/107484 co-relation queries the response was YES. [2023-11-30 05:36:17,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483563 conditions, 93722 events. 61152/93722 cut-off events. For 93244/107484 co-relation queries the response was YES. Maximal size of possible extension queue 3325. Compared 774422 event pairs, 61152 based on Foata normal form. 96/91198 useless extension candidates. Maximal degree in co-relation 406469. Up to 77403 conditions per place. [2023-11-30 05:36:18,547 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 57 selfloop transitions, 1 changer transitions 1/172 dead transitions. [2023-11-30 05:36:18,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 172 transitions, 949 flow [2023-11-30 05:36:18,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:36:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:36:18,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-11-30 05:36:18,549 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7064896755162242 [2023-11-30 05:36:18,549 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-11-30 05:36:18,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-11-30 05:36:18,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:18,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-11-30 05:36:18,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:36:18,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:18,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:18,553 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-11-30 05:36:18,553 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 172 transitions, 949 flow [2023-11-30 05:36:18,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 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 05:36:18,554 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:18,554 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:36:18,554 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:36:18,554 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:36:18,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash -167408325, now seen corresponding path program 1 times [2023-11-30 05:36:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:18,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955696713] [2023-11-30 05:36:18,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:18,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:18,679 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 05:36:18,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955696713] [2023-11-30 05:36:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955696713] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:18,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:18,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:36:18,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642649712] [2023-11-30 05:36:18,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:18,680 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:36:18,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:18,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:36:18,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:36:18,681 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 226 [2023-11-30 05:36:18,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 172 transitions, 949 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 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 05:36:18,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:18,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 226 [2023-11-30 05:36:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:30,287 INFO L124 PetriNetUnfolderBase]: 60360/92466 cut-off events. [2023-11-30 05:36:30,288 INFO L125 PetriNetUnfolderBase]: For 135253/151637 co-relation queries the response was YES. [2023-11-30 05:36:30,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 552303 conditions, 92466 events. 60360/92466 cut-off events. For 135253/151637 co-relation queries the response was YES. Maximal size of possible extension queue 3324. Compared 762772 event pairs, 60360 based on Foata normal form. 0/90118 useless extension candidates. Maximal degree in co-relation 463107. Up to 76339 conditions per place. [2023-11-30 05:36:31,735 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 53 selfloop transitions, 1 changer transitions 1/170 dead transitions. [2023-11-30 05:36:31,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 170 transitions, 1033 flow [2023-11-30 05:36:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:36:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:36:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-11-30 05:36:31,736 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7418879056047197 [2023-11-30 05:36:31,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-11-30 05:36:31,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-11-30 05:36:31,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:31,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-11-30 05:36:31,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 05:36:31,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:31,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:31,763 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-11-30 05:36:31,763 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 170 transitions, 1033 flow [2023-11-30 05:36:31,763 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 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 05:36:31,763 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:31,763 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:36:31,764 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:36:31,764 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:36:31,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash -167408324, now seen corresponding path program 1 times [2023-11-30 05:36:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273324816] [2023-11-30 05:36:31,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:31,949 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 05:36:31,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:31,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273324816] [2023-11-30 05:36:31,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273324816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:31,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:31,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:36:31,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926165858] [2023-11-30 05:36:31,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:31,953 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:36:31,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:36:31,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:36:31,954 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 226 [2023-11-30 05:36:31,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 170 transitions, 1033 flow. Second operand has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:36:31,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:31,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 226 [2023-11-30 05:36:31,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:44,142 INFO L124 PetriNetUnfolderBase]: 59568/91210 cut-off events. [2023-11-30 05:36:44,142 INFO L125 PetriNetUnfolderBase]: For 198850/226882 co-relation queries the response was YES. [2023-11-30 05:36:44,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619186 conditions, 91210 events. 59568/91210 cut-off events. For 198850/226882 co-relation queries the response was YES. Maximal size of possible extension queue 3323. Compared 751087 event pairs, 59568 based on Foata normal form. 144/89646 useless extension candidates. Maximal degree in co-relation 517953. Up to 75275 conditions per place. [2023-11-30 05:36:45,248 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 50 selfloop transitions, 1 changer transitions 1/168 dead transitions. [2023-11-30 05:36:45,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 168 transitions, 1111 flow [2023-11-30 05:36:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:36:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:36:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-11-30 05:36:45,250 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7640117994100295 [2023-11-30 05:36:45,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-11-30 05:36:45,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-11-30 05:36:45,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:45,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-11-30 05:36:45,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 05:36:45,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:45,252 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:45,253 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-11-30 05:36:45,253 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 168 transitions, 1111 flow [2023-11-30 05:36:45,253 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:36:45,253 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:45,253 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:36:45,253 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 05:36:45,253 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:36:45,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:45,254 INFO L85 PathProgramCache]: Analyzing trace with hash 81628621, now seen corresponding path program 1 times [2023-11-30 05:36:45,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:45,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474750287] [2023-11-30 05:36:45,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:45,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:45,318 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 05:36:45,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:45,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474750287] [2023-11-30 05:36:45,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474750287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:45,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:45,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:36:45,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437971983] [2023-11-30 05:36:45,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:45,319 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:36:45,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:45,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:36:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:36:45,320 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 226 [2023-11-30 05:36:45,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 168 transitions, 1111 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 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 05:36:45,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:45,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 226 [2023-11-30 05:36:45,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:57,063 INFO L124 PetriNetUnfolderBase]: 55725/85571 cut-off events. [2023-11-30 05:36:57,063 INFO L125 PetriNetUnfolderBase]: For 250106/281338 co-relation queries the response was YES. [2023-11-30 05:36:57,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651914 conditions, 85571 events. 55725/85571 cut-off events. For 250106/281338 co-relation queries the response was YES. Maximal size of possible extension queue 3069. Compared 698582 event pairs, 55725 based on Foata normal form. 516/84891 useless extension candidates. Maximal degree in co-relation 538431. Up to 70404 conditions per place. [2023-11-30 05:36:58,547 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 50 selfloop transitions, 1 changer transitions 1/166 dead transitions. [2023-11-30 05:36:58,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 166 transitions, 1189 flow [2023-11-30 05:36:58,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:36:58,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:36:58,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-11-30 05:36:58,551 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7640117994100295 [2023-11-30 05:36:58,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-11-30 05:36:58,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-11-30 05:36:58,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:58,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-11-30 05:36:58,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 05:36:58,558 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:58,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:36:58,560 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-11-30 05:36:58,560 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 166 transitions, 1189 flow [2023-11-30 05:36:58,562 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 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 05:36:58,562 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:58,562 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:36:58,562 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:36:58,562 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 27 more)] === [2023-11-30 05:36:58,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash 81628620, now seen corresponding path program 1 times [2023-11-30 05:36:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:58,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660443012] [2023-11-30 05:36:58,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:58,664 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 05:36:58,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:58,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660443012] [2023-11-30 05:36:58,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660443012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:58,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:58,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:36:58,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714581126] [2023-11-30 05:36:58,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:58,665 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:36:58,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:58,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:36:58,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:36:58,665 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 226 [2023-11-30 05:36:58,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 166 transitions, 1189 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 05:36:58,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:58,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 226 [2023-11-30 05:36:58,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:37:10,583 INFO L124 PetriNetUnfolderBase]: 51882/79932 cut-off events. [2023-11-30 05:37:10,584 INFO L125 PetriNetUnfolderBase]: For 295791/322927 co-relation queries the response was YES. [2023-11-30 05:37:10,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673873 conditions, 79932 events. 51882/79932 cut-off events. For 295791/322927 co-relation queries the response was YES. Maximal size of possible extension queue 2857. Compared 645862 event pairs, 51882 based on Foata normal form. 516/79764 useless extension candidates. Maximal degree in co-relation 548157. Up to 65533 conditions per place. [2023-11-30 05:37:11,105 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 0 selfloop transitions, 0 changer transitions 164/164 dead transitions. [2023-11-30 05:37:11,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 164 transitions, 1257 flow [2023-11-30 05:37:11,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:37:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:37:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-11-30 05:37:11,106 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7359882005899705 [2023-11-30 05:37:11,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-11-30 05:37:11,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-11-30 05:37:11,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:37:11,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-11-30 05:37:11,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 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 05:37:11,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:37:11,109 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 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 05:37:11,109 INFO L307 CegarLoopForPetriNet]: 207 programPoint places, -6 predicate places. [2023-11-30 05:37:11,109 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 164 transitions, 1257 flow [2023-11-30 05:37:11,109 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 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 05:37:11,115 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-ticket-6.wvr.c_BEv2_AllErrorsAtOnce [2023-11-30 05:37:11,140 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 30 remaining) [2023-11-30 05:37:11,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 30 remaining) [2023-11-30 05:37:11,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 30 remaining) [2023-11-30 05:37:11,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 30 remaining) [2023-11-30 05:37:11,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 30 remaining) [2023-11-30 05:37:11,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 30 remaining) [2023-11-30 05:37:11,141 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 30 remaining) [2023-11-30 05:37:11,142 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 30 remaining) [2023-11-30 05:37:11,143 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 30 remaining) [2023-11-30 05:37:11,144 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 30 remaining) [2023-11-30 05:37:11,144 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:37:11,144 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:37:11,147 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 05:37:11,147 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 05:37:11,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 05:37:11 BasicIcfg [2023-11-30 05:37:11,153 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 05:37:11,154 INFO L158 Benchmark]: Toolchain (without parser) took 114916.01ms. Allocated memory was 683.7MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 629.0MB in the beginning and 11.1GB in the end (delta: -10.4GB). Peak memory consumption was 8.4GB. Max. memory is 16.0GB. [2023-11-30 05:37:11,154 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 404.8MB. Free memory was 353.3MB in the beginning and 353.2MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 05:37:11,155 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.69ms. Allocated memory is still 683.7MB. Free memory was 629.0MB in the beginning and 616.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 05:37:11,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.88ms. Allocated memory is still 683.7MB. Free memory was 616.5MB in the beginning and 614.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:37:11,157 INFO L158 Benchmark]: Boogie Preprocessor took 23.35ms. Allocated memory is still 683.7MB. Free memory was 614.0MB in the beginning and 611.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 05:37:11,158 INFO L158 Benchmark]: RCFGBuilder took 497.67ms. Allocated memory is still 683.7MB. Free memory was 611.9MB in the beginning and 577.8MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-11-30 05:37:11,158 INFO L158 Benchmark]: TraceAbstraction took 114172.44ms. Allocated memory was 683.7MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 577.0MB in the beginning and 11.1GB in the end (delta: -10.5GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-11-30 05:37:11,159 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.10ms. Allocated memory is still 404.8MB. Free memory was 353.3MB in the beginning and 353.2MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 187.69ms. Allocated memory is still 683.7MB. Free memory was 629.0MB in the beginning and 616.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.88ms. Allocated memory is still 683.7MB. Free memory was 616.5MB in the beginning and 614.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.35ms. Allocated memory is still 683.7MB. Free memory was 614.0MB in the beginning and 611.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 497.67ms. Allocated memory is still 683.7MB. Free memory was 611.9MB in the beginning and 577.8MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 114172.44ms. Allocated memory was 683.7MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 577.0MB in the beginning and 11.1GB in the end (delta: -10.5GB). Peak memory consumption was 8.3GB. 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 280 locations, 30 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: 114.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 111.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 528 IncrementalHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 67 mSDtfsCounter, 528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1257occurred in iteration=9, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 792 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 783 ConstructedInterpolants, 0 QuantifiedInterpolants, 4789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 05:37:11,176 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...