/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/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:10:24,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:10:24,198 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:10:24,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:10:24,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:10:24,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:10:24,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:10:24,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:10:24,222 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:10:24,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:10:24,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:10:24,225 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:10:24,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:10:24,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:10:24,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:10:24,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:10:24,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:10:24,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:10:24,227 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:10:24,227 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:10:24,227 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:10:24,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:10:24,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:10:24,228 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:10:24,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:10:24,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:24,229 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:10:24,229 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:10:24,229 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:10:24,229 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:10:24,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:10:24,230 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:10:24,230 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:10:24,230 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 21:10:24,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:10:24,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:10:24,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:10:24,444 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:10:24,445 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:10:24,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-12-05 21:10:25,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:10:25,733 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:10:25,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-12-05 21:10:25,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86094751/685a28f6998b48c286aa9007bb5b3ecd/FLAGde5ebb25a [2023-12-05 21:10:25,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86094751/685a28f6998b48c286aa9007bb5b3ecd [2023-12-05 21:10:25,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:10:25,755 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:10:25,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:25,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:10:25,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:10:25,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:25" (1/1) ... [2023-12-05 21:10:25,759 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d053147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:25, skipping insertion in model container [2023-12-05 21:10:25,759 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:10:25" (1/1) ... [2023-12-05 21:10:25,788 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:10:25,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:25,970 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:10:26,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:10:26,047 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:26,047 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:10:26,052 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:10:26,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26 WrapperNode [2023-12-05 21:10:26,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:10:26,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:26,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:10:26,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:10:26,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,105 INFO L138 Inliner]: procedures = 177, calls = 63, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 85 [2023-12-05 21:10:26,105 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:10:26,106 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:10:26,106 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:10:26,106 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:10:26,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,125 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:10:26,133 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:10:26,133 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:10:26,133 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:10:26,134 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (1/1) ... [2023-12-05 21:10:26,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:10:26,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:10:26,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:10:26,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:10:26,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:10:26,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:10:26,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:10:26,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:10:26,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:10:26,207 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:10:26,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:10:26,207 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:10:26,207 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:10:26,208 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:10:26,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:10:26,208 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:10:26,208 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:10:26,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:10:26,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:10:26,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:10:26,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:10:26,209 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:10:26,305 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:10:26,307 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:10:26,468 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:10:26,476 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:10:26,476 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:10:26,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:26 BoogieIcfgContainer [2023-12-05 21:10:26,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:10:26,479 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:10:26,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:10:26,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:10:26,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:10:25" (1/3) ... [2023-12-05 21:10:26,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31846d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:26, skipping insertion in model container [2023-12-05 21:10:26,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:10:26" (2/3) ... [2023-12-05 21:10:26,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31846d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:10:26, skipping insertion in model container [2023-12-05 21:10:26,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:10:26" (3/3) ... [2023-12-05 21:10:26,483 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i [2023-12-05 21:10:26,527 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:10:26,528 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-05 21:10:26,528 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:10:26,570 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:10:26,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 256 flow [2023-12-05 21:10:26,627 INFO L124 PetriNetUnfolderBase]: 3/116 cut-off events. [2023-12-05 21:10:26,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:26,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-12-05 21:10:26,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 120 transitions, 256 flow [2023-12-05 21:10:26,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 69 transitions, 147 flow [2023-12-05 21:10:26,641 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:10:26,645 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;@5dfb7e3c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:10:26,645 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-05 21:10:26,657 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:10:26,657 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2023-12-05 21:10:26,657 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:26,658 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:26,658 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] [2023-12-05 21:10:26,658 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:10:26,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:26,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1761412669, now seen corresponding path program 1 times [2023-12-05 21:10:26,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:26,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512321914] [2023-12-05 21:10:26,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:26,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:26,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:26,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512321914] [2023-12-05 21:10:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512321914] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:26,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:26,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:26,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501309513] [2023-12-05 21:10:26,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:26,889 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:26,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:26,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:26,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:26,916 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2023-12-05 21:10:26,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:26,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:26,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2023-12-05 21:10:26,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:26,972 INFO L124 PetriNetUnfolderBase]: 0/68 cut-off events. [2023-12-05 21:10:26,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:10:26,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 68 events. 0/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2023-12-05 21:10:26,974 INFO L140 encePairwiseOnDemand]: 118/120 looper letters, 17 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2023-12-05 21:10:26,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 68 transitions, 181 flow [2023-12-05 21:10:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:26,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-12-05 21:10:26,988 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7944444444444444 [2023-12-05 21:10:26,989 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-12-05 21:10:26,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-12-05 21:10:26,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:26,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-12-05 21:10:26,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,000 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,005 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2023-12-05 21:10:27,005 INFO L500 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 181 flow [2023-12-05 21:10:27,006 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,006 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:27,007 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] [2023-12-05 21:10:27,007 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:10:27,007 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:10:27,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1761412668, now seen corresponding path program 1 times [2023-12-05 21:10:27,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:27,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951625813] [2023-12-05 21:10:27,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:27,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:27,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:27,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951625813] [2023-12-05 21:10:27,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951625813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:27,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:27,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:27,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984278208] [2023-12-05 21:10:27,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:27,107 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:27,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:27,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:27,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:27,108 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2023-12-05 21:10:27,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 68 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:27,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2023-12-05 21:10:27,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:27,136 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2023-12-05 21:10:27,136 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-12-05 21:10:27,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 67 events. 0/67 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 0. Up to 13 conditions per place. [2023-12-05 21:10:27,136 INFO L140 encePairwiseOnDemand]: 118/120 looper letters, 15 selfloop transitions, 1 changer transitions 0/67 dead transitions. [2023-12-05 21:10:27,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 67 transitions, 209 flow [2023-12-05 21:10:27,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-12-05 21:10:27,138 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2023-12-05 21:10:27,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-12-05 21:10:27,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-12-05 21:10:27,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:27,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-12-05 21:10:27,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,141 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, 2 predicate places. [2023-12-05 21:10:27,141 INFO L500 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 209 flow [2023-12-05 21:10:27,141 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,141 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:27,142 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] [2023-12-05 21:10:27,142 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:10:27,142 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:10:27,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:27,142 INFO L85 PathProgramCache]: Analyzing trace with hash 288951473, now seen corresponding path program 1 times [2023-12-05 21:10:27,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:27,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055941022] [2023-12-05 21:10:27,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:27,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:27,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:27,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:27,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055941022] [2023-12-05 21:10:27,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055941022] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:27,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:27,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:27,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591172307] [2023-12-05 21:10:27,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:27,277 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:27,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:27,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:27,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:27,278 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2023-12-05 21:10:27,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 209 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:27,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2023-12-05 21:10:27,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:27,323 INFO L124 PetriNetUnfolderBase]: 0/66 cut-off events. [2023-12-05 21:10:27,323 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-12-05 21:10:27,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 66 events. 0/66 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 0. Up to 13 conditions per place. [2023-12-05 21:10:27,324 INFO L140 encePairwiseOnDemand]: 118/120 looper letters, 15 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-12-05 21:10:27,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 66 transitions, 237 flow [2023-12-05 21:10:27,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-12-05 21:10:27,326 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2023-12-05 21:10:27,326 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-12-05 21:10:27,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-12-05 21:10:27,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:27,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-12-05 21:10:27,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,331 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, 3 predicate places. [2023-12-05 21:10:27,331 INFO L500 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 237 flow [2023-12-05 21:10:27,331 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,331 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:27,332 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] [2023-12-05 21:10:27,332 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:10:27,332 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:10:27,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash 288951472, now seen corresponding path program 1 times [2023-12-05 21:10:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963803544] [2023-12-05 21:10:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:27,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:27,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963803544] [2023-12-05 21:10:27,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963803544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:27,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:27,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:27,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321518390] [2023-12-05 21:10:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:27,409 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:27,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:27,411 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2023-12-05 21:10:27,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:27,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2023-12-05 21:10:27,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:27,483 INFO L124 PetriNetUnfolderBase]: 0/65 cut-off events. [2023-12-05 21:10:27,483 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-12-05 21:10:27,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 65 events. 0/65 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 1/66 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2023-12-05 21:10:27,484 INFO L140 encePairwiseOnDemand]: 118/120 looper letters, 15 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2023-12-05 21:10:27,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 65 transitions, 263 flow [2023-12-05 21:10:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-12-05 21:10:27,485 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2023-12-05 21:10:27,485 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-12-05 21:10:27,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-12-05 21:10:27,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:27,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-12-05 21:10:27,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,488 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2023-12-05 21:10:27,488 INFO L500 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 263 flow [2023-12-05 21:10:27,488 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,488 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:27,489 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] [2023-12-05 21:10:27,489 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:10:27,489 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:10:27,489 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1140101488, now seen corresponding path program 1 times [2023-12-05 21:10:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:27,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355329252] [2023-12-05 21:10:27,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:27,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355329252] [2023-12-05 21:10:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355329252] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:27,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:27,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833557916] [2023-12-05 21:10:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:27,588 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:27,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:27,589 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2023-12-05 21:10:27,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:27,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2023-12-05 21:10:27,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:27,619 INFO L124 PetriNetUnfolderBase]: 0/64 cut-off events. [2023-12-05 21:10:27,619 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-12-05 21:10:27,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 64 events. 0/64 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 0. Up to 12 conditions per place. [2023-12-05 21:10:27,620 INFO L140 encePairwiseOnDemand]: 118/120 looper letters, 14 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-12-05 21:10:27,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 64 transitions, 287 flow [2023-12-05 21:10:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-12-05 21:10:27,621 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2023-12-05 21:10:27,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-12-05 21:10:27,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-12-05 21:10:27,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:27,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-12-05 21:10:27,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,625 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2023-12-05 21:10:27,625 INFO L500 AbstractCegarLoop]: Abstraction has has 84 places, 64 transitions, 287 flow [2023-12-05 21:10:27,626 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,626 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:27,626 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] [2023-12-05 21:10:27,626 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:10:27,627 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:10:27,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:27,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1140101487, now seen corresponding path program 1 times [2023-12-05 21:10:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:27,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467023184] [2023-12-05 21:10:27,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467023184] [2023-12-05 21:10:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467023184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:27,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:27,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:27,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550408077] [2023-12-05 21:10:27,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:27,684 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:27,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:27,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:27,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:27,685 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2023-12-05 21:10:27,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 64 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:27,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2023-12-05 21:10:27,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:27,723 INFO L124 PetriNetUnfolderBase]: 0/63 cut-off events. [2023-12-05 21:10:27,723 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-12-05 21:10:27,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 63 events. 0/63 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 0. Up to 11 conditions per place. [2023-12-05 21:10:27,724 INFO L140 encePairwiseOnDemand]: 118/120 looper letters, 14 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2023-12-05 21:10:27,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 63 transitions, 309 flow [2023-12-05 21:10:27,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-12-05 21:10:27,725 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7861111111111111 [2023-12-05 21:10:27,725 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-12-05 21:10:27,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-12-05 21:10:27,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:27,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-12-05 21:10:27,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,727 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,729 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2023-12-05 21:10:27,729 INFO L500 AbstractCegarLoop]: Abstraction has has 85 places, 63 transitions, 309 flow [2023-12-05 21:10:27,729 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,729 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:27,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] [2023-12-05 21:10:27,729 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:10:27,729 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:10:27,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash 604363008, now seen corresponding path program 1 times [2023-12-05 21:10:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:27,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630375150] [2023-12-05 21:10:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:27,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:27,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630375150] [2023-12-05 21:10:27,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630375150] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:27,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:27,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:27,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184117374] [2023-12-05 21:10:27,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:27,803 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:27,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:27,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:27,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:27,804 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2023-12-05 21:10:27,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 63 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:27,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2023-12-05 21:10:27,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:27,832 INFO L124 PetriNetUnfolderBase]: 0/62 cut-off events. [2023-12-05 21:10:27,832 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2023-12-05 21:10:27,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 62 events. 0/62 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2023-12-05 21:10:27,833 INFO L140 encePairwiseOnDemand]: 118/120 looper letters, 14 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-12-05 21:10:27,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 62 transitions, 331 flow [2023-12-05 21:10:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:27,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-12-05 21:10:27,834 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7861111111111111 [2023-12-05 21:10:27,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-12-05 21:10:27,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-12-05 21:10:27,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:27,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-12-05 21:10:27,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,837 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,838 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2023-12-05 21:10:27,838 INFO L500 AbstractCegarLoop]: Abstraction has has 86 places, 62 transitions, 331 flow [2023-12-05 21:10:27,838 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,838 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:10:27,838 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] [2023-12-05 21:10:27,838 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:10:27,839 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:10:27,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:10:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash 604363009, now seen corresponding path program 1 times [2023-12-05 21:10:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:10:27,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250644616] [2023-12-05 21:10:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:10:27,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:10:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:10:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:10:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:10:27,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250644616] [2023-12-05 21:10:27,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250644616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:10:27,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:10:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:10:27,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815738545] [2023-12-05 21:10:27,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:10:27,938 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:10:27,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:10:27,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:10:27,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:10:27,939 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 120 [2023-12-05 21:10:27,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 62 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:10:27,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 120 [2023-12-05 21:10:27,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:10:27,960 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2023-12-05 21:10:27,960 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2023-12-05 21:10:27,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 61 events. 0/61 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 37 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 0. Up to 14 conditions per place. [2023-12-05 21:10:27,962 INFO L140 encePairwiseOnDemand]: 118/120 looper letters, 0 selfloop transitions, 0 changer transitions 61/61 dead transitions. [2023-12-05 21:10:27,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 61 transitions, 347 flow [2023-12-05 21:10:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:10:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:10:27,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-12-05 21:10:27,963 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8138888888888889 [2023-12-05 21:10:27,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-12-05 21:10:27,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-12-05 21:10:27,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:10:27,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-12-05 21:10:27,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,966 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,968 INFO L308 CegarLoopForPetriNet]: 79 programPoint places, 8 predicate places. [2023-12-05 21:10:27,969 INFO L500 AbstractCegarLoop]: Abstraction has has 87 places, 61 transitions, 347 flow [2023-12-05 21:10:27,969 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:10:27,977 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/safe027_pso.oepc_pso.opt_tso.oepc_tso.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:10:28,003 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-12-05 21:10:28,004 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-12-05 21:10:28,007 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-12-05 21:10:28,007 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-12-05 21:10:28,007 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-12-05 21:10:28,007 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-12-05 21:10:28,007 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-12-05 21:10:28,010 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-12-05 21:10:28,010 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-12-05 21:10:28,010 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-12-05 21:10:28,010 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-12-05 21:10:28,010 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-12-05 21:10:28,010 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:10:28,011 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:10:28,014 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:10:28,014 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:10:28,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:10:28 BasicIcfg [2023-12-05 21:10:28,021 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:10:28,023 INFO L158 Benchmark]: Toolchain (without parser) took 2266.97ms. Allocated memory was 166.7MB in the beginning and 241.2MB in the end (delta: 74.4MB). Free memory was 117.8MB in the beginning and 107.9MB in the end (delta: 9.8MB). Peak memory consumption was 85.3MB. Max. memory is 8.0GB. [2023-12-05 21:10:28,023 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 166.7MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:10:28,023 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.08ms. Allocated memory is still 166.7MB. Free memory was 117.4MB in the beginning and 96.8MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-05 21:10:28,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.20ms. Allocated memory is still 166.7MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:28,024 INFO L158 Benchmark]: Boogie Preprocessor took 26.85ms. Allocated memory is still 166.7MB. Free memory was 94.7MB in the beginning and 92.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:10:28,024 INFO L158 Benchmark]: RCFGBuilder took 344.11ms. Allocated memory is still 166.7MB. Free memory was 92.9MB in the beginning and 76.9MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-05 21:10:28,025 INFO L158 Benchmark]: TraceAbstraction took 1542.60ms. Allocated memory was 166.7MB in the beginning and 241.2MB in the end (delta: 74.4MB). Free memory was 76.1MB in the beginning and 107.9MB in the end (delta: -31.8MB). Peak memory consumption was 43.4MB. Max. memory is 8.0GB. [2023-12-05 21:10:28,026 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 166.7MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.08ms. Allocated memory is still 166.7MB. Free memory was 117.4MB in the beginning and 96.8MB in the end (delta: 20.6MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.20ms. Allocated memory is still 166.7MB. Free memory was 96.8MB in the beginning and 94.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.85ms. Allocated memory is still 166.7MB. Free memory was 94.7MB in the beginning and 92.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 344.11ms. Allocated memory is still 166.7MB. Free memory was 92.9MB in the beginning and 76.9MB in the end (delta: 16.0MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1542.60ms. Allocated memory was 166.7MB in the beginning and 241.2MB in the end (delta: 74.4MB). Free memory was 76.1MB in the beginning and 107.9MB in the end (delta: -31.8MB). Peak memory consumption was 43.4MB. 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, 152 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.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 128 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=347occurred 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.6s InterpolantComputationTime, 252 NumberOfCodeBlocks, 252 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 388 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:10:28,059 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...