/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:06:50,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:06:50,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:06:50,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:06:50,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:06:50,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:06:50,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:06:50,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:06:50,310 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:06:50,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:06:50,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:06:50,310 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:06:50,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:06:50,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:06:50,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:06:50,311 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:06:50,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:06:50,312 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:06:50,312 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:06:50,312 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:06:50,312 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:06:50,324 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:06:50,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:06:50,325 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:06:50,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:06:50,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:06:50,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:06:50,325 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:06:50,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:06:50,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:06:50,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:06:50,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:06:50,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:06:50,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:06:50,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:06:50,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:06:50,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:06:50,547 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:06:50,548 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:06:50,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-12-05 21:06:51,552 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:06:51,730 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:06:51,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix014.opt.i [2023-12-05 21:06:51,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a901bf05/b1e6e39de9be4a8885eca7c4c253838b/FLAG09c91f50f [2023-12-05 21:06:51,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a901bf05/b1e6e39de9be4a8885eca7c4c253838b [2023-12-05 21:06:51,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:06:51,753 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:06:51,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:06:51,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:06:51,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:06:51,758 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655e1619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:51, skipping insertion in model container [2023-12-05 21:06:51,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:06:51" (1/1) ... [2023-12-05 21:06:51,803 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:06:52,099 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:06:52,111 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:06:52,165 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:06:52,190 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:06:52,190 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:06:52,195 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:06:52,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52 WrapperNode [2023-12-05 21:06:52,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:06:52,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:06:52,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:06:52,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:06:52,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,233 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-12-05 21:06:52,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:06:52,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:06:52,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:06:52,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:06:52,244 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,261 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:06:52,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:06:52,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:06:52,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:06:52,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (1/1) ... [2023-12-05 21:06:52,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:06:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:06:52,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:06:52,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:06:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:06:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:06:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:06:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:06:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:06:52,350 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:06:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:06:52,351 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:06:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:06:52,351 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:06:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:06:52,351 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:06:52,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:06:52,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:06:52,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:06:52,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:06:52,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:06:52,353 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:06:52,443 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:06:52,444 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:06:52,761 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:06:52,863 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:06:52,863 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:06:52,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:06:52 BoogieIcfgContainer [2023-12-05 21:06:52,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:06:52,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:06:52,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:06:52,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:06:52,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:06:51" (1/3) ... [2023-12-05 21:06:52,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5191971c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:06:52, skipping insertion in model container [2023-12-05 21:06:52,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:06:52" (2/3) ... [2023-12-05 21:06:52,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5191971c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:06:52, skipping insertion in model container [2023-12-05 21:06:52,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:06:52" (3/3) ... [2023-12-05 21:06:52,872 INFO L112 eAbstractionObserver]: Analyzing ICFG mix014.opt.i [2023-12-05 21:06:52,885 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:06:52,885 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-05 21:06:52,886 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:06:52,946 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:52,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 310 flow [2023-12-05 21:06:53,029 INFO L124 PetriNetUnfolderBase]: 3/143 cut-off events. [2023-12-05 21:06:53,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:53,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 3/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 116 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-12-05 21:06:53,034 INFO L82 GeneralOperation]: Start removeDead. Operand has 157 places, 147 transitions, 310 flow [2023-12-05 21:06:53,037 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 94 transitions, 197 flow [2023-12-05 21:06:53,050 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:53,059 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;@1e619b01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:53,059 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-05 21:06:53,072 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:53,072 INFO L124 PetriNetUnfolderBase]: 0/44 cut-off events. [2023-12-05 21:06:53,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:53,073 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,073 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:53,073 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2044489121, now seen corresponding path program 1 times [2023-12-05 21:06:53,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370104101] [2023-12-05 21:06:53,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:53,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370104101] [2023-12-05 21:06:53,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370104101] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156612854] [2023-12-05 21:06:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,354 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,375 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-12-05 21:06:53,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-12-05 21:06:53,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,447 INFO L124 PetriNetUnfolderBase]: 2/100 cut-off events. [2023-12-05 21:06:53,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:53,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 2 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 73. Up to 19 conditions per place. [2023-12-05 21:06:53,449 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 18 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-12-05 21:06:53,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 233 flow [2023-12-05 21:06:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-12-05 21:06:53,460 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.800453514739229 [2023-12-05 21:06:53,461 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-12-05 21:06:53,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-12-05 21:06:53,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-12-05 21:06:53,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,501 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 1 predicate places. [2023-12-05 21:06:53,501 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 93 transitions, 233 flow [2023-12-05 21:06:53,501 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,501 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,501 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:53,502 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:06:53,502 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2044489120, now seen corresponding path program 1 times [2023-12-05 21:06:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517785269] [2023-12-05 21:06:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:53,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517785269] [2023-12-05 21:06:53,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517785269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122939635] [2023-12-05 21:06:53,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,665 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,667 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2023-12-05 21:06:53,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 93 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2023-12-05 21:06:53,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,719 INFO L124 PetriNetUnfolderBase]: 3/100 cut-off events. [2023-12-05 21:06:53,719 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-12-05 21:06:53,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 100 events. 3/100 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 3 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 91. Up to 19 conditions per place. [2023-12-05 21:06:53,720 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-12-05 21:06:53,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 92 transitions, 263 flow [2023-12-05 21:06:53,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-12-05 21:06:53,723 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2023-12-05 21:06:53,723 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-12-05 21:06:53,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-12-05 21:06:53,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-12-05 21:06:53,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,728 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 2 predicate places. [2023-12-05 21:06:53,728 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 92 transitions, 263 flow [2023-12-05 21:06:53,728 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,729 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,729 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:53,729 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:06:53,729 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1269912788, now seen corresponding path program 1 times [2023-12-05 21:06:53,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586907197] [2023-12-05 21:06:53,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:53,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586907197] [2023-12-05 21:06:53,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586907197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555830760] [2023-12-05 21:06:53,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,854 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,856 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2023-12-05 21:06:53,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 92 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2023-12-05 21:06:53,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:53,897 INFO L124 PetriNetUnfolderBase]: 3/99 cut-off events. [2023-12-05 21:06:53,897 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-12-05 21:06:53,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 99 events. 3/99 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 3 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 105. Up to 19 conditions per place. [2023-12-05 21:06:53,899 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-12-05 21:06:53,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 91 transitions, 293 flow [2023-12-05 21:06:53,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-12-05 21:06:53,906 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2023-12-05 21:06:53,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-12-05 21:06:53,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-12-05 21:06:53,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:53,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-12-05 21:06:53,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,911 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,912 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,913 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 3 predicate places. [2023-12-05 21:06:53,913 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 293 flow [2023-12-05 21:06:53,913 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,913 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:53,913 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:53,913 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:06:53,914 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:53,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:53,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1269912787, now seen corresponding path program 1 times [2023-12-05 21:06:53,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:53,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878488832] [2023-12-05 21:06:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:53,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878488832] [2023-12-05 21:06:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878488832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:53,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:53,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481893973] [2023-12-05 21:06:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:53,994 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:53,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:53,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:53,995 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-12-05 21:06:53,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 293 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:53,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:53,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-12-05 21:06:53,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:54,041 INFO L124 PetriNetUnfolderBase]: 3/98 cut-off events. [2023-12-05 21:06:54,041 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-12-05 21:06:54,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 98 events. 3/98 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 3 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 117. Up to 18 conditions per place. [2023-12-05 21:06:54,042 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-12-05 21:06:54,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 90 transitions, 321 flow [2023-12-05 21:06:54,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-12-05 21:06:54,044 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-12-05 21:06:54,044 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:54,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,046 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,048 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 4 predicate places. [2023-12-05 21:06:54,048 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 321 flow [2023-12-05 21:06:54,048 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,049 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:54,049 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:54,049 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:06:54,049 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:54,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:54,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1586364618, now seen corresponding path program 1 times [2023-12-05 21:06:54,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:54,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402851944] [2023-12-05 21:06:54,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:54,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402851944] [2023-12-05 21:06:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402851944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:54,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225948020] [2023-12-05 21:06:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:54,108 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:54,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:54,110 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-12-05 21:06:54,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 321 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:54,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-12-05 21:06:54,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:54,150 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-12-05 21:06:54,150 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-12-05 21:06:54,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 97 events. 3/97 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 3 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 129. Up to 18 conditions per place. [2023-12-05 21:06:54,151 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:06:54,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 89 transitions, 349 flow [2023-12-05 21:06:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-12-05 21:06:54,153 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-12-05 21:06:54,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:54,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,157 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 5 predicate places. [2023-12-05 21:06:54,157 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 89 transitions, 349 flow [2023-12-05 21:06:54,158 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,158 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:54,158 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:54,159 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:06:54,161 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:54,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:54,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1586364617, now seen corresponding path program 1 times [2023-12-05 21:06:54,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:54,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905228843] [2023-12-05 21:06:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:54,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:54,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:54,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905228843] [2023-12-05 21:06:54,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905228843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:54,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:54,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:54,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099563273] [2023-12-05 21:06:54,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:54,279 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:54,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:54,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:54,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:54,280 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2023-12-05 21:06:54,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 89 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:54,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2023-12-05 21:06:54,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:54,308 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-12-05 21:06:54,308 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-12-05 21:06:54,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 96 events. 3/96 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 3 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 139. Up to 17 conditions per place. [2023-12-05 21:06:54,309 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 14 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:06:54,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 88 transitions, 371 flow [2023-12-05 21:06:54,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:54,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-12-05 21:06:54,310 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.81859410430839 [2023-12-05 21:06:54,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-12-05 21:06:54,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-12-05 21:06:54,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:54,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-12-05 21:06:54,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,312 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,314 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 6 predicate places. [2023-12-05 21:06:54,314 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 88 transitions, 371 flow [2023-12-05 21:06:54,315 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,315 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:54,315 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:54,315 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:06:54,316 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:54,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:54,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1727216110, now seen corresponding path program 1 times [2023-12-05 21:06:54,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:54,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336088850] [2023-12-05 21:06:54,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:54,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:54,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336088850] [2023-12-05 21:06:54,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336088850] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:54,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:54,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:54,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036556292] [2023-12-05 21:06:54,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:54,377 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:54,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:54,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:54,378 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2023-12-05 21:06:54,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 88 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:54,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2023-12-05 21:06:54,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:54,407 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2023-12-05 21:06:54,407 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-12-05 21:06:54,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 93 events. 2/93 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2023-12-05 21:06:54,408 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 16 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:06:54,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 88 transitions, 411 flow [2023-12-05 21:06:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-12-05 21:06:54,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7959183673469388 [2023-12-05 21:06:54,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:54,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-12-05 21:06:54,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,412 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 7 predicate places. [2023-12-05 21:06:54,412 INFO L500 AbstractCegarLoop]: Abstraction has has 111 places, 88 transitions, 411 flow [2023-12-05 21:06:54,412 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,412 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:54,412 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:54,412 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:06:54,413 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:06:54,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:54,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1727216111, now seen corresponding path program 1 times [2023-12-05 21:06:54,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:54,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834933320] [2023-12-05 21:06:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:54,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:54,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834933320] [2023-12-05 21:06:54,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834933320] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:54,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:54,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:54,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720611758] [2023-12-05 21:06:54,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:54,491 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:54,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:54,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:54,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:54,492 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 147 [2023-12-05 21:06:54,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 88 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:54,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 147 [2023-12-05 21:06:54,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:54,519 INFO L124 PetriNetUnfolderBase]: 1/90 cut-off events. [2023-12-05 21:06:54,519 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-12-05 21:06:54,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 90 events. 1/90 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2023-12-05 21:06:54,519 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 0 selfloop transitions, 0 changer transitions 87/87 dead transitions. [2023-12-05 21:06:54,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 87 transitions, 431 flow [2023-12-05 21:06:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-12-05 21:06:54,521 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.81859410430839 [2023-12-05 21:06:54,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-12-05 21:06:54,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-12-05 21:06:54,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:54,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-12-05 21:06:54,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,523 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,523 INFO L308 CegarLoopForPetriNet]: 104 programPoint places, 8 predicate places. [2023-12-05 21:06:54,523 INFO L500 AbstractCegarLoop]: Abstraction has has 112 places, 87 transitions, 431 flow [2023-12-05 21:06:54,523 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:54,532 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix014.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:06:54,572 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-12-05 21:06:54,573 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-12-05 21:06:54,575 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-12-05 21:06:54,576 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-12-05 21:06:54,576 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-12-05 21:06:54,576 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-12-05 21:06:54,579 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-12-05 21:06:54,579 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-12-05 21:06:54,579 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-12-05 21:06:54,579 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-12-05 21:06:54,579 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-12-05 21:06:54,579 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-12-05 21:06:54,579 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:06:54,580 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:54,582 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:06:54,582 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:06:54,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:06:54 BasicIcfg [2023-12-05 21:06:54,589 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:06:54,589 INFO L158 Benchmark]: Toolchain (without parser) took 2835.92ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 128.3MB in the beginning and 219.3MB in the end (delta: -90.9MB). Peak memory consumption was 70.8MB. Max. memory is 8.0GB. [2023-12-05 21:06:54,589 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 194.0MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:06:54,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.13ms. Allocated memory is still 194.0MB. Free memory was 128.0MB in the beginning and 103.6MB in the end (delta: 24.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:06:54,590 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.16ms. Allocated memory is still 194.0MB. Free memory was 103.6MB in the beginning and 100.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:06:54,590 INFO L158 Benchmark]: Boogie Preprocessor took 30.25ms. Allocated memory is still 194.0MB. Free memory was 100.8MB in the beginning and 98.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:06:54,590 INFO L158 Benchmark]: RCFGBuilder took 600.10ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 98.4MB in the beginning and 188.6MB in the end (delta: -90.2MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2023-12-05 21:06:54,590 INFO L158 Benchmark]: TraceAbstraction took 1721.50ms. Allocated memory is still 263.2MB. Free memory was 187.6MB in the beginning and 219.3MB in the end (delta: -31.7MB). Peak memory consumption was 60.1MB. Max. memory is 8.0GB. [2023-12-05 21:06:54,591 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 194.0MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 441.13ms. Allocated memory is still 194.0MB. Free memory was 128.0MB in the beginning and 103.6MB in the end (delta: 24.4MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.16ms. Allocated memory is still 194.0MB. Free memory was 103.6MB in the beginning and 100.8MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.25ms. Allocated memory is still 194.0MB. Free memory was 100.8MB in the beginning and 98.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 600.10ms. Allocated memory was 194.0MB in the beginning and 263.2MB in the end (delta: 69.2MB). Free memory was 98.4MB in the beginning and 188.6MB in the end (delta: -90.2MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1721.50ms. Allocated memory is still 263.2MB. Free memory was 187.6MB in the beginning and 219.3MB in the end (delta: -31.7MB). Peak memory consumption was 60.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 183 locations, 12 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: 1.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=8, InterpolantAutomatonStates: 24, 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, 0.7s InterpolantComputationTime, 436 NumberOfCodeBlocks, 436 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 428 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 21:06:54,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...