/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 20:58:18,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 20:58:18,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 20:58:18,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 20:58:18,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 20:58:18,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 20:58:18,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 20:58:18,610 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 20:58:18,611 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 20:58:18,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 20:58:18,615 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 20:58:18,615 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 20:58:18,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 20:58:18,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 20:58:18,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 20:58:18,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 20:58:18,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 20:58:18,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 20:58:18,618 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 20:58:18,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 20:58:18,618 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 20:58:18,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 20:58:18,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 20:58:18,619 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 20:58:18,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 20:58:18,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:58:18,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 20:58:18,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 20:58:18,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 20:58:18,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 20:58:18,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 20:58:18,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 20:58:18,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 20:58:18,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-12-05 20:58:18,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 20:58:18,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 20:58:18,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 20:58:18,872 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 20:58:18,872 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 20:58:18,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2023-12-05 20:58:20,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 20:58:20,297 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 20:58:20,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/singleton_with-uninit-problems.i [2023-12-05 20:58:20,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7032d1f2a/65a9772ad4404a9e9d002c399db1e7d8/FLAGf6231880a [2023-12-05 20:58:20,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7032d1f2a/65a9772ad4404a9e9d002c399db1e7d8 [2023-12-05 20:58:20,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 20:58:20,326 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 20:58:20,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 20:58:20,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 20:58:20,333 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 20:58:20,334 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:20,335 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff8d602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20, skipping insertion in model container [2023-12-05 20:58:20,335 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:20,387 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 20:58:20,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:58:20,838 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 20:58:20,880 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:58:20,928 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 20:58:20,928 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-05 20:58:20,935 INFO L206 MainTranslator]: Completed translation [2023-12-05 20:58:20,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20 WrapperNode [2023-12-05 20:58:20,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 20:58:20,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 20:58:20,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 20:58:20,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 20:58:20,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:20,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:20,971 INFO L138 Inliner]: procedures = 324, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 43 [2023-12-05 20:58:20,971 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 20:58:20,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 20:58:20,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 20:58:20,971 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 20:58:20,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:20,991 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:20,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:20,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:21,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:21,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:21,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:21,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:21,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 20:58:21,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 20:58:21,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 20:58:21,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 20:58:21,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (1/1) ... [2023-12-05 20:58:21,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:58:21,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:58:21,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 20:58:21,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 20:58:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-05 20:58:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 20:58:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 20:58:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-05 20:58:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 20:58:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread0 [2023-12-05 20:58:21,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thread0 [2023-12-05 20:58:21,079 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-05 20:58:21,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-05 20:58:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-05 20:58:21,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-05 20:58:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-05 20:58:21,080 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-05 20:58:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 20:58:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-05 20:58:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 20:58:21,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 20:58:21,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 20:58:21,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 20:58:21,082 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 20:58:21,194 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 20:58:21,195 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 20:58:21,485 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 20:58:21,515 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 20:58:21,515 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-05 20:58:21,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:58:21 BoogieIcfgContainer [2023-12-05 20:58:21,517 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 20:58:21,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 20:58:21,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 20:58:21,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 20:58:21,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:58:20" (1/3) ... [2023-12-05 20:58:21,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff906a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:58:21, skipping insertion in model container [2023-12-05 20:58:21,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:20" (2/3) ... [2023-12-05 20:58:21,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff906a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:58:21, skipping insertion in model container [2023-12-05 20:58:21,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:58:21" (3/3) ... [2023-12-05 20:58:21,524 INFO L112 eAbstractionObserver]: Analyzing ICFG singleton_with-uninit-problems.i [2023-12-05 20:58:21,536 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 20:58:21,536 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-12-05 20:58:21,537 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 20:58:21,678 INFO L144 ThreadInstanceAdder]: Constructed 21 joinOtherThreadTransitions. [2023-12-05 20:58:21,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 253 transitions, 603 flow [2023-12-05 20:58:21,811 INFO L124 PetriNetUnfolderBase]: 8/174 cut-off events. [2023-12-05 20:58:21,812 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 20:58:21,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 174 events. 8/174 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 186 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 150. Up to 3 conditions per place. [2023-12-05 20:58:21,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 253 transitions, 603 flow [2023-12-05 20:58:21,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 148 transitions, 347 flow [2023-12-05 20:58:21,843 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:58:21,849 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;@4307e9a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:58:21,850 INFO L363 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2023-12-05 20:58:21,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:58:21,853 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-12-05 20:58:21,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:58:21,853 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:21,854 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:21,854 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:21,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 116956288, now seen corresponding path program 1 times [2023-12-05 20:58:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:21,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578281875] [2023-12-05 20:58:21,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:21,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:22,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:22,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578281875] [2023-12-05 20:58:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578281875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:22,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:22,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171658123] [2023-12-05 20:58:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:22,179 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:22,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:22,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:22,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:22,213 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 255 [2023-12-05 20:58:22,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 148 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:22,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:22,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 255 [2023-12-05 20:58:22,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:25,016 INFO L124 PetriNetUnfolderBase]: 12080/19283 cut-off events. [2023-12-05 20:58:25,017 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2023-12-05 20:58:25,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36317 conditions, 19283 events. 12080/19283 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 1424. Compared 145795 event pairs, 11813 based on Foata normal form. 0/9013 useless extension candidates. Maximal degree in co-relation 36256. Up to 15949 conditions per place. [2023-12-05 20:58:25,296 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 76 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2023-12-05 20:58:25,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 157 transitions, 534 flow [2023-12-05 20:58:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:25,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2023-12-05 20:58:25,318 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6562091503267974 [2023-12-05 20:58:25,319 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2023-12-05 20:58:25,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2023-12-05 20:58:25,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:25,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2023-12-05 20:58:25,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,338 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,345 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 1 predicate places. [2023-12-05 20:58:25,345 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 157 transitions, 534 flow [2023-12-05 20:58:25,346 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,346 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:25,346 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:25,346 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 20:58:25,346 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:25,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:25,347 INFO L85 PathProgramCache]: Analyzing trace with hash 116956289, now seen corresponding path program 1 times [2023-12-05 20:58:25,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:25,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959544099] [2023-12-05 20:58:25,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:25,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:25,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:25,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:25,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959544099] [2023-12-05 20:58:25,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959544099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:25,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:25,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:25,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134591918] [2023-12-05 20:58:25,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:25,472 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:25,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:25,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:25,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:25,474 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 255 [2023-12-05 20:58:25,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 157 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:25,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:25,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 255 [2023-12-05 20:58:25,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:28,501 INFO L124 PetriNetUnfolderBase]: 16253/24708 cut-off events. [2023-12-05 20:58:28,501 INFO L125 PetriNetUnfolderBase]: For 3849/6913 co-relation queries the response was YES. [2023-12-05 20:58:28,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66029 conditions, 24708 events. 16253/24708 cut-off events. For 3849/6913 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 182513 event pairs, 14275 based on Foata normal form. 0/11556 useless extension candidates. Maximal degree in co-relation 65955. Up to 20110 conditions per place. [2023-12-05 20:58:28,842 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 71 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2023-12-05 20:58:28,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 686 flow [2023-12-05 20:58:28,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2023-12-05 20:58:28,844 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.681045751633987 [2023-12-05 20:58:28,844 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2023-12-05 20:58:28,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2023-12-05 20:58:28,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:28,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2023-12-05 20:58:28,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,850 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 2 predicate places. [2023-12-05 20:58:28,850 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 159 transitions, 686 flow [2023-12-05 20:58:28,851 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:28,851 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:28,851 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:28,851 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 20:58:28,852 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:28,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1750929611, now seen corresponding path program 1 times [2023-12-05 20:58:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210284908] [2023-12-05 20:58:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:29,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:29,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210284908] [2023-12-05 20:58:29,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210284908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:29,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:29,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:29,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700316665] [2023-12-05 20:58:29,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:29,268 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:58:29,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:29,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:58:29,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:58:29,270 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-12-05 20:58:29,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 159 transitions, 686 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:29,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:29,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-12-05 20:58:29,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:32,087 INFO L124 PetriNetUnfolderBase]: 16244/24676 cut-off events. [2023-12-05 20:58:32,088 INFO L125 PetriNetUnfolderBase]: For 9527/21779 co-relation queries the response was YES. [2023-12-05 20:58:32,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87384 conditions, 24676 events. 16244/24676 cut-off events. For 9527/21779 co-relation queries the response was YES. Maximal size of possible extension queue 1842. Compared 182475 event pairs, 14256 based on Foata normal form. 14/11538 useless extension candidates. Maximal degree in co-relation 87291. Up to 21353 conditions per place. [2023-12-05 20:58:32,424 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 93 selfloop transitions, 3 changer transitions 0/158 dead transitions. [2023-12-05 20:58:32,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 158 transitions, 882 flow [2023-12-05 20:58:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 20:58:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 20:58:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 573 transitions. [2023-12-05 20:58:32,427 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5617647058823529 [2023-12-05 20:58:32,427 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 573 transitions. [2023-12-05 20:58:32,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 573 transitions. [2023-12-05 20:58:32,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:32,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 573 transitions. [2023-12-05 20:58:32,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.25) internal successors, (573), 4 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:32,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:32,431 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:32,432 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 1 predicate places. [2023-12-05 20:58:32,432 INFO L500 AbstractCegarLoop]: Abstraction has has 163 places, 158 transitions, 882 flow [2023-12-05 20:58:32,433 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:32,433 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:32,433 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:32,433 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 20:58:32,433 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:32,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2113810933, now seen corresponding path program 1 times [2023-12-05 20:58:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548784272] [2023-12-05 20:58:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:32,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:32,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:32,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548784272] [2023-12-05 20:58:32,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548784272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:32,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:32,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:32,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039532717] [2023-12-05 20:58:32,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:32,967 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:32,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:32,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:32,969 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2023-12-05 20:58:32,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 158 transitions, 882 flow. Second operand has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:32,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:32,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2023-12-05 20:58:32,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:34,794 INFO L124 PetriNetUnfolderBase]: 10263/15911 cut-off events. [2023-12-05 20:58:34,794 INFO L125 PetriNetUnfolderBase]: For 13024/27304 co-relation queries the response was YES. [2023-12-05 20:58:34,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69790 conditions, 15911 events. 10263/15911 cut-off events. For 13024/27304 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 113543 event pairs, 8373 based on Foata normal form. 0/8285 useless extension candidates. Maximal degree in co-relation 69676. Up to 13680 conditions per place. [2023-12-05 20:58:35,009 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 88 selfloop transitions, 9 changer transitions 0/157 dead transitions. [2023-12-05 20:58:35,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 157 transitions, 1064 flow [2023-12-05 20:58:35,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 20:58:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 20:58:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2023-12-05 20:58:35,012 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5349019607843137 [2023-12-05 20:58:35,012 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2023-12-05 20:58:35,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2023-12-05 20:58:35,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:35,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2023-12-05 20:58:35,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:35,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:35,018 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:35,021 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 4 predicate places. [2023-12-05 20:58:35,022 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 157 transitions, 1064 flow [2023-12-05 20:58:35,023 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.125) internal successors, (953), 8 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:35,023 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:35,023 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:35,023 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 20:58:35,023 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:35,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:35,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1014141904, now seen corresponding path program 1 times [2023-12-05 20:58:35,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:35,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565800786] [2023-12-05 20:58:35,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:35,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565800786] [2023-12-05 20:58:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565800786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792048029] [2023-12-05 20:58:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:35,292 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:35,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:35,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:35,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:35,294 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 255 [2023-12-05 20:58:35,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 157 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:35,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:35,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 255 [2023-12-05 20:58:35,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:36,764 INFO L124 PetriNetUnfolderBase]: 8472/13356 cut-off events. [2023-12-05 20:58:36,765 INFO L125 PetriNetUnfolderBase]: For 21593/41489 co-relation queries the response was YES. [2023-12-05 20:58:36,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69612 conditions, 13356 events. 8472/13356 cut-off events. For 21593/41489 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 94017 event pairs, 6839 based on Foata normal form. 130/7267 useless extension candidates. Maximal degree in co-relation 69483. Up to 11373 conditions per place. [2023-12-05 20:58:36,989 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 82 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2023-12-05 20:58:36,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 156 transitions, 1226 flow [2023-12-05 20:58:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-12-05 20:58:36,991 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2023-12-05 20:58:36,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-12-05 20:58:36,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-12-05 20:58:36,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:36,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-12-05 20:58:36,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,998 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 4 predicate places. [2023-12-05 20:58:36,998 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 156 transitions, 1226 flow [2023-12-05 20:58:36,999 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:36,999 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:36,999 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:37,002 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 20:58:37,003 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:37,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:37,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1014141903, now seen corresponding path program 1 times [2023-12-05 20:58:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:37,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830205481] [2023-12-05 20:58:37,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:37,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:37,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830205481] [2023-12-05 20:58:37,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830205481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:37,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820883753] [2023-12-05 20:58:37,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:37,436 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:37,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:37,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:37,438 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2023-12-05 20:58:37,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 156 transitions, 1226 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:37,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:37,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2023-12-05 20:58:37,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:38,643 INFO L124 PetriNetUnfolderBase]: 6687/10801 cut-off events. [2023-12-05 20:58:38,643 INFO L125 PetriNetUnfolderBase]: For 28007/47879 co-relation queries the response was YES. [2023-12-05 20:58:38,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65209 conditions, 10801 events. 6687/10801 cut-off events. For 28007/47879 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 75436 event pairs, 5298 based on Foata normal form. 130/6120 useless extension candidates. Maximal degree in co-relation 65060. Up to 9074 conditions per place. [2023-12-05 20:58:38,781 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 94 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2023-12-05 20:58:38,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 158 transitions, 1452 flow [2023-12-05 20:58:38,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 20:58:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 20:58:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 675 transitions. [2023-12-05 20:58:38,784 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2023-12-05 20:58:38,784 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 675 transitions. [2023-12-05 20:58:38,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 675 transitions. [2023-12-05 20:58:38,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:38,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 675 transitions. [2023-12-05 20:58:38,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.0) internal successors, (675), 5 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,789 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,789 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 6 predicate places. [2023-12-05 20:58:38,789 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 158 transitions, 1452 flow [2023-12-05 20:58:38,790 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,790 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:38,790 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:38,790 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 20:58:38,790 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:38,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1501066136, now seen corresponding path program 1 times [2023-12-05 20:58:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:38,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80236209] [2023-12-05 20:58:38,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:38,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:38,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:38,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80236209] [2023-12-05 20:58:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80236209] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:38,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:38,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:38,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475972297] [2023-12-05 20:58:38,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:38,860 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:58:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:38,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:58:38,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:58:38,862 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 255 [2023-12-05 20:58:38,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 158 transitions, 1452 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:38,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:38,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 255 [2023-12-05 20:58:38,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:39,563 INFO L124 PetriNetUnfolderBase]: 2381/4257 cut-off events. [2023-12-05 20:58:39,564 INFO L125 PetriNetUnfolderBase]: For 13797/17925 co-relation queries the response was YES. [2023-12-05 20:58:39,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27724 conditions, 4257 events. 2381/4257 cut-off events. For 13797/17925 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 27221 event pairs, 1792 based on Foata normal form. 2/2932 useless extension candidates. Maximal degree in co-relation 27569. Up to 3348 conditions per place. [2023-12-05 20:58:39,625 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 82 selfloop transitions, 6 changer transitions 0/154 dead transitions. [2023-12-05 20:58:39,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 154 transitions, 1576 flow [2023-12-05 20:58:39,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 20:58:39,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 20:58:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 772 transitions. [2023-12-05 20:58:39,628 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6054901960784314 [2023-12-05 20:58:39,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 772 transitions. [2023-12-05 20:58:39,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 772 transitions. [2023-12-05 20:58:39,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:39,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 772 transitions. [2023-12-05 20:58:39,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,634 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,634 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 5 predicate places. [2023-12-05 20:58:39,634 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 154 transitions, 1576 flow [2023-12-05 20:58:39,635 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,635 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:39,635 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:39,635 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 20:58:39,635 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:39,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1501066135, now seen corresponding path program 1 times [2023-12-05 20:58:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843141659] [2023-12-05 20:58:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:39,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843141659] [2023-12-05 20:58:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843141659] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436921087] [2023-12-05 20:58:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:39,769 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:58:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:58:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:58:39,770 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 255 [2023-12-05 20:58:39,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 154 transitions, 1576 flow. Second operand has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:39,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:39,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 255 [2023-12-05 20:58:39,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:40,180 INFO L124 PetriNetUnfolderBase]: 579/1319 cut-off events. [2023-12-05 20:58:40,180 INFO L125 PetriNetUnfolderBase]: For 6491/7163 co-relation queries the response was YES. [2023-12-05 20:58:40,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8588 conditions, 1319 events. 579/1319 cut-off events. For 6491/7163 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 7016 event pairs, 370 based on Foata normal form. 4/1233 useless extension candidates. Maximal degree in co-relation 8444. Up to 886 conditions per place. [2023-12-05 20:58:40,193 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 63 selfloop transitions, 3 changer transitions 4/146 dead transitions. [2023-12-05 20:58:40,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 146 transitions, 1600 flow [2023-12-05 20:58:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 20:58:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 20:58:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 820 transitions. [2023-12-05 20:58:40,199 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6431372549019608 [2023-12-05 20:58:40,199 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 820 transitions. [2023-12-05 20:58:40,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 820 transitions. [2023-12-05 20:58:40,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:40,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 820 transitions. [2023-12-05 20:58:40,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,205 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,206 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 3 predicate places. [2023-12-05 20:58:40,206 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 146 transitions, 1600 flow [2023-12-05 20:58:40,207 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,207 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:40,207 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:40,207 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 20:58:40,207 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:40,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:40,208 INFO L85 PathProgramCache]: Analyzing trace with hash 871862987, now seen corresponding path program 1 times [2023-12-05 20:58:40,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:40,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42692398] [2023-12-05 20:58:40,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:40,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:40,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:40,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42692398] [2023-12-05 20:58:40,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42692398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:40,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948580591] [2023-12-05 20:58:40,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:40,406 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:40,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:40,408 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 255 [2023-12-05 20:58:40,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 146 transitions, 1600 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:40,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 255 [2023-12-05 20:58:40,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:40,620 INFO L124 PetriNetUnfolderBase]: 545/1262 cut-off events. [2023-12-05 20:58:40,620 INFO L125 PetriNetUnfolderBase]: For 8254/9018 co-relation queries the response was YES. [2023-12-05 20:58:40,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8978 conditions, 1262 events. 545/1262 cut-off events. For 8254/9018 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6679 event pairs, 345 based on Foata normal form. 18/1192 useless extension candidates. Maximal degree in co-relation 8821. Up to 830 conditions per place. [2023-12-05 20:58:40,636 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 75 selfloop transitions, 2 changer transitions 4/145 dead transitions. [2023-12-05 20:58:40,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 145 transitions, 1748 flow [2023-12-05 20:58:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:40,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-12-05 20:58:40,639 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6326797385620915 [2023-12-05 20:58:40,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-12-05 20:58:40,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-12-05 20:58:40,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:40,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-12-05 20:58:40,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,643 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 3 predicate places. [2023-12-05 20:58:40,643 INFO L500 AbstractCegarLoop]: Abstraction has has 165 places, 145 transitions, 1748 flow [2023-12-05 20:58:40,643 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,643 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:40,643 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:40,644 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 20:58:40,644 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:40,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:40,644 INFO L85 PathProgramCache]: Analyzing trace with hash 871862988, now seen corresponding path program 1 times [2023-12-05 20:58:40,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:40,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836874367] [2023-12-05 20:58:40,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:40,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:40,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:40,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:40,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836874367] [2023-12-05 20:58:40,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836874367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:40,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:40,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716611416] [2023-12-05 20:58:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:40,886 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:40,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:40,888 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2023-12-05 20:58:40,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 145 transitions, 1748 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:40,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:40,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2023-12-05 20:58:40,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:41,196 INFO L124 PetriNetUnfolderBase]: 509/1202 cut-off events. [2023-12-05 20:58:41,196 INFO L125 PetriNetUnfolderBase]: For 9512/10364 co-relation queries the response was YES. [2023-12-05 20:58:41,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9303 conditions, 1202 events. 509/1202 cut-off events. For 9512/10364 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6315 event pairs, 318 based on Foata normal form. 18/1134 useless extension candidates. Maximal degree in co-relation 9132. Up to 774 conditions per place. [2023-12-05 20:58:41,211 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 79 selfloop transitions, 5 changer transitions 4/145 dead transitions. [2023-12-05 20:58:41,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 145 transitions, 1930 flow [2023-12-05 20:58:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 20:58:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 20:58:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-12-05 20:58:41,213 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5176470588235295 [2023-12-05 20:58:41,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-12-05 20:58:41,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-12-05 20:58:41,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:41,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-12-05 20:58:41,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,218 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,219 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 5 predicate places. [2023-12-05 20:58:41,219 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 145 transitions, 1930 flow [2023-12-05 20:58:41,221 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,221 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:41,221 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:41,221 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 20:58:41,221 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:41,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:41,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1693534316, now seen corresponding path program 1 times [2023-12-05 20:58:41,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:41,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073878732] [2023-12-05 20:58:41,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:41,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:41,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:41,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073878732] [2023-12-05 20:58:41,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073878732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:41,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:41,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:41,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159579149] [2023-12-05 20:58:41,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:41,341 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:41,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:41,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:41,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:41,342 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 255 [2023-12-05 20:58:41,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 145 transitions, 1930 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:41,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 255 [2023-12-05 20:58:41,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:41,543 INFO L124 PetriNetUnfolderBase]: 487/1157 cut-off events. [2023-12-05 20:58:41,543 INFO L125 PetriNetUnfolderBase]: For 11233/12153 co-relation queries the response was YES. [2023-12-05 20:58:41,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9671 conditions, 1157 events. 487/1157 cut-off events. For 11233/12153 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5976 event pairs, 303 based on Foata normal form. 12/1087 useless extension candidates. Maximal degree in co-relation 9487. Up to 734 conditions per place. [2023-12-05 20:58:41,558 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 76 selfloop transitions, 2 changer transitions 4/144 dead transitions. [2023-12-05 20:58:41,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 144 transitions, 2076 flow [2023-12-05 20:58:41,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-12-05 20:58:41,560 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6300653594771242 [2023-12-05 20:58:41,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-12-05 20:58:41,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-12-05 20:58:41,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:41,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-12-05 20:58:41,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,564 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,564 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 5 predicate places. [2023-12-05 20:58:41,564 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 144 transitions, 2076 flow [2023-12-05 20:58:41,565 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,565 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:41,565 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:41,565 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 20:58:41,565 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:41,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1693534317, now seen corresponding path program 1 times [2023-12-05 20:58:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:41,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680661512] [2023-12-05 20:58:41,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:41,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680661512] [2023-12-05 20:58:41,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680661512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:41,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:41,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 20:58:41,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001984338] [2023-12-05 20:58:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:41,786 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 20:58:41,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:41,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 20:58:41,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-05 20:58:41,787 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2023-12-05 20:58:41,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 144 transitions, 2076 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:41,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:41,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2023-12-05 20:58:41,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:42,089 INFO L124 PetriNetUnfolderBase]: 463/1109 cut-off events. [2023-12-05 20:58:42,089 INFO L125 PetriNetUnfolderBase]: For 12531/13487 co-relation queries the response was YES. [2023-12-05 20:58:42,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9998 conditions, 1109 events. 463/1109 cut-off events. For 12531/13487 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5714 event pairs, 286 based on Foata normal form. 12/1043 useless extension candidates. Maximal degree in co-relation 9800. Up to 694 conditions per place. [2023-12-05 20:58:42,102 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 78 selfloop transitions, 5 changer transitions 4/144 dead transitions. [2023-12-05 20:58:42,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 144 transitions, 2260 flow [2023-12-05 20:58:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-05 20:58:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-05 20:58:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-12-05 20:58:42,105 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5145098039215686 [2023-12-05 20:58:42,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-12-05 20:58:42,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-12-05 20:58:42,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:42,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-12-05 20:58:42,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,109 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,110 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 7 predicate places. [2023-12-05 20:58:42,110 INFO L500 AbstractCegarLoop]: Abstraction has has 169 places, 144 transitions, 2260 flow [2023-12-05 20:58:42,111 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,111 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:42,111 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:42,111 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 20:58:42,111 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:42,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1203286164, now seen corresponding path program 1 times [2023-12-05 20:58:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:42,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772741732] [2023-12-05 20:58:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:42,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:42,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:42,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772741732] [2023-12-05 20:58:42,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772741732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:42,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:42,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:42,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757103240] [2023-12-05 20:58:42,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:42,242 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:58:42,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:42,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:58:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:58:42,243 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-12-05 20:58:42,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 144 transitions, 2260 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:42,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-12-05 20:58:42,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:42,432 INFO L124 PetriNetUnfolderBase]: 393/969 cut-off events. [2023-12-05 20:58:42,432 INFO L125 PetriNetUnfolderBase]: For 14182/15174 co-relation queries the response was YES. [2023-12-05 20:58:42,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9309 conditions, 969 events. 393/969 cut-off events. For 14182/15174 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4631 event pairs, 234 based on Foata normal form. 24/931 useless extension candidates. Maximal degree in co-relation 9098. Up to 596 conditions per place. [2023-12-05 20:58:42,445 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 76 selfloop transitions, 3 changer transitions 4/143 dead transitions. [2023-12-05 20:58:42,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 143 transitions, 2422 flow [2023-12-05 20:58:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 20:58:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 20:58:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2023-12-05 20:58:42,448 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5323529411764706 [2023-12-05 20:58:42,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2023-12-05 20:58:42,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2023-12-05 20:58:42,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:42,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2023-12-05 20:58:42,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,451 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,452 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 6 predicate places. [2023-12-05 20:58:42,452 INFO L500 AbstractCegarLoop]: Abstraction has has 168 places, 143 transitions, 2422 flow [2023-12-05 20:58:42,453 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:42,453 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:42,453 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:42,453 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 20:58:42,453 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:42,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1911032336, now seen corresponding path program 1 times [2023-12-05 20:58:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267703539] [2023-12-05 20:58:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:43,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267703539] [2023-12-05 20:58:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267703539] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:43,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:43,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 20:58:43,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570504108] [2023-12-05 20:58:43,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:43,215 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 20:58:43,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:43,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 20:58:43,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-12-05 20:58:43,218 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-12-05 20:58:43,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 143 transitions, 2422 flow. Second operand has 15 states, 15 states have (on average 123.93333333333334) internal successors, (1859), 15 states have internal predecessors, (1859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:43,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-12-05 20:58:43,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:43,546 INFO L124 PetriNetUnfolderBase]: 391/965 cut-off events. [2023-12-05 20:58:43,546 INFO L125 PetriNetUnfolderBase]: For 14275/15055 co-relation queries the response was YES. [2023-12-05 20:58:43,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9921 conditions, 965 events. 391/965 cut-off events. For 14275/15055 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4607 event pairs, 234 based on Foata normal form. 2/905 useless extension candidates. Maximal degree in co-relation 9695. Up to 596 conditions per place. [2023-12-05 20:58:43,561 INFO L140 encePairwiseOnDemand]: 240/255 looper letters, 72 selfloop transitions, 18 changer transitions 4/146 dead transitions. [2023-12-05 20:58:43,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 146 transitions, 2624 flow [2023-12-05 20:58:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 20:58:43,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 20:58:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1410 transitions. [2023-12-05 20:58:43,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5026737967914439 [2023-12-05 20:58:43,565 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1410 transitions. [2023-12-05 20:58:43,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1410 transitions. [2023-12-05 20:58:43,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:43,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1410 transitions. [2023-12-05 20:58:43,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.1818181818182) internal successors, (1410), 11 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,573 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,575 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 16 predicate places. [2023-12-05 20:58:43,575 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 146 transitions, 2624 flow [2023-12-05 20:58:43,575 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 123.93333333333334) internal successors, (1859), 15 states have internal predecessors, (1859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:43,576 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:43,576 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:43,576 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 20:58:43,576 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:43,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1968171931, now seen corresponding path program 1 times [2023-12-05 20:58:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:43,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061297342] [2023-12-05 20:58:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:44,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061297342] [2023-12-05 20:58:44,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061297342] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:44,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:44,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 20:58:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329461071] [2023-12-05 20:58:44,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:44,417 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 20:58:44,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:44,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 20:58:44,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-12-05 20:58:44,420 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-12-05 20:58:44,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 146 transitions, 2624 flow. Second operand has 15 states, 15 states have (on average 124.06666666666666) internal successors, (1861), 15 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:44,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-12-05 20:58:44,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:44,818 INFO L124 PetriNetUnfolderBase]: 389/961 cut-off events. [2023-12-05 20:58:44,818 INFO L125 PetriNetUnfolderBase]: For 16185/17025 co-relation queries the response was YES. [2023-12-05 20:58:44,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10525 conditions, 961 events. 389/961 cut-off events. For 16185/17025 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4587 event pairs, 234 based on Foata normal form. 2/901 useless extension candidates. Maximal degree in co-relation 10284. Up to 596 conditions per place. [2023-12-05 20:58:44,836 INFO L140 encePairwiseOnDemand]: 241/255 looper letters, 73 selfloop transitions, 17 changer transitions 4/146 dead transitions. [2023-12-05 20:58:44,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 146 transitions, 2810 flow [2023-12-05 20:58:44,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-05 20:58:44,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-05 20:58:44,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1408 transitions. [2023-12-05 20:58:44,840 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2023-12-05 20:58:44,840 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1408 transitions. [2023-12-05 20:58:44,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1408 transitions. [2023-12-05 20:58:44,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:44,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1408 transitions. [2023-12-05 20:58:44,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,849 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,850 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 26 predicate places. [2023-12-05 20:58:44,850 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 146 transitions, 2810 flow [2023-12-05 20:58:44,851 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.06666666666666) internal successors, (1861), 15 states have internal predecessors, (1861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:44,851 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:44,851 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:44,851 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 20:58:44,851 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:44,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash 739587118, now seen corresponding path program 1 times [2023-12-05 20:58:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:44,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708708087] [2023-12-05 20:58:44,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:44,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:45,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708708087] [2023-12-05 20:58:45,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708708087] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:45,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:45,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 20:58:45,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905999072] [2023-12-05 20:58:45,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:45,614 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 20:58:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:45,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 20:58:45,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-12-05 20:58:45,616 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-12-05 20:58:45,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 146 transitions, 2810 flow. Second operand has 15 states, 15 states have (on average 124.2) internal successors, (1863), 15 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:45,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:45,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-12-05 20:58:45,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:46,019 INFO L124 PetriNetUnfolderBase]: 387/956 cut-off events. [2023-12-05 20:58:46,019 INFO L125 PetriNetUnfolderBase]: For 18048/18948 co-relation queries the response was YES. [2023-12-05 20:58:46,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11120 conditions, 956 events. 387/956 cut-off events. For 18048/18948 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4549 event pairs, 234 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 10864. Up to 596 conditions per place. [2023-12-05 20:58:46,036 INFO L140 encePairwiseOnDemand]: 240/255 looper letters, 72 selfloop transitions, 18 changer transitions 4/146 dead transitions. [2023-12-05 20:58:46,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 146 transitions, 2996 flow [2023-12-05 20:58:46,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 20:58:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 20:58:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1650 transitions. [2023-12-05 20:58:46,059 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.497737556561086 [2023-12-05 20:58:46,060 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1650 transitions. [2023-12-05 20:58:46,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1650 transitions. [2023-12-05 20:58:46,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:46,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1650 transitions. [2023-12-05 20:58:46,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 126.92307692307692) internal successors, (1650), 13 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:46,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:46,070 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:46,071 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 38 predicate places. [2023-12-05 20:58:46,071 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 146 transitions, 2996 flow [2023-12-05 20:58:46,073 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.2) internal successors, (1863), 15 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:46,073 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:46,073 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:46,073 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 20:58:46,074 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:46,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:46,074 INFO L85 PathProgramCache]: Analyzing trace with hash -526035665, now seen corresponding path program 1 times [2023-12-05 20:58:46,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:46,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132017233] [2023-12-05 20:58:46,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:46,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:46,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:46,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132017233] [2023-12-05 20:58:46,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132017233] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:46,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:46,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-05 20:58:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023601057] [2023-12-05 20:58:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:46,909 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-05 20:58:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-05 20:58:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-12-05 20:58:46,912 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2023-12-05 20:58:46,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 146 transitions, 2996 flow. Second operand has 15 states, 15 states have (on average 124.33333333333333) internal successors, (1865), 15 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:46,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:46,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2023-12-05 20:58:46,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:47,347 INFO L124 PetriNetUnfolderBase]: 386/952 cut-off events. [2023-12-05 20:58:47,348 INFO L125 PetriNetUnfolderBase]: For 20186/21146 co-relation queries the response was YES. [2023-12-05 20:58:47,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11724 conditions, 952 events. 386/952 cut-off events. For 20186/21146 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4522 event pairs, 234 based on Foata normal form. 2/892 useless extension candidates. Maximal degree in co-relation 11453. Up to 596 conditions per place. [2023-12-05 20:58:47,365 INFO L140 encePairwiseOnDemand]: 241/255 looper letters, 72 selfloop transitions, 16 changer transitions 4/144 dead transitions. [2023-12-05 20:58:47,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 144 transitions, 3112 flow [2023-12-05 20:58:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 20:58:47,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 20:58:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1645 transitions. [2023-12-05 20:58:47,371 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4962292609351433 [2023-12-05 20:58:47,371 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1645 transitions. [2023-12-05 20:58:47,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1645 transitions. [2023-12-05 20:58:47,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:47,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1645 transitions. [2023-12-05 20:58:47,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 126.53846153846153) internal successors, (1645), 13 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:47,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:47,382 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 255.0) internal successors, (3570), 14 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:47,382 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 49 predicate places. [2023-12-05 20:58:47,382 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 144 transitions, 3112 flow [2023-12-05 20:58:47,383 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.33333333333333) internal successors, (1865), 15 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:47,383 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:47,383 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:47,383 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 20:58:47,383 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2023-12-05 20:58:47,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1925326103, now seen corresponding path program 1 times [2023-12-05 20:58:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:47,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860484950] [2023-12-05 20:58:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:58:47,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:47,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860484950] [2023-12-05 20:58:47,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860484950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:47,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:47,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-05 20:58:47,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259976593] [2023-12-05 20:58:47,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:47,892 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-05 20:58:47,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:47,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-05 20:58:47,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-12-05 20:58:47,895 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 255 [2023-12-05 20:58:47,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 144 transitions, 3112 flow. Second operand has 14 states, 14 states have (on average 126.78571428571429) internal successors, (1775), 14 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:47,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:47,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 255 [2023-12-05 20:58:47,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:48,283 INFO L124 PetriNetUnfolderBase]: 386/950 cut-off events. [2023-12-05 20:58:48,284 INFO L125 PetriNetUnfolderBase]: For 22456/23476 co-relation queries the response was YES. [2023-12-05 20:58:48,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12330 conditions, 950 events. 386/950 cut-off events. For 22456/23476 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4525 event pairs, 234 based on Foata normal form. 2/890 useless extension candidates. Maximal degree in co-relation 12080. Up to 595 conditions per place. [2023-12-05 20:58:48,290 INFO L140 encePairwiseOnDemand]: 241/255 looper letters, 0 selfloop transitions, 0 changer transitions 142/142 dead transitions. [2023-12-05 20:58:48,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 142 transitions, 3220 flow [2023-12-05 20:58:48,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-05 20:58:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-12-05 20:58:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1920 transitions. [2023-12-05 20:58:48,294 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5019607843137255 [2023-12-05 20:58:48,294 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1920 transitions. [2023-12-05 20:58:48,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1920 transitions. [2023-12-05 20:58:48,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:48,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1920 transitions. [2023-12-05 20:58:48,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 128.0) internal successors, (1920), 15 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:48,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 255.0) internal successors, (4080), 16 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:48,303 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 255.0) internal successors, (4080), 16 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:48,304 INFO L308 CegarLoopForPetriNet]: 162 programPoint places, 62 predicate places. [2023-12-05 20:58:48,304 INFO L500 AbstractCegarLoop]: Abstraction has has 224 places, 142 transitions, 3220 flow [2023-12-05 20:58:48,304 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 126.78571428571429) internal successors, (1775), 14 states have internal predecessors, (1775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 20:58:48,314 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/singleton_with-uninit-problems.i_BEv2_AllErrorsAtOnce [2023-12-05 20:58:48,401 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 71 remaining) [2023-12-05 20:58:48,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2023-12-05 20:58:48,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2023-12-05 20:58:48,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2023-12-05 20:58:48,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2023-12-05 20:58:48,404 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2023-12-05 20:58:48,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2023-12-05 20:58:48,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2023-12-05 20:58:48,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2023-12-05 20:58:48,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2023-12-05 20:58:48,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2023-12-05 20:58:48,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2023-12-05 20:58:48,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2023-12-05 20:58:48,405 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 71 remaining) [2023-12-05 20:58:48,406 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 71 remaining) [2023-12-05 20:58:48,407 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 71 remaining) [2023-12-05 20:58:48,407 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 71 remaining) [2023-12-05 20:58:48,407 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2023-12-05 20:58:48,407 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2023-12-05 20:58:48,407 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2023-12-05 20:58:48,407 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2023-12-05 20:58:48,407 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2023-12-05 20:58:48,407 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2023-12-05 20:58:48,408 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2023-12-05 20:58:48,408 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2023-12-05 20:58:48,408 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2023-12-05 20:58:48,408 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2023-12-05 20:58:48,408 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2023-12-05 20:58:48,408 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2023-12-05 20:58:48,408 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 71 remaining) [2023-12-05 20:58:48,408 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 71 remaining) [2023-12-05 20:58:48,409 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2023-12-05 20:58:48,410 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread0Thread1of1ForFork4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2023-12-05 20:58:48,411 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2023-12-05 20:58:48,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2023-12-05 20:58:48,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2023-12-05 20:58:48,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2023-12-05 20:58:48,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2023-12-05 20:58:48,412 INFO L810 garLoopResultBuilder]: Registering result SAFE for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2023-12-05 20:58:48,412 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 20:58:48,413 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 20:58:48,418 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-05 20:58:48,419 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-05 20:58:48,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:58:48 BasicIcfg [2023-12-05 20:58:48,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-05 20:58:48,425 INFO L158 Benchmark]: Toolchain (without parser) took 28098.92ms. Allocated memory was 182.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 133.9MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-12-05 20:58:48,425 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 20:58:48,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 606.33ms. Allocated memory is still 182.5MB. Free memory was 133.9MB in the beginning and 100.5MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2023-12-05 20:58:48,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.05ms. Allocated memory is still 182.5MB. Free memory was 100.5MB in the beginning and 98.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 20:58:48,426 INFO L158 Benchmark]: Boogie Preprocessor took 36.01ms. Allocated memory is still 182.5MB. Free memory was 98.0MB in the beginning and 96.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-05 20:58:48,426 INFO L158 Benchmark]: RCFGBuilder took 508.76ms. Allocated memory is still 182.5MB. Free memory was 96.2MB in the beginning and 137.9MB in the end (delta: -41.8MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. [2023-12-05 20:58:48,427 INFO L158 Benchmark]: TraceAbstraction took 26906.17ms. Allocated memory was 182.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 137.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2023-12-05 20:58:48,428 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 182.5MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 606.33ms. Allocated memory is still 182.5MB. Free memory was 133.9MB in the beginning and 100.5MB in the end (delta: 33.4MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.05ms. Allocated memory is still 182.5MB. Free memory was 100.5MB in the beginning and 98.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.01ms. Allocated memory is still 182.5MB. Free memory was 98.0MB in the beginning and 96.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 508.76ms. Allocated memory is still 182.5MB. Free memory was 96.2MB in the beginning and 137.9MB in the end (delta: -41.8MB). Peak memory consumption was 7.6MB. Max. memory is 8.0GB. * TraceAbstraction took 26906.17ms. Allocated memory was 182.5MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 137.4MB in the beginning and 2.9GB in the end (delta: -2.8GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - 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 - 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 - 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 11 procedures, 289 locations, 71 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: 26.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1427 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1427 mSDsluCounter, 465 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 145 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2441 IncrementalHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 320 mSDtfsCounter, 2441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3220occurred in iteration=18, InterpolantAutomatonStates: 116, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 973 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 955 ConstructedInterpolants, 0 QuantifiedInterpolants, 12931 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-05 20:58:48,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...