/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_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:43:10,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:43:10,779 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:10,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:43:10,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:43:10,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:43:10,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:43:10,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:43:10,814 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:43:10,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:43:10,819 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:43:10,819 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:43:10,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:43:10,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:43:10,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:43:10,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:43:10,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:43:10,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:43:10,821 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:43:10,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:43:10,821 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:43:10,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:43:10,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:43:10,823 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:43:10,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:43:10,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:43:10,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:43:10,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:43:10,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:43:10,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:43:10,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:43:10,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:43:10,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:43:10,825 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:11,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:43:11,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:43:11,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:43:11,076 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:43:11,076 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:43:11,077 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2023-11-30 04:43:12,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:43:12,505 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:43:12,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_tso.oepc.i [2023-11-30 04:43:12,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/347eb61f2/d9db297aef764745b4c6d4b1adfb8335/FLAG7ad64cb47 [2023-11-30 04:43:12,534 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/347eb61f2/d9db297aef764745b4c6d4b1adfb8335 [2023-11-30 04:43:12,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:43:12,536 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:43:12,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:43:12,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:43:12,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:43:12,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:43:12" (1/1) ... [2023-11-30 04:43:12,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f378f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:12, skipping insertion in model container [2023-11-30 04:43:12,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:43:12" (1/1) ... [2023-11-30 04:43:12,600 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:43:12,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:43:13,017 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:43:13,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:43:13,145 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:43:13,145 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:43:13,152 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:43:13,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:13 WrapperNode [2023-11-30 04:43:13,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:43:13,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:43:13,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:43:13,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:43:13,159 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:13" (1/1) ... [2023-11-30 04:43:13,196 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:13" (1/1) ... [2023-11-30 04:43:13,239 INFO L138 Inliner]: procedures = 177, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 290 [2023-11-30 04:43:13,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:43:13,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:43:13,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:43:13,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:43:13,248 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:13" (1/1) ... [2023-11-30 04:43:13,248 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:13" (1/1) ... [2023-11-30 04:43:13,263 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:13" (1/1) ... [2023-11-30 04:43:13,263 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:13" (1/1) ... [2023-11-30 04:43:13,286 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:13" (1/1) ... [2023-11-30 04:43:13,288 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:13" (1/1) ... [2023-11-30 04:43:13,291 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:13" (1/1) ... [2023-11-30 04:43:13,294 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:13" (1/1) ... [2023-11-30 04:43:13,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:43:13,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:43:13,298 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:43:13,298 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:43:13,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:13" (1/1) ... [2023-11-30 04:43:13,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:43:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:43:13,337 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:13,367 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:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:43:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:43:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:43:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:43:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:43:13,386 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:43:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:43:13,387 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:43:13,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:43:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:43:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:43:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:43:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:43:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:43:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:43:13,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:43:13,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:43:13,390 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:13,527 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:43:13,529 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:43:13,930 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:43:14,098 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:43:14,098 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:43:14,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:43:14 BoogieIcfgContainer [2023-11-30 04:43:14,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:43:14,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:43:14,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:43:14,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:43:14,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:43:12" (1/3) ... [2023-11-30 04:43:14,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbfc79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:43:14, skipping insertion in model container [2023-11-30 04:43:14,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:43:13" (2/3) ... [2023-11-30 04:43:14,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbfc79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:43:14, skipping insertion in model container [2023-11-30 04:43:14,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:43:14" (3/3) ... [2023-11-30 04:43:14,109 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2023-11-30 04:43:14,125 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:43:14,126 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:43:14,126 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:43:14,200 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:43:14,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 164 transitions, 344 flow [2023-11-30 04:43:14,334 INFO L124 PetriNetUnfolderBase]: 3/160 cut-off events. [2023-11-30 04:43:14,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:43:14,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 160 events. 3/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-11-30 04:43:14,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 164 transitions, 344 flow [2023-11-30 04:43:14,352 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 111 transitions, 231 flow [2023-11-30 04:43:14,369 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:43:14,379 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;@20a43294, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:43:14,380 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:43:14,396 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:43:14,396 INFO L124 PetriNetUnfolderBase]: 0/61 cut-off events. [2023-11-30 04:43:14,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:43:14,397 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:14,398 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] [2023-11-30 04:43:14,399 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:14,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:14,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1679514174, now seen corresponding path program 1 times [2023-11-30 04:43:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:14,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834815817] [2023-11-30 04:43:14,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:14,771 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:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834815817] [2023-11-30 04:43:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834815817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:14,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:14,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368816766] [2023-11-30 04:43:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:14,785 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:14,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:14,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:14,839 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2023-11-30 04:43:14,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:14,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:14,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2023-11-30 04:43:14,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:14,976 INFO L124 PetriNetUnfolderBase]: 34/194 cut-off events. [2023-11-30 04:43:14,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:43:14,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 194 events. 34/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 487 event pairs, 34 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 212. Up to 79 conditions per place. [2023-11-30 04:43:14,982 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 22 selfloop transitions, 1 changer transitions 0/110 dead transitions. [2023-11-30 04:43:14,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 110 transitions, 275 flow [2023-11-30 04:43:14,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:14,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-11-30 04:43:14,999 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7987804878048781 [2023-11-30 04:43:15,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-11-30 04:43:15,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-11-30 04:43:15,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:15,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-11-30 04:43:15,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:15,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:15,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:15,021 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 1 predicate places. [2023-11-30 04:43:15,022 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 110 transitions, 275 flow [2023-11-30 04:43:15,022 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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:15,022 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:15,023 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] [2023-11-30 04:43:15,023 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:43:15,024 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:15,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:15,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1679514173, now seen corresponding path program 1 times [2023-11-30 04:43:15,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:15,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368518214] [2023-11-30 04:43:15,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:15,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:15,263 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:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368518214] [2023-11-30 04:43:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368518214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:15,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479507795] [2023-11-30 04:43:15,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:15,266 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:15,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:15,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:15,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:15,269 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164 [2023-11-30 04:43:15,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 110 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:15,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:15,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164 [2023-11-30 04:43:15,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:15,390 INFO L124 PetriNetUnfolderBase]: 48/221 cut-off events. [2023-11-30 04:43:15,390 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-30 04:43:15,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 221 events. 48/221 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 676 event pairs, 48 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 343. Up to 92 conditions per place. [2023-11-30 04:43:15,394 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 20 selfloop transitions, 1 changer transitions 0/109 dead transitions. [2023-11-30 04:43:15,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 109 transitions, 313 flow [2023-11-30 04:43:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-11-30 04:43:15,396 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8191056910569106 [2023-11-30 04:43:15,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-11-30 04:43:15,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-11-30 04:43:15,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:15,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-11-30 04:43:15,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:15,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:15,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:15,401 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 2 predicate places. [2023-11-30 04:43:15,401 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 109 transitions, 313 flow [2023-11-30 04:43:15,402 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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:15,402 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:15,402 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, 1, 1, 1, 1] [2023-11-30 04:43:15,402 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:43:15,402 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:43:15,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1940326054, now seen corresponding path program 1 times [2023-11-30 04:43:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430728536] [2023-11-30 04:43:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:15,522 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:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:15,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430728536] [2023-11-30 04:43:15,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430728536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:15,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:15,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:15,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299280379] [2023-11-30 04:43:15,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:15,529 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:15,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:15,533 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2023-11-30 04:43:15,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 109 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:15,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:15,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2023-11-30 04:43:15,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:15,627 INFO L124 PetriNetUnfolderBase]: 48/220 cut-off events. [2023-11-30 04:43:15,627 INFO L125 PetriNetUnfolderBase]: For 66/70 co-relation queries the response was YES. [2023-11-30 04:43:15,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 220 events. 48/220 cut-off events. For 66/70 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 654 event pairs, 48 based on Foata normal form. 1/217 useless extension candidates. Maximal degree in co-relation 430. Up to 92 conditions per place. [2023-11-30 04:43:15,631 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 21 selfloop transitions, 1 changer transitions 0/108 dead transitions. [2023-11-30 04:43:15,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 108 transitions, 353 flow [2023-11-30 04:43:15,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-11-30 04:43:15,634 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2023-11-30 04:43:15,634 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-11-30 04:43:15,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-11-30 04:43:15,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:15,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-11-30 04:43:15,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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:15,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:15,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:15,638 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 3 predicate places. [2023-11-30 04:43:15,638 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 108 transitions, 353 flow [2023-11-30 04:43:15,639 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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:15,639 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:15,639 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, 1, 1, 1, 1] [2023-11-30 04:43:15,639 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:43:15,640 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-11-30 04:43:15,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1940326055, now seen corresponding path program 1 times [2023-11-30 04:43:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:15,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545641634] [2023-11-30 04:43:15,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:15,761 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:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545641634] [2023-11-30 04:43:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545641634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:15,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160731838] [2023-11-30 04:43:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:15,764 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:15,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:15,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:15,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:15,771 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164 [2023-11-30 04:43:15,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 108 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:15,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:15,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164 [2023-11-30 04:43:15,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:15,851 INFO L124 PetriNetUnfolderBase]: 48/219 cut-off events. [2023-11-30 04:43:15,851 INFO L125 PetriNetUnfolderBase]: For 123/131 co-relation queries the response was YES. [2023-11-30 04:43:15,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 219 events. 48/219 cut-off events. For 123/131 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 658 event pairs, 48 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 515. Up to 91 conditions per place. [2023-11-30 04:43:15,853 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 19 selfloop transitions, 1 changer transitions 0/107 dead transitions. [2023-11-30 04:43:15,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 107 transitions, 387 flow [2023-11-30 04:43:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-30 04:43:15,855 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8170731707317073 [2023-11-30 04:43:15,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-30 04:43:15,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-30 04:43:15,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:15,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-30 04:43:15,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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:15,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:15,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:15,860 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 4 predicate places. [2023-11-30 04:43:15,860 INFO L500 AbstractCegarLoop]: Abstraction has has 125 places, 107 transitions, 387 flow [2023-11-30 04:43:15,860 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:15,860 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:15,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:15,861 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:43:15,861 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:15,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:15,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1797592577, now seen corresponding path program 1 times [2023-11-30 04:43:15,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:15,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363047497] [2023-11-30 04:43:15,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:15,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:16,007 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:16,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:16,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363047497] [2023-11-30 04:43:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363047497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:16,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:16,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:16,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492551128] [2023-11-30 04:43:16,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:16,009 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:16,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:16,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:16,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:16,010 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2023-11-30 04:43:16,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 107 transitions, 387 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:16,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:16,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2023-11-30 04:43:16,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:16,084 INFO L124 PetriNetUnfolderBase]: 47/216 cut-off events. [2023-11-30 04:43:16,084 INFO L125 PetriNetUnfolderBase]: For 198/210 co-relation queries the response was YES. [2023-11-30 04:43:16,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 216 events. 47/216 cut-off events. For 198/210 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 634 event pairs, 24 based on Foata normal form. 2/214 useless extension candidates. Maximal degree in co-relation 591. Up to 90 conditions per place. [2023-11-30 04:43:16,086 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 21 selfloop transitions, 1 changer transitions 0/107 dead transitions. [2023-11-30 04:43:16,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 107 transitions, 435 flow [2023-11-30 04:43:16,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-11-30 04:43:16,088 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7967479674796748 [2023-11-30 04:43:16,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-11-30 04:43:16,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-11-30 04:43:16,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:16,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-11-30 04:43:16,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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:16,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:16,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:16,093 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 5 predicate places. [2023-11-30 04:43:16,093 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 107 transitions, 435 flow [2023-11-30 04:43:16,093 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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:16,093 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:16,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:16,094 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:43:16,097 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:16,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1797592576, now seen corresponding path program 1 times [2023-11-30 04:43:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:16,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744895628] [2023-11-30 04:43:16,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:16,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:16,210 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:16,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:16,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744895628] [2023-11-30 04:43:16,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744895628] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:16,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:16,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:16,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623977774] [2023-11-30 04:43:16,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:16,212 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:16,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:16,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:16,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:16,214 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164 [2023-11-30 04:43:16,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 107 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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:16,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:16,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164 [2023-11-30 04:43:16,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:16,283 INFO L124 PetriNetUnfolderBase]: 46/213 cut-off events. [2023-11-30 04:43:16,283 INFO L125 PetriNetUnfolderBase]: For 282/298 co-relation queries the response was YES. [2023-11-30 04:43:16,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 213 events. 46/213 cut-off events. For 282/298 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 617 event pairs, 24 based on Foata normal form. 2/211 useless extension candidates. Maximal degree in co-relation 661. Up to 87 conditions per place. [2023-11-30 04:43:16,286 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 19 selfloop transitions, 1 changer transitions 0/106 dead transitions. [2023-11-30 04:43:16,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 106 transitions, 467 flow [2023-11-30 04:43:16,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:16,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:16,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-30 04:43:16,288 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8170731707317073 [2023-11-30 04:43:16,288 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-30 04:43:16,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-30 04:43:16,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:16,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-30 04:43:16,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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:16,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:16,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:16,292 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2023-11-30 04:43:16,293 INFO L500 AbstractCegarLoop]: Abstraction has has 127 places, 106 transitions, 467 flow [2023-11-30 04:43:16,293 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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:16,293 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:16,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:16,293 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:43:16,293 INFO L425 AbstractCegarLoop]: === Iteration 7 === 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:16,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash 671666322, now seen corresponding path program 1 times [2023-11-30 04:43:16,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:16,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414369647] [2023-11-30 04:43:16,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:16,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:16,403 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:16,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:16,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414369647] [2023-11-30 04:43:16,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414369647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:16,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:16,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917159130] [2023-11-30 04:43:16,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:16,407 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:16,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:16,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:16,409 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 164 [2023-11-30 04:43:16,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 106 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:16,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:16,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 164 [2023-11-30 04:43:16,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:16,476 INFO L124 PetriNetUnfolderBase]: 33/188 cut-off events. [2023-11-30 04:43:16,476 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2023-11-30 04:43:16,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 188 events. 33/188 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 468 event pairs, 0 based on Foata normal form. 10/198 useless extension candidates. Maximal degree in co-relation 599. Up to 74 conditions per place. [2023-11-30 04:43:16,478 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 24 selfloop transitions, 1 changer transitions 0/110 dead transitions. [2023-11-30 04:43:16,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 110 transitions, 579 flow [2023-11-30 04:43:16,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:16,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-11-30 04:43:16,480 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8252032520325203 [2023-11-30 04:43:16,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-11-30 04:43:16,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-11-30 04:43:16,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:16,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-11-30 04:43:16,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:16,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:16,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:16,485 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 7 predicate places. [2023-11-30 04:43:16,485 INFO L500 AbstractCegarLoop]: Abstraction has has 128 places, 110 transitions, 579 flow [2023-11-30 04:43:16,485 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:16,485 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:43:16,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:16,486 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:43:16,486 INFO L425 AbstractCegarLoop]: === Iteration 8 === 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:16,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:43:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash 671666321, now seen corresponding path program 1 times [2023-11-30 04:43:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:43:16,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274443541] [2023-11-30 04:43:16,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:43:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:43:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:43:16,544 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:16,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:43:16,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274443541] [2023-11-30 04:43:16,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274443541] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:43:16,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:43:16,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:43:16,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179399569] [2023-11-30 04:43:16,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:43:16,546 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:43:16,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:43:16,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:43:16,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:43:16,547 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 164 [2023-11-30 04:43:16,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 110 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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:16,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:43:16,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 164 [2023-11-30 04:43:16,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:43:16,609 INFO L124 PetriNetUnfolderBase]: 20/165 cut-off events. [2023-11-30 04:43:16,609 INFO L125 PetriNetUnfolderBase]: For 492/492 co-relation queries the response was YES. [2023-11-30 04:43:16,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 165 events. 20/165 cut-off events. For 492/492 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 335 event pairs, 0 based on Foata normal form. 10/175 useless extension candidates. Maximal degree in co-relation 493. Up to 51 conditions per place. [2023-11-30 04:43:16,610 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 0 selfloop transitions, 0 changer transitions 109/109 dead transitions. [2023-11-30 04:43:16,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 109 transitions, 619 flow [2023-11-30 04:43:16,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:43:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:43:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-30 04:43:16,612 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8008130081300813 [2023-11-30 04:43:16,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-30 04:43:16,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-30 04:43:16,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:43:16,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-30 04:43:16,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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:16,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:16,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:16,616 INFO L307 CegarLoopForPetriNet]: 121 programPoint places, 8 predicate places. [2023-11-30 04:43:16,617 INFO L500 AbstractCegarLoop]: Abstraction has has 129 places, 109 transitions, 619 flow [2023-11-30 04:43:16,617 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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:16,626 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix008_tso.oepc.i_BEv2_AllErrorsAtOnce [2023-11-30 04:43:16,663 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:43:16,664 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:43:16,667 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:43:16,667 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:43:16,667 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:43:16,667 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:43:16,667 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:43:16,667 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:43:16,668 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:43:16,668 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:43:16,668 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:43:16,669 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:43:16,669 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:43:16,669 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:43:16,673 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:43:16,673 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:43:16,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:43:16 BasicIcfg [2023-11-30 04:43:16,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:43:16,680 INFO L158 Benchmark]: Toolchain (without parser) took 4143.29ms. Allocated memory is still 497.0MB. Free memory was 441.1MB in the beginning and 279.8MB in the end (delta: 161.3MB). Peak memory consumption was 163.4MB. Max. memory is 16.0GB. [2023-11-30 04:43:16,680 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 350.2MB. Free memory was 300.1MB in the beginning and 299.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:43:16,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.86ms. Allocated memory is still 497.0MB. Free memory was 440.8MB in the beginning and 412.2MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-11-30 04:43:16,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.87ms. Allocated memory is still 497.0MB. Free memory was 412.2MB in the beginning and 408.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:43:16,680 INFO L158 Benchmark]: Boogie Preprocessor took 57.12ms. Allocated memory is still 497.0MB. Free memory was 408.1MB in the beginning and 405.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-30 04:43:16,681 INFO L158 Benchmark]: RCFGBuilder took 802.42ms. Allocated memory is still 497.0MB. Free memory was 405.1MB in the beginning and 387.6MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-30 04:43:16,681 INFO L158 Benchmark]: TraceAbstraction took 2576.74ms. Allocated memory is still 497.0MB. Free memory was 386.6MB in the beginning and 279.8MB in the end (delta: 106.8MB). Peak memory consumption was 106.8MB. Max. memory is 16.0GB. [2023-11-30 04:43:16,682 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 350.2MB. Free memory was 300.1MB in the beginning and 299.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 614.86ms. Allocated memory is still 497.0MB. Free memory was 440.8MB in the beginning and 412.2MB in the end (delta: 28.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 85.87ms. Allocated memory is still 497.0MB. Free memory was 412.2MB in the beginning and 408.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 57.12ms. Allocated memory is still 497.0MB. Free memory was 408.1MB in the beginning and 405.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 802.42ms. Allocated memory is still 497.0MB. Free memory was 405.1MB in the beginning and 387.6MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 2576.74ms. Allocated memory is still 497.0MB. Free memory was 386.6MB in the beginning and 279.8MB in the end (delta: 106.8MB). Peak memory consumption was 106.8MB. 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, 200 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: 2.4s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 192 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 192 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=619occurred 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.9s InterpolantComputationTime, 572 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 564 ConstructedInterpolants, 0 QuantifiedInterpolants, 708 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:16,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...