/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/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:07:59,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:07:59,906 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:59,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:07:59,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:07:59,931 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:07:59,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:07:59,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:07:59,932 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:07:59,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:07:59,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:07:59,936 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:07:59,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:07:59,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:07:59,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:07:59,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:07:59,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:07:59,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:07:59,938 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:07:59,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:07:59,938 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:07:59,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:07:59,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:07:59,939 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:07:59,940 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:07:59,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:07:59,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:07:59,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:07:59,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:07:59,941 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:07:59,941 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:07:59,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:07:59,942 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:07:59,942 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:08:00,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:08:00,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:08:00,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:08:00,161 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:08:00,161 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:08:00,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-12-05 21:08:01,084 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:08:01,293 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:08:01,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-12-05 21:08:01,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e505981/8e25d9766280422bb5bf873cac29a4c1/FLAG69c2bac8c [2023-12-05 21:08:01,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3e505981/8e25d9766280422bb5bf873cac29a4c1 [2023-12-05 21:08:01,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:08:01,320 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:08:01,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:01,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:08:01,324 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:08:01,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335926bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01, skipping insertion in model container [2023-12-05 21:08:01,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,367 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:08:01,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:01,685 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:08:01,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:08:01,774 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:01,774 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 21:08:01,794 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:08:01,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01 WrapperNode [2023-12-05 21:08:01,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:08:01,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:01,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:08:01,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:08:01,800 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:08:01" (1/1) ... [2023-12-05 21:08:01,827 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:08:01" (1/1) ... [2023-12-05 21:08:01,860 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 172 [2023-12-05 21:08:01,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:08:01,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:08:01,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:08:01,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:08:01,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,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:08:01" (1/1) ... [2023-12-05 21:08:01,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:08:01" (1/1) ... [2023-12-05 21:08:01,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:08:01,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:08:01,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:08:01,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:08:01,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01" (1/1) ... [2023-12-05 21:08:01,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:08:01,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:08:01,920 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:08:01,939 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:08:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:08:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 21:08:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:08:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:08:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:08:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-12-05 21:08:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-12-05 21:08:01,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-12-05 21:08:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-12-05 21:08:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-12-05 21:08:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-12-05 21:08:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-12-05 21:08:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-12-05 21:08:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:08:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 21:08:01,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:08:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:08:01,951 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:08:02,057 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:08:02,059 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:08:02,322 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:08:02,411 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:08:02,411 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 21:08:02,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:02 BoogieIcfgContainer [2023-12-05 21:08:02,412 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:08:02,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:08:02,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:08:02,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:08:02,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:08:01" (1/3) ... [2023-12-05 21:08:02,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8a034f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:02, skipping insertion in model container [2023-12-05 21:08:02,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:08:01" (2/3) ... [2023-12-05 21:08:02,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b8a034f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:08:02, skipping insertion in model container [2023-12-05 21:08:02,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:08:02" (3/3) ... [2023-12-05 21:08:02,419 INFO L112 eAbstractionObserver]: Analyzing ICFG mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-12-05 21:08:02,431 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:08:02,432 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-12-05 21:08:02,432 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:08:02,493 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:08:02,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 306 flow [2023-12-05 21:08:02,591 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-12-05 21:08:02,593 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:02,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-12-05 21:08:02,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 306 flow [2023-12-05 21:08:02,608 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 91 transitions, 191 flow [2023-12-05 21:08:02,619 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:08:02,625 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;@6fd0277b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:08:02,626 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-12-05 21:08:02,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:08:02,639 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2023-12-05 21:08:02,640 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:02,640 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:02,640 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:08:02,641 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:08:02,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1734877839, now seen corresponding path program 1 times [2023-12-05 21:08:02,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:02,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922431690] [2023-12-05 21:08:02,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:02,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:02,902 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:08:02,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:02,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922431690] [2023-12-05 21:08:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922431690] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:02,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:02,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668826708] [2023-12-05 21:08:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:02,914 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:02,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:02,956 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 145 [2023-12-05 21:08:02,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 191 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:08:02,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:02,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 145 [2023-12-05 21:08:02,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:03,034 INFO L124 PetriNetUnfolderBase]: 2/97 cut-off events. [2023-12-05 21:08:03,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:08:03,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 2 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 72. Up to 19 conditions per place. [2023-12-05 21:08:03,041 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 18 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-12-05 21:08:03,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 227 flow [2023-12-05 21:08:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:03,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-12-05 21:08:03,052 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7977011494252874 [2023-12-05 21:08:03,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-12-05 21:08:03,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-12-05 21:08:03,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:03,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-12-05 21:08:03,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:08:03,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,066 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2023-12-05 21:08:03,066 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 227 flow [2023-12-05 21:08:03,067 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:08:03,067 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:03,067 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:08:03,067 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:08:03,067 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:08:03,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:03,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1734877840, now seen corresponding path program 1 times [2023-12-05 21:08:03,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:03,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130790763] [2023-12-05 21:08:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:03,226 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:08:03,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:03,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130790763] [2023-12-05 21:08:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130790763] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:03,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541772631] [2023-12-05 21:08:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:03,228 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:03,230 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 145 [2023-12-05 21:08:03,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 227 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:08:03,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:03,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 145 [2023-12-05 21:08:03,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:03,275 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-12-05 21:08:03,275 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-12-05 21:08:03,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 97 events. 3/97 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 3 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 90. Up to 19 conditions per place. [2023-12-05 21:08:03,277 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 16 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-12-05 21:08:03,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 89 transitions, 257 flow [2023-12-05 21:08:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-12-05 21:08:03,281 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8206896551724138 [2023-12-05 21:08:03,281 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-12-05 21:08:03,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-12-05 21:08:03,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:03,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-12-05 21:08:03,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,286 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2023-12-05 21:08:03,286 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 257 flow [2023-12-05 21:08:03,286 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:08:03,286 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:03,286 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:08:03,287 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:08:03,287 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:03,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:03,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1319609571, now seen corresponding path program 1 times [2023-12-05 21:08:03,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:03,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424256490] [2023-12-05 21:08:03,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:03,405 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:08:03,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424256490] [2023-12-05 21:08:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424256490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:03,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:03,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383141071] [2023-12-05 21:08:03,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:03,406 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:03,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:03,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:03,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:03,408 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 145 [2023-12-05 21:08:03,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 257 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:08:03,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:03,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 145 [2023-12-05 21:08:03,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:03,449 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-12-05 21:08:03,449 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-12-05 21:08:03,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 96 events. 3/96 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 3 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 104. Up to 19 conditions per place. [2023-12-05 21:08:03,450 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 16 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-12-05 21:08:03,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 287 flow [2023-12-05 21:08:03,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-12-05 21:08:03,452 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8206896551724138 [2023-12-05 21:08:03,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-12-05 21:08:03,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-12-05 21:08:03,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:03,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-12-05 21:08:03,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,456 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2023-12-05 21:08:03,456 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 287 flow [2023-12-05 21:08:03,456 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:08:03,456 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:03,457 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:08:03,457 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:08:03,457 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-12-05 21:08:03,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:03,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1319609572, now seen corresponding path program 1 times [2023-12-05 21:08:03,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:03,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006016928] [2023-12-05 21:08:03,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:03,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:03,518 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:08:03,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:03,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006016928] [2023-12-05 21:08:03,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006016928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:03,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:03,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:03,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682329903] [2023-12-05 21:08:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:03,520 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:03,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:03,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:03,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:03,521 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 145 [2023-12-05 21:08:03,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 287 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:08:03,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:03,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 145 [2023-12-05 21:08:03,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:03,550 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-12-05 21:08:03,551 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-12-05 21:08:03,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 95 events. 3/95 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 3 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 116. Up to 18 conditions per place. [2023-12-05 21:08:03,551 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 16 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-12-05 21:08:03,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 87 transitions, 315 flow [2023-12-05 21:08:03,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-12-05 21:08:03,553 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2023-12-05 21:08:03,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-12-05 21:08:03,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-12-05 21:08:03,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:03,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-12-05 21:08:03,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,558 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 4 predicate places. [2023-12-05 21:08:03,558 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 315 flow [2023-12-05 21:08:03,558 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:08:03,558 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:03,558 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:08:03,558 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:08:03,559 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:08:03,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash 389850708, now seen corresponding path program 1 times [2023-12-05 21:08:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:03,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176693516] [2023-12-05 21:08:03,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:03,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:03,643 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:08:03,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:03,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176693516] [2023-12-05 21:08:03,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176693516] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:03,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:03,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:03,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653234970] [2023-12-05 21:08:03,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:03,645 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:03,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:03,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:03,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:03,646 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 145 [2023-12-05 21:08:03,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:03,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 145 [2023-12-05 21:08:03,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:03,688 INFO L124 PetriNetUnfolderBase]: 3/94 cut-off events. [2023-12-05 21:08:03,688 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-12-05 21:08:03,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 94 events. 3/94 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 3 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 128. Up to 18 conditions per place. [2023-12-05 21:08:03,689 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 15 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-12-05 21:08:03,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 86 transitions, 341 flow [2023-12-05 21:08:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:03,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-12-05 21:08:03,691 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8183908045977012 [2023-12-05 21:08:03,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-12-05 21:08:03,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-12-05 21:08:03,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:03,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-12-05 21:08:03,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,693 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,696 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2023-12-05 21:08:03,696 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 341 flow [2023-12-05 21:08:03,696 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,697 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:03,697 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:08:03,697 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:08:03,698 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:08:03,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:03,701 INFO L85 PathProgramCache]: Analyzing trace with hash 389850707, now seen corresponding path program 1 times [2023-12-05 21:08:03,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560670665] [2023-12-05 21:08:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:03,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:03,775 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:08:03,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:03,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560670665] [2023-12-05 21:08:03,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560670665] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:03,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:03,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:03,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742349351] [2023-12-05 21:08:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:03,781 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:03,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:03,782 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 145 [2023-12-05 21:08:03,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 341 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:03,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 145 [2023-12-05 21:08:03,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:03,814 INFO L124 PetriNetUnfolderBase]: 3/93 cut-off events. [2023-12-05 21:08:03,815 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-12-05 21:08:03,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 93 events. 3/93 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 3 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 138. Up to 17 conditions per place. [2023-12-05 21:08:03,815 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 15 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2023-12-05 21:08:03,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 85 transitions, 365 flow [2023-12-05 21:08:03,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-12-05 21:08:03,817 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7908045977011494 [2023-12-05 21:08:03,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-12-05 21:08:03,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-12-05 21:08:03,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:03,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-12-05 21:08:03,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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:08:03,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,821 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 6 predicate places. [2023-12-05 21:08:03,821 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 365 flow [2023-12-05 21:08:03,822 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,822 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:03,822 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:08:03,822 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:08:03,822 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:08:03,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1288828631, now seen corresponding path program 1 times [2023-12-05 21:08:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:03,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119851029] [2023-12-05 21:08:03,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:03,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:03,876 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:08:03,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:03,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119851029] [2023-12-05 21:08:03,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119851029] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:03,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:03,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:03,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525271828] [2023-12-05 21:08:03,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:03,877 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:03,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:03,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:03,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:03,878 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 145 [2023-12-05 21:08:03,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:03,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 145 [2023-12-05 21:08:03,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:03,908 INFO L124 PetriNetUnfolderBase]: 2/90 cut-off events. [2023-12-05 21:08:03,908 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-12-05 21:08:03,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 90 events. 2/90 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 136. Up to 16 conditions per place. [2023-12-05 21:08:03,909 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 16 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2023-12-05 21:08:03,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 85 transitions, 405 flow [2023-12-05 21:08:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-12-05 21:08:03,910 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2023-12-05 21:08:03,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-12-05 21:08:03,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-12-05 21:08:03,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:03,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-12-05 21:08:03,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,913 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:03,914 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2023-12-05 21:08:03,914 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 405 flow [2023-12-05 21:08:03,914 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,914 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:08:03,914 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:08:03,914 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 21:08:03,914 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:08:03,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:08:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1288828630, now seen corresponding path program 1 times [2023-12-05 21:08:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:08:03,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937787352] [2023-12-05 21:08:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:08:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:08:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:08:03,994 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:08:03,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:08:03,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937787352] [2023-12-05 21:08:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937787352] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:08:03,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:08:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:08:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926899820] [2023-12-05 21:08:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:08:03,995 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:08:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:08:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:08:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:08:03,997 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 145 [2023-12-05 21:08:03,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:03,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:08:03,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 145 [2023-12-05 21:08:03,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:08:04,024 INFO L124 PetriNetUnfolderBase]: 1/87 cut-off events. [2023-12-05 21:08:04,024 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-12-05 21:08:04,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 87 events. 1/87 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 128. Up to 15 conditions per place. [2023-12-05 21:08:04,025 INFO L140 encePairwiseOnDemand]: 143/145 looper letters, 0 selfloop transitions, 0 changer transitions 84/84 dead transitions. [2023-12-05 21:08:04,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 84 transitions, 425 flow [2023-12-05 21:08:04,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:08:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:08:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-12-05 21:08:04,026 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8160919540229885 [2023-12-05 21:08:04,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-12-05 21:08:04,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-12-05 21:08:04,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:08:04,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-12-05 21:08:04,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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:08:04,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:04,031 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 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:08:04,032 INFO L308 CegarLoopForPetriNet]: 101 programPoint places, 8 predicate places. [2023-12-05 21:08:04,033 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 84 transitions, 425 flow [2023-12-05 21:08:04,033 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:08:04,040 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix047_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i_BEv2_AllErrorsAtOnce [2023-12-05 21:08:04,060 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-12-05 21:08:04,060 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-12-05 21:08:04,060 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-12-05 21:08:04,061 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-12-05 21:08:04,061 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-12-05 21:08:04,061 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-12-05 21:08:04,061 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-12-05 21:08:04,061 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-12-05 21:08:04,061 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-12-05 21:08:04,061 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-12-05 21:08:04,061 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-12-05 21:08:04,062 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-12-05 21:08:04,062 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:08:04,062 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:08:04,064 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 21:08:04,065 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 21:08:04,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:08:04 BasicIcfg [2023-12-05 21:08:04,071 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 21:08:04,071 INFO L158 Benchmark]: Toolchain (without parser) took 2751.22ms. Allocated memory was 195.0MB in the beginning and 238.0MB in the end (delta: 43.0MB). Free memory was 132.6MB in the beginning and 114.2MB in the end (delta: 18.4MB). Peak memory consumption was 62.0MB. Max. memory is 8.0GB. [2023-12-05 21:08:04,071 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:08:04,072 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.98ms. Allocated memory was 195.0MB in the beginning and 238.0MB in the end (delta: 43.0MB). Free memory was 132.3MB in the beginning and 205.0MB in the end (delta: -72.8MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. [2023-12-05 21:08:04,072 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.00ms. Allocated memory is still 238.0MB. Free memory was 205.0MB in the beginning and 201.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:08:04,072 INFO L158 Benchmark]: Boogie Preprocessor took 35.73ms. Allocated memory is still 238.0MB. Free memory was 201.9MB in the beginning and 200.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 21:08:04,073 INFO L158 Benchmark]: RCFGBuilder took 515.44ms. Allocated memory is still 238.0MB. Free memory was 199.8MB in the beginning and 162.6MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-05 21:08:04,073 INFO L158 Benchmark]: TraceAbstraction took 1656.64ms. Allocated memory is still 238.0MB. Free memory was 162.0MB in the beginning and 114.2MB in the end (delta: 47.9MB). Peak memory consumption was 47.9MB. Max. memory is 8.0GB. [2023-12-05 21:08:04,074 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 195.0MB. Free memory is still 148.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 473.98ms. Allocated memory was 195.0MB in the beginning and 238.0MB in the end (delta: 43.0MB). Free memory was 132.3MB in the beginning and 205.0MB in the end (delta: -72.8MB). Peak memory consumption was 30.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 65.00ms. Allocated memory is still 238.0MB. Free memory was 205.0MB in the beginning and 201.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.73ms. Allocated memory is still 238.0MB. Free memory was 201.9MB in the beginning and 200.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 515.44ms. Allocated memory is still 238.0MB. Free memory was 199.8MB in the beginning and 162.6MB in the end (delta: 37.2MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1656.64ms. Allocated memory is still 238.0MB. Free memory was 162.0MB in the beginning and 114.2MB in the end (delta: 47.9MB). Peak memory consumption was 47.9MB. 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, 181 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.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred 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:08:04,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...