/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix008.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:43:06,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:43:06,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:43:06,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:43:06,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:43:06,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:43:06,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:43:06,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:43:06,547 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:43:06,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:43:06,551 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:43:06,551 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:43:06,551 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:43:06,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:43:06,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:43:06,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:43:06,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:43:06,553 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:43:06,553 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:43:06,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:43:06,553 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:43:06,554 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:43:06,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:43:06,554 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:43:06,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:43:06,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:43:06,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:43:06,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:43:06,556 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:43:06,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:43:06,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:43:06,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:43:06,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:43:06,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:43:06,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:43:06,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:43:06,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:43:06,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:43:06,814 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:43:06,815 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2023-11-30 04:43:07,951 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:43:08,209 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:43:08,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008.opt.i [2023-11-30 04:43:08,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb1b1272/64ac29e2d0f943418623c42d675b7aeb/FLAGf11caade1 [2023-11-30 04:43:08,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cb1b1272/64ac29e2d0f943418623c42d675b7aeb [2023-11-30 04:43:08,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:43:08,244 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:43:08,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:43:08,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:43:08,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:43:08,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2cb90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08, skipping insertion in model container [2023-11-30 04:43:08,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,300 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:43:08,622 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:43:08,636 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:43:08,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:43:08,719 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:43:08,719 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:43:08,725 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:43:08,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08 WrapperNode [2023-11-30 04:43:08,725 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:43:08,726 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:43:08,726 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:43:08,726 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:43:08,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,775 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2023-11-30 04:43:08,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:43:08,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:43:08,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:43:08,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:43:08,786 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:43:08,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:43:08,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:43:08,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:43:08,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (1/1) ... [2023-11-30 04:43:08,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:43:08,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:43:08,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:43:08,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:43:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:43:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:43:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:43:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:43:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:43:08,868 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:43:08,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:43:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:43:08,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:43:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:43:08,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:43:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:43:08,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:43:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:43:08,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:43:08,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:43:08,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:43:08,871 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:43:08,985 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:43:08,997 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:43:09,350 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:43:09,486 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:43:09,487 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:43:09,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:43:09 BoogieIcfgContainer [2023-11-30 04:43:09,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:43:09,490 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:43:09,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:43:09,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:43:09,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:43:08" (1/3) ... [2023-11-30 04:43:09,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2225cfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:43:09, skipping insertion in model container [2023-11-30 04:43:09,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:08" (2/3) ... [2023-11-30 04:43:09,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2225cfcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:43:09, skipping insertion in model container [2023-11-30 04:43:09,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:43:09" (3/3) ... [2023-11-30 04:43:09,495 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2023-11-30 04:43:09,510 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:43:09,510 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:43:09,511 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:43:09,580 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:43:09,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 308 flow [2023-11-30 04:43:09,683 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-11-30 04:43:09,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:43:09,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-11-30 04:43:09,689 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 308 flow [2023-11-30 04:43:09,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 93 transitions, 195 flow [2023-11-30 04:43:09,701 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:43:09,706 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;@78bf99ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:43:09,706 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:43:09,714 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:43:09,714 INFO L124 PetriNetUnfolderBase]: 0/43 cut-off events. [2023-11-30 04:43:09,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:43:09,714 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:09,715 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:09,715 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-11-30 04:43:09,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:09,724 INFO L85 PathProgramCache]: Analyzing trace with hash 66572582, now seen corresponding path program 1 times [2023-11-30 04:43:09,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:09,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729535338] [2023-11-30 04:43:09,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:09,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:43:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:10,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729535338] [2023-11-30 04:43:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729535338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95450974] [2023-11-30 04:43:10,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:10,067 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:10,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:10,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:10,110 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 146 [2023-11-30 04:43:10,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 195 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-11-30 04:43:10,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:10,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 146 [2023-11-30 04:43:10,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:10,182 INFO L124 PetriNetUnfolderBase]: 2/99 cut-off events. [2023-11-30 04:43:10,182 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:43:10,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 2 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 73. Up to 19 conditions per place. [2023-11-30 04:43:10,184 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 18 selfloop transitions, 1 changer transitions 0/92 dead transitions. [2023-11-30 04:43:10,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 92 transitions, 231 flow [2023-11-30 04:43:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:10,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:10,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-11-30 04:43:10,198 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7990867579908676 [2023-11-30 04:43:10,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-11-30 04:43:10,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-11-30 04:43:10,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:10,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-11-30 04:43:10,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-11-30 04:43:10,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,221 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 1 predicate places. [2023-11-30 04:43:10,222 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 231 flow [2023-11-30 04:43:10,222 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-11-30 04:43:10,222 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:10,223 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:10,223 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:43:10,224 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-11-30 04:43:10,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:10,224 INFO L85 PathProgramCache]: Analyzing trace with hash 66572583, now seen corresponding path program 1 times [2023-11-30 04:43:10,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:10,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087940052] [2023-11-30 04:43:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:10,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:43:10,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:10,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087940052] [2023-11-30 04:43:10,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087940052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:10,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:10,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879949627] [2023-11-30 04:43:10,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:10,410 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:10,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:10,413 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 146 [2023-11-30 04:43:10,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 231 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-11-30 04:43:10,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:10,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 146 [2023-11-30 04:43:10,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:10,501 INFO L124 PetriNetUnfolderBase]: 3/99 cut-off events. [2023-11-30 04:43:10,502 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-30 04:43:10,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 99 events. 3/99 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 3 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 91. Up to 19 conditions per place. [2023-11-30 04:43:10,504 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2023-11-30 04:43:10,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 91 transitions, 261 flow [2023-11-30 04:43:10,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:10,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-11-30 04:43:10,509 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.821917808219178 [2023-11-30 04:43:10,509 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-11-30 04:43:10,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-11-30 04:43:10,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:10,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-11-30 04:43:10,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,515 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 2 predicate places. [2023-11-30 04:43:10,516 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 91 transitions, 261 flow [2023-11-30 04:43:10,516 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-11-30 04:43:10,516 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:10,516 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:10,517 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:43:10,517 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-11-30 04:43:10,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:10,518 INFO L85 PathProgramCache]: Analyzing trace with hash 353923697, now seen corresponding path program 1 times [2023-11-30 04:43:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:10,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057460797] [2023-11-30 04:43:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:10,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:43:10,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:10,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057460797] [2023-11-30 04:43:10,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057460797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:10,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:10,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:10,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163125186] [2023-11-30 04:43:10,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:10,689 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:10,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:10,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:10,691 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 146 [2023-11-30 04:43:10,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 91 transitions, 261 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-11-30 04:43:10,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:10,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 146 [2023-11-30 04:43:10,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:10,741 INFO L124 PetriNetUnfolderBase]: 3/98 cut-off events. [2023-11-30 04:43:10,742 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-30 04:43:10,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 98 events. 3/98 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 3 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 105. Up to 19 conditions per place. [2023-11-30 04:43:10,743 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:43:10,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 90 transitions, 291 flow [2023-11-30 04:43:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-11-30 04:43:10,746 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.821917808219178 [2023-11-30 04:43:10,746 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-11-30 04:43:10,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-11-30 04:43:10,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:10,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-11-30 04:43:10,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,750 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 3 predicate places. [2023-11-30 04:43:10,750 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 291 flow [2023-11-30 04:43:10,751 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-11-30 04:43:10,751 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:10,751 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:10,751 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:43:10,751 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-11-30 04:43:10,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash 353923696, now seen corresponding path program 1 times [2023-11-30 04:43:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:10,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407946429] [2023-11-30 04:43:10,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:10,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:43:10,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:10,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407946429] [2023-11-30 04:43:10,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407946429] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:10,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:10,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:10,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388590080] [2023-11-30 04:43:10,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:10,814 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:10,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:10,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:10,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:10,821 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 146 [2023-11-30 04:43:10,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 291 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-11-30 04:43:10,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:10,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 146 [2023-11-30 04:43:10,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:10,880 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-11-30 04:43:10,880 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-30 04:43:10,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 97 events. 3/97 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 3 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 117. Up to 18 conditions per place. [2023-11-30 04:43:10,881 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:43:10,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 89 transitions, 319 flow [2023-11-30 04:43:10,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:43:10,883 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2023-11-30 04:43:10,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:43:10,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:43:10,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:10,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:43:10,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,886 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:10,888 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 4 predicate places. [2023-11-30 04:43:10,888 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 319 flow [2023-11-30 04:43:10,888 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-11-30 04:43:10,888 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:10,889 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:10,889 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:43:10,889 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:43:10,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash 486610187, now seen corresponding path program 1 times [2023-11-30 04:43:10,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:10,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820966136] [2023-11-30 04:43:10,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:43:10,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:10,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820966136] [2023-11-30 04:43:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820966136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:10,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657991075] [2023-11-30 04:43:10,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:10,954 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:10,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:10,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:10,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:10,955 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 146 [2023-11-30 04:43:10,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 319 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-11-30 04:43:10,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:10,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 146 [2023-11-30 04:43:10,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:10,994 INFO L124 PetriNetUnfolderBase]: 3/96 cut-off events. [2023-11-30 04:43:10,994 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-11-30 04:43:10,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 96 events. 3/96 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 3 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 129. Up to 18 conditions per place. [2023-11-30 04:43:10,996 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:43:10,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 88 transitions, 347 flow [2023-11-30 04:43:10,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:43:10,998 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2023-11-30 04:43:10,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:43:10,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:43:10,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:10,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:43:10,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,002 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 5 predicate places. [2023-11-30 04:43:11,003 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 88 transitions, 347 flow [2023-11-30 04:43:11,003 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-11-30 04:43:11,003 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:11,004 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:11,004 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:43:11,004 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:43:11,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 486610188, now seen corresponding path program 1 times [2023-11-30 04:43:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641211334] [2023-11-30 04:43:11,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:11,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:43:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641211334] [2023-11-30 04:43:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641211334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:11,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:11,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156859343] [2023-11-30 04:43:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:11,128 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:11,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:11,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:11,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:11,130 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 146 [2023-11-30 04:43:11,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 88 transitions, 347 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-11-30 04:43:11,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:11,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 146 [2023-11-30 04:43:11,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:11,173 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-11-30 04:43:11,173 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-30 04:43:11,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 95 events. 3/95 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 3 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 139. Up to 17 conditions per place. [2023-11-30 04:43:11,174 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 14 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-11-30 04:43:11,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 87 transitions, 369 flow [2023-11-30 04:43:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:11,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-30 04:43:11,176 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.817351598173516 [2023-11-30 04:43:11,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-30 04:43:11,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-30 04:43:11,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:11,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-30 04:43:11,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,181 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 6 predicate places. [2023-11-30 04:43:11,181 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 87 transitions, 369 flow [2023-11-30 04:43:11,182 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-11-30 04:43:11,182 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:11,182 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:11,182 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:43:11,183 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-11-30 04:43:11,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:11,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1616223118, now seen corresponding path program 1 times [2023-11-30 04:43:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429698265] [2023-11-30 04:43:11,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:11,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:43:11,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:11,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429698265] [2023-11-30 04:43:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429698265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:11,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:11,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258809333] [2023-11-30 04:43:11,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:11,261 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:11,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:11,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:11,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:11,263 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 146 [2023-11-30 04:43:11,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 87 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:11,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 146 [2023-11-30 04:43:11,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:11,302 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2023-11-30 04:43:11,302 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-30 04:43:11,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 92 events. 2/92 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 2/94 useless extension candidates. Maximal degree in co-relation 137. Up to 16 conditions per place. [2023-11-30 04:43:11,303 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 16 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-11-30 04:43:11,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 87 transitions, 409 flow [2023-11-30 04:43:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:43:11,305 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7945205479452054 [2023-11-30 04:43:11,305 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:43:11,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:43:11,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:11,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:43:11,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,308 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,326 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 7 predicate places. [2023-11-30 04:43:11,327 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 87 transitions, 409 flow [2023-11-30 04:43:11,327 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,327 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:11,327 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:11,327 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:43:11,327 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-11-30 04:43:11,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1616223119, now seen corresponding path program 1 times [2023-11-30 04:43:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:11,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882721926] [2023-11-30 04:43:11,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:11,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:43:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882721926] [2023-11-30 04:43:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882721926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:11,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125550984] [2023-11-30 04:43:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:11,411 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:11,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:11,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:11,413 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 146 [2023-11-30 04:43:11,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 87 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:11,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 146 [2023-11-30 04:43:11,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:11,452 INFO L124 PetriNetUnfolderBase]: 1/89 cut-off events. [2023-11-30 04:43:11,452 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-11-30 04:43:11,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 89 events. 1/89 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 2/91 useless extension candidates. Maximal degree in co-relation 129. Up to 15 conditions per place. [2023-11-30 04:43:11,453 INFO L140 encePairwiseOnDemand]: 144/146 looper letters, 0 selfloop transitions, 0 changer transitions 86/86 dead transitions. [2023-11-30 04:43:11,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 86 transitions, 429 flow [2023-11-30 04:43:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-11-30 04:43:11,455 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.817351598173516 [2023-11-30 04:43:11,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-11-30 04:43:11,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-11-30 04:43:11,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:11,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-11-30 04:43:11,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,462 INFO L307 CegarLoopForPetriNet]: 103 programPoint places, 8 predicate places. [2023-11-30 04:43:11,463 INFO L500 AbstractCegarLoop]: Abstraction has has 111 places, 86 transitions, 429 flow [2023-11-30 04:43:11,464 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:43:11,474 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix008.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:43:11,512 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:43:11,512 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:43:11,512 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:43:11,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:43:11,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:43:11,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:43:11,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:43:11,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:43:11,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:43:11,513 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:43:11,514 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:43:11,514 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:43:11,514 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:43:11,514 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:11,517 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:43:11,517 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:43:11,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:43:11 BasicIcfg [2023-11-30 04:43:11,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:43:11,523 INFO L158 Benchmark]: Toolchain (without parser) took 3278.27ms. Allocated memory is still 568.3MB. Free memory was 515.8MB in the beginning and 488.0MB in the end (delta: 27.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-11-30 04:43:11,523 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 343.9MB. Free memory is still 294.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:43:11,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 480.16ms. Allocated memory is still 568.3MB. Free memory was 515.8MB in the beginning and 491.3MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-11-30 04:43:11,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.42ms. Allocated memory is still 568.3MB. Free memory was 491.3MB in the beginning and 488.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:43:11,524 INFO L158 Benchmark]: Boogie Preprocessor took 33.77ms. Allocated memory is still 568.3MB. Free memory was 488.5MB in the beginning and 486.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:43:11,524 INFO L158 Benchmark]: RCFGBuilder took 677.79ms. Allocated memory is still 568.3MB. Free memory was 486.1MB in the beginning and 502.2MB in the end (delta: -16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-11-30 04:43:11,524 INFO L158 Benchmark]: TraceAbstraction took 2032.35ms. Allocated memory is still 568.3MB. Free memory was 501.8MB in the beginning and 488.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.0GB. [2023-11-30 04:43:11,526 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.13ms. Allocated memory is still 343.9MB. Free memory is still 294.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 480.16ms. Allocated memory is still 568.3MB. Free memory was 515.8MB in the beginning and 491.3MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 49.42ms. Allocated memory is still 568.3MB. Free memory was 491.3MB in the beginning and 488.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.77ms. Allocated memory is still 568.3MB. Free memory was 488.5MB in the beginning and 486.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 677.79ms. Allocated memory is still 568.3MB. Free memory was 486.1MB in the beginning and 502.2MB in the end (delta: -16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 2032.35ms. Allocated memory is still 568.3MB. Free memory was 501.8MB in the beginning and 488.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 182 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.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, 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.2s 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=429occurred 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.8s InterpolantComputationTime, 428 NumberOfCodeBlocks, 428 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 564 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-11-30 04:43:11,547 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...