/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/mix021_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:07:08,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:07:08,840 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:07:08,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:07:08,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:07:08,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:07:08,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:07:08,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:07:08,860 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:07:08,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:07:08,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:07:08,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:07:08,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:07:08,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:07:08,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:07:08,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:07:08,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:07:08,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:07:08,862 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:07:08,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:07:08,863 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:07:08,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:07:08,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:07:08,864 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:07:08,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:07:08,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:07:08,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:07:08,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:07:08,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:07:08,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:07:08,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:07:08,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:07:08,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:07:08,866 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:07:09,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:07:09,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:07:09,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:07:09,073 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:07:09,074 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:07:09,074 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2023-12-05 21:07:10,065 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:07:10,265 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:07:10,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_tso.oepc.i [2023-12-05 21:07:10,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a0280de/e4213d46647c4155ab27b81bb34aea7b/FLAG8f52c4d5c [2023-12-05 21:07:10,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54a0280de/e4213d46647c4155ab27b81bb34aea7b [2023-12-05 21:07:10,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:07:10,290 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:07:10,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:07:10,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:07:10,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:07:10,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c335c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10, skipping insertion in model container [2023-12-05 21:07:10,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,349 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:07:10,707 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:07:10,717 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:07:10,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:07:10,787 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:07:10,788 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:07:10,793 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:07:10,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10 WrapperNode [2023-12-05 21:07:10,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:07:10,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:07:10,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:07:10,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:07:10,799 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:07:10" (1/1) ... [2023-12-05 21:07:10,845 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:07:10" (1/1) ... [2023-12-05 21:07:10,867 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-12-05 21:07:10,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:07:10,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:07:10,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:07:10,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:07:10,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,879 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,886 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,913 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:07:10,914 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:07:10,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:07:10,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:07:10,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (1/1) ... [2023-12-05 21:07:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:07:10,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:07:10,947 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:07:10,954 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:07:10,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:07:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:07:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:07:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:07:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:07:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:07:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:07:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:07:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:07:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:07:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:07:10,974 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:07:10,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:07:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:07:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:07:10,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:07:10,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:07:10,977 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:07:11,123 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:07:11,127 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:07:11,440 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:07:11,513 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:07:11,513 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:07:11,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:07:11 BoogieIcfgContainer [2023-12-05 21:07:11,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:07:11,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:07:11,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:07:11,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:07:11,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:07:10" (1/3) ... [2023-12-05 21:07:11,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d640124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:07:11, skipping insertion in model container [2023-12-05 21:07:11,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:07:10" (2/3) ... [2023-12-05 21:07:11,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d640124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:07:11, skipping insertion in model container [2023-12-05 21:07:11,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:07:11" (3/3) ... [2023-12-05 21:07:11,520 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_tso.oepc.i [2023-12-05 21:07:11,532 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:07:11,532 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-05 21:07:11,532 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:07:11,589 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:07:11,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 304 flow [2023-12-05 21:07:11,655 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-12-05 21:07:11,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:11,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-12-05 21:07:11,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 304 flow [2023-12-05 21:07:11,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 91 transitions, 191 flow [2023-12-05 21:07:11,684 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:07:11,690 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;@389f07cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:07:11,690 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-05 21:07:11,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:07:11,703 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2023-12-05 21:07:11,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:11,703 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:11,704 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:07:11,704 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:07:11,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2082732934, now seen corresponding path program 1 times [2023-12-05 21:07:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054524368] [2023-12-05 21:07:11,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:11,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:12,005 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:07:12,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:12,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054524368] [2023-12-05 21:07:12,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054524368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:12,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:12,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:12,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412711448] [2023-12-05 21:07:12,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:12,016 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:12,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:12,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:12,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:12,040 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144 [2023-12-05 21:07:12,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:12,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:12,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144 [2023-12-05 21:07:12,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:12,131 INFO L124 PetriNetUnfolderBase]: 20/155 cut-off events. [2023-12-05 21:07:12,132 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:07:12,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 155 events. 20/155 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 383 event pairs, 20 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 166. Up to 53 conditions per place. [2023-12-05 21:07:12,134 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 20 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-12-05 21:07:12,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 231 flow [2023-12-05 21:07:12,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-12-05 21:07:12,156 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7939814814814815 [2023-12-05 21:07:12,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-12-05 21:07:12,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-12-05 21:07:12,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:12,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-12-05 21:07:12,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:07:12,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,176 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2023-12-05 21:07:12,176 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 231 flow [2023-12-05 21:07:12,177 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:12,177 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:12,177 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:07:12,178 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:07:12,178 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:07:12,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2082732933, now seen corresponding path program 1 times [2023-12-05 21:07:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196846017] [2023-12-05 21:07:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:07:12,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196846017] [2023-12-05 21:07:12,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196846017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:12,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:12,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630005154] [2023-12-05 21:07:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:12,339 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:12,340 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 144 [2023-12-05 21:07:12,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:07:12,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:12,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 144 [2023-12-05 21:07:12,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:12,415 INFO L124 PetriNetUnfolderBase]: 28/174 cut-off events. [2023-12-05 21:07:12,416 INFO L125 PetriNetUnfolderBase]: For 31/33 co-relation queries the response was YES. [2023-12-05 21:07:12,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 174 events. 28/174 cut-off events. For 31/33 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 495 event pairs, 28 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 251. Up to 60 conditions per place. [2023-12-05 21:07:12,417 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 18 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:07:12,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 89 transitions, 265 flow [2023-12-05 21:07:12,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-12-05 21:07:12,424 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8171296296296297 [2023-12-05 21:07:12,424 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-12-05 21:07:12,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-12-05 21:07:12,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:12,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-12-05 21:07:12,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:12,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,426 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,427 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2023-12-05 21:07:12,427 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 265 flow [2023-12-05 21:07:12,427 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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:07:12,427 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:12,427 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:12,427 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:07:12,428 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:12,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash -699409447, now seen corresponding path program 1 times [2023-12-05 21:07:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575859363] [2023-12-05 21:07:12,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:12,504 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:07:12,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:12,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575859363] [2023-12-05 21:07:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575859363] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:12,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420519284] [2023-12-05 21:07:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:12,509 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:12,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:12,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:12,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:12,511 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144 [2023-12-05 21:07:12,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:12,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:12,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144 [2023-12-05 21:07:12,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:12,570 INFO L124 PetriNetUnfolderBase]: 28/173 cut-off events. [2023-12-05 21:07:12,570 INFO L125 PetriNetUnfolderBase]: For 93/101 co-relation queries the response was YES. [2023-12-05 21:07:12,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 173 events. 28/173 cut-off events. For 93/101 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 482 event pairs, 28 based on Foata normal form. 1/169 useless extension candidates. Maximal degree in co-relation 306. Up to 60 conditions per place. [2023-12-05 21:07:12,572 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 19 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:07:12,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 301 flow [2023-12-05 21:07:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-12-05 21:07:12,573 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-12-05 21:07:12,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-12-05 21:07:12,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-12-05 21:07:12,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:12,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-12-05 21:07:12,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:12,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,576 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2023-12-05 21:07:12,576 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 301 flow [2023-12-05 21:07:12,576 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:12,576 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:12,577 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:12,577 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:07:12,577 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:07:12,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:12,577 INFO L85 PathProgramCache]: Analyzing trace with hash -699409446, now seen corresponding path program 1 times [2023-12-05 21:07:12,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:12,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816089745] [2023-12-05 21:07:12,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:12,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:12,658 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:07:12,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:12,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816089745] [2023-12-05 21:07:12,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816089745] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:12,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:12,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:12,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29204167] [2023-12-05 21:07:12,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:12,659 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:12,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:12,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:12,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:12,660 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 144 [2023-12-05 21:07:12,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:07:12,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:12,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 144 [2023-12-05 21:07:12,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:12,712 INFO L124 PetriNetUnfolderBase]: 28/172 cut-off events. [2023-12-05 21:07:12,712 INFO L125 PetriNetUnfolderBase]: For 177/191 co-relation queries the response was YES. [2023-12-05 21:07:12,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 172 events. 28/172 cut-off events. For 177/191 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 480 event pairs, 28 based on Foata normal form. 1/168 useless extension candidates. Maximal degree in co-relation 359. Up to 59 conditions per place. [2023-12-05 21:07:12,715 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 17 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-12-05 21:07:12,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 87 transitions, 331 flow [2023-12-05 21:07:12,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:12,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:12,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-12-05 21:07:12,717 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2023-12-05 21:07:12,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-12-05 21:07:12,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-12-05 21:07:12,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:12,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-12-05 21:07:12,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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:07:12,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,722 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 4 predicate places. [2023-12-05 21:07:12,723 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 331 flow [2023-12-05 21:07:12,723 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:07:12,723 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:12,723 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:12,723 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:07:12,723 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:07:12,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:12,724 INFO L85 PathProgramCache]: Analyzing trace with hash 300638280, now seen corresponding path program 1 times [2023-12-05 21:07:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:12,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535748239] [2023-12-05 21:07:12,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:12,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:12,820 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:07:12,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:12,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535748239] [2023-12-05 21:07:12,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535748239] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:12,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:12,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:12,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761698713] [2023-12-05 21:07:12,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:12,821 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:12,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:12,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:12,823 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 144 [2023-12-05 21:07:12,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:07:12,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:12,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 144 [2023-12-05 21:07:12,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:12,877 INFO L124 PetriNetUnfolderBase]: 27/176 cut-off events. [2023-12-05 21:07:12,877 INFO L125 PetriNetUnfolderBase]: For 273/293 co-relation queries the response was YES. [2023-12-05 21:07:12,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 176 events. 27/176 cut-off events. For 273/293 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 495 event pairs, 26 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 410. Up to 58 conditions per place. [2023-12-05 21:07:12,880 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 18 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-12-05 21:07:12,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 87 transitions, 373 flow [2023-12-05 21:07:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:12,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-12-05 21:07:12,882 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8171296296296297 [2023-12-05 21:07:12,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-12-05 21:07:12,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-12-05 21:07:12,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:12,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-12-05 21:07:12,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:12,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:12,887 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2023-12-05 21:07:12,888 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 87 transitions, 373 flow [2023-12-05 21:07:12,888 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:07:12,888 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:12,888 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:12,889 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:07:12,891 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:07:12,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:12,893 INFO L85 PathProgramCache]: Analyzing trace with hash 300638279, now seen corresponding path program 1 times [2023-12-05 21:07:12,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:12,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574633218] [2023-12-05 21:07:12,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:12,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:12,953 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:07:12,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:12,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574633218] [2023-12-05 21:07:12,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574633218] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:12,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:12,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:12,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499378139] [2023-12-05 21:07:12,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:12,955 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:12,957 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144 [2023-12-05 21:07:12,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 87 transitions, 373 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:12,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:12,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144 [2023-12-05 21:07:12,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:13,035 INFO L124 PetriNetUnfolderBase]: 26/170 cut-off events. [2023-12-05 21:07:13,036 INFO L125 PetriNetUnfolderBase]: For 397/423 co-relation queries the response was YES. [2023-12-05 21:07:13,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 170 events. 26/170 cut-off events. For 397/423 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 471 event pairs, 25 based on Foata normal form. 4/170 useless extension candidates. Maximal degree in co-relation 445. Up to 55 conditions per place. [2023-12-05 21:07:13,037 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 18 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-12-05 21:07:13,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 86 transitions, 403 flow [2023-12-05 21:07:13,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-12-05 21:07:13,038 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7893518518518519 [2023-12-05 21:07:13,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-12-05 21:07:13,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-12-05 21:07:13,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:13,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-12-05 21:07:13,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:07:13,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:13,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:13,042 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 6 predicate places. [2023-12-05 21:07:13,042 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 86 transitions, 403 flow [2023-12-05 21:07:13,042 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:13,042 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:13,042 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:13,043 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:07:13,043 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:07:13,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1630688084, now seen corresponding path program 1 times [2023-12-05 21:07:13,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:13,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407214916] [2023-12-05 21:07:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:13,095 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:07:13,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407214916] [2023-12-05 21:07:13,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407214916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:13,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:13,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:13,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864673775] [2023-12-05 21:07:13,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:13,098 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:13,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:13,100 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 144 [2023-12-05 21:07:13,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 86 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:13,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:13,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 144 [2023-12-05 21:07:13,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:13,144 INFO L124 PetriNetUnfolderBase]: 19/137 cut-off events. [2023-12-05 21:07:13,144 INFO L125 PetriNetUnfolderBase]: For 471/481 co-relation queries the response was YES. [2023-12-05 21:07:13,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 137 events. 19/137 cut-off events. For 471/481 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 290 event pairs, 0 based on Foata normal form. 6/143 useless extension candidates. Maximal degree in co-relation 397. Up to 48 conditions per place. [2023-12-05 21:07:13,145 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 21 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:07:13,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 88 transitions, 481 flow [2023-12-05 21:07:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-12-05 21:07:13,147 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7939814814814815 [2023-12-05 21:07:13,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-12-05 21:07:13,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-12-05 21:07:13,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:13,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-12-05 21:07:13,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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:07:13,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:13,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:13,150 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2023-12-05 21:07:13,150 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 88 transitions, 481 flow [2023-12-05 21:07:13,151 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:13,151 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:07:13,151 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:13,151 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:07:13,151 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:07:13,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:07:13,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1630688083, now seen corresponding path program 1 times [2023-12-05 21:07:13,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:07:13,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721521751] [2023-12-05 21:07:13,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:07:13,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:07:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:07:13,229 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:07:13,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:07:13,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721521751] [2023-12-05 21:07:13,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721521751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:07:13,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:07:13,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:07:13,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611522021] [2023-12-05 21:07:13,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:07:13,231 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:07:13,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:07:13,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:07:13,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:07:13,232 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 144 [2023-12-05 21:07:13,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 88 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:07:13,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:07:13,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 144 [2023-12-05 21:07:13,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:07:13,264 INFO L124 PetriNetUnfolderBase]: 12/124 cut-off events. [2023-12-05 21:07:13,264 INFO L125 PetriNetUnfolderBase]: For 538/552 co-relation queries the response was YES. [2023-12-05 21:07:13,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 124 events. 12/124 cut-off events. For 538/552 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 230 event pairs, 0 based on Foata normal form. 6/130 useless extension candidates. Maximal degree in co-relation 343. Up to 35 conditions per place. [2023-12-05 21:07:13,265 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 0 selfloop transitions, 0 changer transitions 87/87 dead transitions. [2023-12-05 21:07:13,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 511 flow [2023-12-05 21:07:13,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:07:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:07:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-12-05 21:07:13,266 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8171296296296297 [2023-12-05 21:07:13,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-12-05 21:07:13,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-12-05 21:07:13,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:07:13,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-12-05 21:07:13,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:07:13,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:13,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:07:13,270 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 8 predicate places. [2023-12-05 21:07:13,270 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 87 transitions, 511 flow [2023-12-05 21:07:13,270 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:07:13,278 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix021_tso.oepc.i_BEv2_AllErrorsAtOnce [2023-12-05 21:07:13,314 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-12-05 21:07:13,314 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-12-05 21:07:13,316 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-12-05 21:07:13,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-12-05 21:07:13,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-12-05 21:07:13,317 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-12-05 21:07:13,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-12-05 21:07:13,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-12-05 21:07:13,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-12-05 21:07:13,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-12-05 21:07:13,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-12-05 21:07:13,320 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-12-05 21:07:13,320 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:07:13,321 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:07:13,323 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:07:13,323 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:07:13,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:07:13 BasicIcfg [2023-12-05 21:07:13,329 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:07:13,329 INFO L158 Benchmark]: Toolchain (without parser) took 3039.50ms. Allocated memory was 202.4MB in the beginning and 257.9MB in the end (delta: 55.6MB). Free memory was 159.0MB in the beginning and 133.1MB in the end (delta: 25.9MB). Peak memory consumption was 81.8MB. Max. memory is 8.0GB. [2023-12-05 21:07:13,329 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 202.4MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:07:13,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.90ms. Allocated memory is still 202.4MB. Free memory was 158.6MB in the beginning and 134.8MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:13,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.31ms. Allocated memory is still 202.4MB. Free memory was 134.8MB in the beginning and 132.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:13,330 INFO L158 Benchmark]: Boogie Preprocessor took 45.00ms. Allocated memory is still 202.4MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:13,330 INFO L158 Benchmark]: RCFGBuilder took 600.91ms. Allocated memory was 202.4MB in the beginning and 257.9MB in the end (delta: 55.6MB). Free memory was 130.0MB in the beginning and 205.3MB in the end (delta: -75.3MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. [2023-12-05 21:07:13,330 INFO L158 Benchmark]: TraceAbstraction took 1812.96ms. Allocated memory is still 257.9MB. Free memory was 204.2MB in the beginning and 133.1MB in the end (delta: 71.1MB). Peak memory consumption was 71.1MB. Max. memory is 8.0GB. [2023-12-05 21:07:13,331 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 202.4MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 502.90ms. Allocated memory is still 202.4MB. Free memory was 158.6MB in the beginning and 134.8MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 73.31ms. Allocated memory is still 202.4MB. Free memory was 134.8MB in the beginning and 132.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.00ms. Allocated memory is still 202.4MB. Free memory was 132.1MB in the beginning and 130.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 600.91ms. Allocated memory was 202.4MB in the beginning and 257.9MB in the end (delta: 55.6MB). Free memory was 130.0MB in the beginning and 205.3MB in the end (delta: -75.3MB). Peak memory consumption was 26.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1812.96ms. Allocated memory is still 257.9MB. Free memory was 204.2MB in the beginning and 133.1MB in the end (delta: 71.1MB). Peak memory consumption was 71.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 179 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.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 166 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=511occurred 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, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 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:07:13,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...