/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/mix021.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:44:35,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:44:35,430 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:44:35,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:44:35,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:44:35,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:44:35,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:44:35,447 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:44:35,448 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:44:35,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:44:35,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:44:35,448 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:44:35,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:44:35,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:44:35,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:44:35,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:44:35,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:44:35,450 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:44:35,450 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:44:35,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:44:35,450 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:44:35,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:44:35,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:44:35,451 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:44:35,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:44:35,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:44:35,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:44:35,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:44:35,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:44:35,453 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:44:35,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:44:35,453 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:44:35,453 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:44:35,453 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:44:35,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:44:35,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:44:35,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:44:35,639 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:44:35,639 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:44:35,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021.opt.i [2023-11-30 04:44:36,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:44:36,866 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:44:36,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021.opt.i [2023-11-30 04:44:36,889 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2657aa8b/419d2bcc8e364353aa096502e15a459f/FLAGeca16c304 [2023-11-30 04:44:36,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2657aa8b/419d2bcc8e364353aa096502e15a459f [2023-11-30 04:44:36,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:44:36,907 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:44:36,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:44:36,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:44:36,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:44:36,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:44:36" (1/1) ... [2023-11-30 04:44:36,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25525713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:36, skipping insertion in model container [2023-11-30 04:44:36,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:44:36" (1/1) ... [2023-11-30 04:44:36,952 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:44:37,216 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:44:37,226 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:44:37,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:44:37,299 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:44:37,300 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:44:37,304 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:44:37,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37 WrapperNode [2023-11-30 04:44:37,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:44:37,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:44:37,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:44:37,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:44:37,310 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:44:37" (1/1) ... [2023-11-30 04:44:37,320 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:44:37" (1/1) ... [2023-11-30 04:44:37,343 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-11-30 04:44:37,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:44:37,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:44:37,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:44:37,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:44:37,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:44:37,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:44:37,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:44:37,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:44:37,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (1/1) ... [2023-11-30 04:44:37,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:44:37,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:44:37,413 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:44:37,443 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:44:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:44:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:44:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:44:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:44:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:44:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-30 04:44:37,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-30 04:44:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-30 04:44:37,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-30 04:44:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-30 04:44:37,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-30 04:44:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-30 04:44:37,464 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-30 04:44:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:44:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:44:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:44:37,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:44:37,466 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:44:37,602 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:44:37,607 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:44:37,914 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:44:38,024 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:44:38,024 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 04:44:38,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:44:38 BoogieIcfgContainer [2023-11-30 04:44:38,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:44:38,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:44:38,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:44:38,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:44:38,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:44:36" (1/3) ... [2023-11-30 04:44:38,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab4264f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:44:38, skipping insertion in model container [2023-11-30 04:44:38,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:44:37" (2/3) ... [2023-11-30 04:44:38,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab4264f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:44:38, skipping insertion in model container [2023-11-30 04:44:38,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:44:38" (3/3) ... [2023-11-30 04:44:38,034 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021.opt.i [2023-11-30 04:44:38,046 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:44:38,046 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-11-30 04:44:38,047 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:44:38,107 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:44:38,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 144 transitions, 304 flow [2023-11-30 04:44:38,186 INFO L124 PetriNetUnfolderBase]: 3/140 cut-off events. [2023-11-30 04:44:38,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:44:38,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 3/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-11-30 04:44:38,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 144 transitions, 304 flow [2023-11-30 04:44:38,195 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 91 transitions, 191 flow [2023-11-30 04:44:38,207 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:44:38,213 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;@58bce8c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:44:38,213 INFO L363 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-11-30 04:44:38,225 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:44:38,225 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2023-11-30 04:44:38,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:44:38,225 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:38,226 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] [2023-11-30 04:44:38,226 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:44:38,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1171594088, now seen corresponding path program 1 times [2023-11-30 04:44:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530190387] [2023-11-30 04:44:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:38,529 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:44:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:38,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530190387] [2023-11-30 04:44:38,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530190387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:38,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536829348] [2023-11-30 04:44:38,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:38,537 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:38,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:38,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:38,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:38,559 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2023-11-30 04:44:38,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 91 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:38,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2023-11-30 04:44:38,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:38,660 INFO L124 PetriNetUnfolderBase]: 2/102 cut-off events. [2023-11-30 04:44:38,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:44:38,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 102 events. 2/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 2 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 77. Up to 19 conditions per place. [2023-11-30 04:44:38,661 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 18 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2023-11-30 04:44:38,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 90 transitions, 227 flow [2023-11-30 04:44:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-11-30 04:44:38,679 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7962962962962963 [2023-11-30 04:44:38,680 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-11-30 04:44:38,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-11-30 04:44:38,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:38,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-11-30 04:44:38,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,698 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 1 predicate places. [2023-11-30 04:44:38,698 INFO L500 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 227 flow [2023-11-30 04:44:38,698 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,699 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:38,699 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] [2023-11-30 04:44:38,700 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:44:38,700 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:44:38,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1171594087, now seen corresponding path program 1 times [2023-11-30 04:44:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:38,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620419575] [2023-11-30 04:44:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:38,842 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:44:38,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:38,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620419575] [2023-11-30 04:44:38,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620419575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:38,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:38,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:38,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458605668] [2023-11-30 04:44:38,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:38,845 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:38,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:38,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:38,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:38,846 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2023-11-30 04:44:38,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:38,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2023-11-30 04:44:38,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:38,897 INFO L124 PetriNetUnfolderBase]: 3/107 cut-off events. [2023-11-30 04:44:38,897 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-30 04:44:38,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 107 events. 3/107 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 104 event pairs, 3 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 100. Up to 19 conditions per place. [2023-11-30 04:44:38,898 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 16 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2023-11-30 04:44:38,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 89 transitions, 257 flow [2023-11-30 04:44:38,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-30 04:44:38,900 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2023-11-30 04:44:38,900 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-30 04:44:38,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-30 04:44:38,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:38,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-30 04:44:38,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:44:38,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,903 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 2 predicate places. [2023-11-30 04:44:38,903 INFO L500 AbstractCegarLoop]: Abstraction has has 103 places, 89 transitions, 257 flow [2023-11-30 04:44:38,903 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,903 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:38,903 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] [2023-11-30 04:44:38,904 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:44:38,904 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:44:38,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1215887579, now seen corresponding path program 1 times [2023-11-30 04:44:38,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:38,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529409522] [2023-11-30 04:44:38,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:38,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:38,962 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:44:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529409522] [2023-11-30 04:44:38,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529409522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:38,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:38,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:38,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108959970] [2023-11-30 04:44:38,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:38,971 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:38,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:38,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:38,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:38,974 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2023-11-30 04:44:38,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 89 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:38,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:38,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2023-11-30 04:44:38,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:39,023 INFO L124 PetriNetUnfolderBase]: 3/106 cut-off events. [2023-11-30 04:44:39,023 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-30 04:44:39,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 106 events. 3/106 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 3 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 114. Up to 19 conditions per place. [2023-11-30 04:44:39,025 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 17 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2023-11-30 04:44:39,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 289 flow [2023-11-30 04:44:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-11-30 04:44:39,027 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7939814814814815 [2023-11-30 04:44:39,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-11-30 04:44:39,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-11-30 04:44:39,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:39,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-11-30 04:44:39,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,031 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 3 predicate places. [2023-11-30 04:44:39,031 INFO L500 AbstractCegarLoop]: Abstraction has has 104 places, 88 transitions, 289 flow [2023-11-30 04:44:39,032 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,032 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:39,032 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] [2023-11-30 04:44:39,032 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:44:39,032 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:44:39,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:39,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1215887578, now seen corresponding path program 1 times [2023-11-30 04:44:39,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:39,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052053681] [2023-11-30 04:44:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:39,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:39,134 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:44:39,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052053681] [2023-11-30 04:44:39,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052053681] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:39,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:39,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:39,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179018334] [2023-11-30 04:44:39,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:39,136 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:39,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:39,140 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2023-11-30 04:44:39,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 88 transitions, 289 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:39,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2023-11-30 04:44:39,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:39,179 INFO L124 PetriNetUnfolderBase]: 3/105 cut-off events. [2023-11-30 04:44:39,180 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-30 04:44:39,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 105 events. 3/105 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 96 event pairs, 3 based on Foata normal form. 1/106 useless extension candidates. Maximal degree in co-relation 126. Up to 18 conditions per place. [2023-11-30 04:44:39,180 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 15 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2023-11-30 04:44:39,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 87 transitions, 315 flow [2023-11-30 04:44:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:44:39,182 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8171296296296297 [2023-11-30 04:44:39,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:44:39,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:44:39,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:39,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:44:39,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,184 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,185 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 4 predicate places. [2023-11-30 04:44:39,185 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 315 flow [2023-11-30 04:44:39,185 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,185 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:39,185 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] [2023-11-30 04:44:39,186 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:44:39,186 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:44:39,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash 651588231, now seen corresponding path program 1 times [2023-11-30 04:44:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146584245] [2023-11-30 04:44:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:39,246 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:44:39,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:39,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146584245] [2023-11-30 04:44:39,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146584245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:39,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:39,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353990783] [2023-11-30 04:44:39,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:39,247 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:39,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:39,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:39,248 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2023-11-30 04:44:39,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:39,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2023-11-30 04:44:39,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:39,281 INFO L124 PetriNetUnfolderBase]: 3/104 cut-off events. [2023-11-30 04:44:39,281 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-11-30 04:44:39,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 104 events. 3/104 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 93 event pairs, 3 based on Foata normal form. 1/105 useless extension candidates. Maximal degree in co-relation 138. Up to 18 conditions per place. [2023-11-30 04:44:39,283 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 16 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2023-11-30 04:44:39,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 86 transitions, 343 flow [2023-11-30 04:44:39,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-11-30 04:44:39,284 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2023-11-30 04:44:39,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-11-30 04:44:39,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-11-30 04:44:39,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:39,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-11-30 04:44:39,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,288 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 5 predicate places. [2023-11-30 04:44:39,289 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 86 transitions, 343 flow [2023-11-30 04:44:39,289 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,289 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:39,289 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] [2023-11-30 04:44:39,290 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:44:39,292 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:44:39,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:39,293 INFO L85 PathProgramCache]: Analyzing trace with hash 651588232, now seen corresponding path program 1 times [2023-11-30 04:44:39,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065532734] [2023-11-30 04:44:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:39,356 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:44:39,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065532734] [2023-11-30 04:44:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065532734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:39,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:39,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:39,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377882313] [2023-11-30 04:44:39,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:39,358 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:39,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:39,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:39,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:39,360 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2023-11-30 04:44:39,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 86 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:39,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2023-11-30 04:44:39,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:39,395 INFO L124 PetriNetUnfolderBase]: 3/103 cut-off events. [2023-11-30 04:44:39,396 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-11-30 04:44:39,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 103 events. 3/103 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 89 event pairs, 3 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 148. Up to 17 conditions per place. [2023-11-30 04:44:39,396 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 14 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2023-11-30 04:44:39,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 85 transitions, 365 flow [2023-11-30 04:44:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:39,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2023-11-30 04:44:39,398 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2023-11-30 04:44:39,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2023-11-30 04:44:39,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2023-11-30 04:44:39,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:39,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2023-11-30 04:44:39,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,402 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 6 predicate places. [2023-11-30 04:44:39,402 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 365 flow [2023-11-30 04:44:39,403 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,403 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:39,403 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] [2023-11-30 04:44:39,403 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:44:39,403 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:44:39,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash 694540720, now seen corresponding path program 1 times [2023-11-30 04:44:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289640188] [2023-11-30 04:44:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:39,483 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:44:39,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:39,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289640188] [2023-11-30 04:44:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289640188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:39,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:39,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848451498] [2023-11-30 04:44:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:39,488 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:39,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:39,490 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2023-11-30 04:44:39,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 365 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:39,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2023-11-30 04:44:39,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:39,521 INFO L124 PetriNetUnfolderBase]: 2/90 cut-off events. [2023-11-30 04:44:39,521 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-30 04:44:39,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 90 events. 2/90 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 2/92 useless extension candidates. Maximal degree in co-relation 136. Up to 16 conditions per place. [2023-11-30 04:44:39,522 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 15 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2023-11-30 04:44:39,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 85 transitions, 403 flow [2023-11-30 04:44:39,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:39,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:39,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-11-30 04:44:39,523 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8171296296296297 [2023-11-30 04:44:39,523 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-11-30 04:44:39,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-11-30 04:44:39,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:39,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-11-30 04:44:39,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,525 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2023-11-30 04:44:39,525 INFO L500 AbstractCegarLoop]: Abstraction has has 108 places, 85 transitions, 403 flow [2023-11-30 04:44:39,526 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,526 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:44:39,526 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] [2023-11-30 04:44:39,526 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:44:39,526 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:44:39,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:44:39,526 INFO L85 PathProgramCache]: Analyzing trace with hash 694540719, now seen corresponding path program 1 times [2023-11-30 04:44:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:44:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120414884] [2023-11-30 04:44:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:44:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:44:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:44:39,587 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:44:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:44:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120414884] [2023-11-30 04:44:39,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120414884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:44:39,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:44:39,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:44:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444876533] [2023-11-30 04:44:39,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:44:39,588 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:44:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:44:39,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:44:39,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:44:39,589 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 144 [2023-11-30 04:44:39,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 85 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:44:39,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 144 [2023-11-30 04:44:39,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:44:39,610 INFO L124 PetriNetUnfolderBase]: 1/87 cut-off events. [2023-11-30 04:44:39,610 INFO L125 PetriNetUnfolderBase]: For 300/300 co-relation queries the response was YES. [2023-11-30 04:44:39,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 87 events. 1/87 cut-off events. For 300/300 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 128. Up to 15 conditions per place. [2023-11-30 04:44:39,611 INFO L140 encePairwiseOnDemand]: 142/144 looper letters, 0 selfloop transitions, 0 changer transitions 84/84 dead transitions. [2023-11-30 04:44:39,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 84 transitions, 425 flow [2023-11-30 04:44:39,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:44:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:44:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-11-30 04:44:39,612 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7893518518518519 [2023-11-30 04:44:39,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-11-30 04:44:39,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-11-30 04:44:39,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:44:39,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-11-30 04:44:39,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,614 INFO L307 CegarLoopForPetriNet]: 101 programPoint places, 8 predicate places. [2023-11-30 04:44:39,614 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 84 transitions, 425 flow [2023-11-30 04:44:39,614 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:44:39,619 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mix021.opt.i_BEv2_AllErrorsAtOnce [2023-11-30 04:44:39,636 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 12 remaining) [2023-11-30 04:44:39,636 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 12 remaining) [2023-11-30 04:44:39,636 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-11-30 04:44:39,636 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-11-30 04:44:39,636 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-11-30 04:44:39,637 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-11-30 04:44:39,637 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-11-30 04:44:39,637 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-11-30 04:44:39,637 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-11-30 04:44:39,637 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-11-30 04:44:39,637 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-11-30 04:44:39,637 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 12 remaining) [2023-11-30 04:44:39,637 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:44:39,638 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:44:39,640 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 04:44:39,640 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 04:44:39,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 04:44:39 BasicIcfg [2023-11-30 04:44:39,644 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 04:44:39,644 INFO L158 Benchmark]: Toolchain (without parser) took 2737.76ms. Allocated memory was 350.2MB in the beginning and 421.5MB in the end (delta: 71.3MB). Free memory was 308.4MB in the beginning and 358.9MB in the end (delta: -50.5MB). Peak memory consumption was 23.3MB. Max. memory is 16.0GB. [2023-11-30 04:44:39,644 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 350.2MB. Free memory is still 306.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 04:44:39,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.18ms. Allocated memory is still 350.2MB. Free memory was 308.0MB in the beginning and 283.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-11-30 04:44:39,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.50ms. Allocated memory is still 350.2MB. Free memory was 283.5MB in the beginning and 281.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:44:39,645 INFO L158 Benchmark]: Boogie Preprocessor took 33.96ms. Allocated memory is still 350.2MB. Free memory was 281.0MB in the beginning and 278.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 04:44:39,645 INFO L158 Benchmark]: RCFGBuilder took 647.32ms. Allocated memory was 350.2MB in the beginning and 421.5MB in the end (delta: 71.3MB). Free memory was 278.5MB in the beginning and 378.3MB in the end (delta: -99.9MB). Peak memory consumption was 39.5MB. Max. memory is 16.0GB. [2023-11-30 04:44:39,645 INFO L158 Benchmark]: TraceAbstraction took 1617.27ms. Allocated memory is still 421.5MB. Free memory was 377.3MB in the beginning and 358.9MB in the end (delta: 18.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.0GB. [2023-11-30 04:44:39,646 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 350.2MB. Free memory is still 306.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 397.18ms. Allocated memory is still 350.2MB. Free memory was 308.0MB in the beginning and 283.9MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.50ms. Allocated memory is still 350.2MB. Free memory was 283.5MB in the beginning and 281.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.96ms. Allocated memory is still 350.2MB. Free memory was 281.0MB in the beginning and 278.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 647.32ms. Allocated memory was 350.2MB in the beginning and 421.5MB in the end (delta: 71.3MB). Free memory was 278.5MB in the beginning and 378.3MB in the end (delta: -99.9MB). Peak memory consumption was 39.5MB. Max. memory is 16.0GB. * TraceAbstraction took 1617.27ms. Allocated memory is still 421.5MB. Free memory was 377.3MB in the beginning and 358.9MB in the end (delta: 18.4MB). Peak memory consumption was 19.5MB. 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, 179 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 60 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=425occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 420 NumberOfCodeBlocks, 420 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 412 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 04:44:39,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...