/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/queue_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 20:58:16,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 20:58:16,925 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:16,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 20:58:16,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 20:58:16,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 20:58:16,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 20:58:16,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 20:58:16,954 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 20:58:16,956 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 20:58:16,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 20:58:16,957 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 20:58:16,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 20:58:16,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 20:58:16,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 20:58:16,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 20:58:16,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 20:58:16,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 20:58:16,959 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 20:58:16,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 20:58:16,959 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 20:58:16,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 20:58:16,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 20:58:16,960 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 20:58:16,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 20:58:16,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:58:16,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 20:58:16,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 20:58:16,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 20:58:16,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 20:58:16,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 20:58:16,962 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 20:58:16,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 20:58:16,962 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:17,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 20:58:17,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 20:58:17,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 20:58:17,185 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 20:58:17,185 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 20:58:17,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_longer.i [2023-12-05 20:58:18,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 20:58:18,469 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 20:58:18,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_longer.i [2023-12-05 20:58:18,486 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4641866fe/53e4561acd3746eb957b57bae5170393/FLAGf637e7705 [2023-12-05 20:58:18,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4641866fe/53e4561acd3746eb957b57bae5170393 [2023-12-05 20:58:18,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 20:58:18,503 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 20:58:18,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 20:58:18,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 20:58:18,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 20:58:18,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:58:18" (1/1) ... [2023-12-05 20:58:18,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20d615dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:18, skipping insertion in model container [2023-12-05 20:58:18,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:58:18" (1/1) ... [2023-12-05 20:58:18,550 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 20:58:18,857 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:58:18,867 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 20:58:18,913 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 20:58:18,963 INFO L206 MainTranslator]: Completed translation [2023-12-05 20:58:18,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:18 WrapperNode [2023-12-05 20:58:18,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 20:58:18,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 20:58:18,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 20:58:18,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 20:58:18,969 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:18" (1/1) ... [2023-12-05 20:58:19,025 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:18" (1/1) ... [2023-12-05 20:58:19,056 INFO L138 Inliner]: procedures = 275, calls = 66, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 260 [2023-12-05 20:58:19,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 20:58:19,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 20:58:19,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 20:58:19,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 20:58:19,063 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:18" (1/1) ... [2023-12-05 20:58:19,064 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:18" (1/1) ... [2023-12-05 20:58:19,077 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:18" (1/1) ... [2023-12-05 20:58:19,077 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:18" (1/1) ... [2023-12-05 20:58:19,083 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:18" (1/1) ... [2023-12-05 20:58:19,085 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:18" (1/1) ... [2023-12-05 20:58:19,087 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:18" (1/1) ... [2023-12-05 20:58:19,104 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:18" (1/1) ... [2023-12-05 20:58:19,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 20:58:19,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 20:58:19,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 20:58:19,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 20:58:19,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:18" (1/1) ... [2023-12-05 20:58:19,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 20:58:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 20:58:19,135 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:19,142 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:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-05 20:58:19,158 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-05 20:58:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-05 20:58:19,158 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-05 20:58:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 20:58:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 20:58:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 20:58:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 20:58:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 20:58:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 20:58:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 20:58:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 20:58:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 20:58:19,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 20:58:19,160 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:19,310 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 20:58:19,312 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 20:58:19,757 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 20:58:19,788 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 20:58:19,788 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-05 20:58:19,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:58:19 BoogieIcfgContainer [2023-12-05 20:58:19,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 20:58:19,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 20:58:19,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 20:58:19,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 20:58:19,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:58:18" (1/3) ... [2023-12-05 20:58:19,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad12fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:58:19, skipping insertion in model container [2023-12-05 20:58:19,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:58:18" (2/3) ... [2023-12-05 20:58:19,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ad12fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:58:19, skipping insertion in model container [2023-12-05 20:58:19,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:58:19" (3/3) ... [2023-12-05 20:58:19,797 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2023-12-05 20:58:19,809 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 20:58:19,810 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2023-12-05 20:58:19,810 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 20:58:19,902 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 20:58:19,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 350 places, 361 transitions, 736 flow [2023-12-05 20:58:20,006 INFO L124 PetriNetUnfolderBase]: 18/359 cut-off events. [2023-12-05 20:58:20,006 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 20:58:20,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 359 events. 18/359 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 786 event pairs, 0 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 264. Up to 2 conditions per place. [2023-12-05 20:58:20,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 361 transitions, 736 flow [2023-12-05 20:58:20,034 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 349 transitions, 707 flow [2023-12-05 20:58:20,046 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 20:58:20,051 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;@5286fa3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 20:58:20,051 INFO L363 AbstractCegarLoop]: Starting to check reachability of 136 error locations. [2023-12-05 20:58:20,056 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 20:58:20,056 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2023-12-05 20:58:20,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 20:58:20,057 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:20,057 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] [2023-12-05 20:58:20,057 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:20,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:20,062 INFO L85 PathProgramCache]: Analyzing trace with hash -817170261, now seen corresponding path program 1 times [2023-12-05 20:58:20,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:20,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416195077] [2023-12-05 20:58:20,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:20,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:20,534 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:20,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:20,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416195077] [2023-12-05 20:58:20,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416195077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:20,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:20,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106201561] [2023-12-05 20:58:20,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:20,542 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:20,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:20,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:20,571 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 361 [2023-12-05 20:58:20,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 349 transitions, 707 flow. Second operand has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 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:20,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:20,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 361 [2023-12-05 20:58:20,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:22,534 INFO L124 PetriNetUnfolderBase]: 5809/16873 cut-off events. [2023-12-05 20:58:22,534 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2023-12-05 20:58:22,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25820 conditions, 16873 events. 5809/16873 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 173700 event pairs, 5275 based on Foata normal form. 695/13098 useless extension candidates. Maximal degree in co-relation 25385. Up to 8807 conditions per place. [2023-12-05 20:58:22,664 INFO L140 encePairwiseOnDemand]: 345/361 looper letters, 99 selfloop transitions, 6 changer transitions 0/325 dead transitions. [2023-12-05 20:58:22,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 325 transitions, 869 flow [2023-12-05 20:58:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 20:58:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 20:58:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1543 transitions. [2023-12-05 20:58:22,677 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7123730378578024 [2023-12-05 20:58:22,678 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1543 transitions. [2023-12-05 20:58:22,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1543 transitions. [2023-12-05 20:58:22,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:22,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1543 transitions. [2023-12-05 20:58:22,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 257.1666666666667) internal successors, (1543), 6 states have internal predecessors, (1543), 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,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 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,697 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 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,701 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, -11 predicate places. [2023-12-05 20:58:22,701 INFO L500 AbstractCegarLoop]: Abstraction has has 327 places, 325 transitions, 869 flow [2023-12-05 20:58:22,703 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 240.0) internal successors, (1680), 7 states have internal predecessors, (1680), 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,703 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:22,703 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] [2023-12-05 20:58:22,703 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 20:58:22,703 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:22,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:22,704 INFO L85 PathProgramCache]: Analyzing trace with hash -817170260, now seen corresponding path program 1 times [2023-12-05 20:58:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332272936] [2023-12-05 20:58:22,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:22,873 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,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:22,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332272936] [2023-12-05 20:58:22,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332272936] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:22,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:22,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:58:22,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972447527] [2023-12-05 20:58:22,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:22,875 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:58:22,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:58:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:58:22,876 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 361 [2023-12-05 20:58:22,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 325 transitions, 869 flow. Second operand has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 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,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:22,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 361 [2023-12-05 20:58:22,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:26,583 INFO L124 PetriNetUnfolderBase]: 15728/36043 cut-off events. [2023-12-05 20:58:26,584 INFO L125 PetriNetUnfolderBase]: For 5208/6100 co-relation queries the response was YES. [2023-12-05 20:58:26,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76713 conditions, 36043 events. 15728/36043 cut-off events. For 5208/6100 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 383936 event pairs, 14749 based on Foata normal form. 0/27492 useless extension candidates. Maximal degree in co-relation 75845. Up to 23862 conditions per place. [2023-12-05 20:58:26,850 INFO L140 encePairwiseOnDemand]: 352/361 looper letters, 131 selfloop transitions, 6 changer transitions 0/322 dead transitions. [2023-12-05 20:58:26,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 322 transitions, 1131 flow [2023-12-05 20:58:26,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 20:58:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 20:58:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1358 transitions. [2023-12-05 20:58:26,856 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6269621421975993 [2023-12-05 20:58:26,856 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1358 transitions. [2023-12-05 20:58:26,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1358 transitions. [2023-12-05 20:58:26,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:26,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1358 transitions. [2023-12-05 20:58:26,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.33333333333334) internal successors, (1358), 6 states have internal predecessors, (1358), 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:26,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 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:26,870 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 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:26,871 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, -9 predicate places. [2023-12-05 20:58:26,871 INFO L500 AbstractCegarLoop]: Abstraction has has 329 places, 322 transitions, 1131 flow [2023-12-05 20:58:26,872 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 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:26,872 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:26,873 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] [2023-12-05 20:58:26,873 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 20:58:26,873 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:26,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1873921761, now seen corresponding path program 1 times [2023-12-05 20:58:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:26,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808644930] [2023-12-05 20:58:26,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:27,272 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:27,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:27,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808644930] [2023-12-05 20:58:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808644930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:27,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:27,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:27,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035187100] [2023-12-05 20:58:27,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:27,274 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:27,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:27,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:27,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:27,281 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 361 [2023-12-05 20:58:27,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 322 transitions, 1131 flow. Second operand has 8 states, 8 states have (on average 237.625) internal successors, (1901), 8 states have internal predecessors, (1901), 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:27,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:27,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 361 [2023-12-05 20:58:27,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:31,004 INFO L124 PetriNetUnfolderBase]: 15728/36041 cut-off events. [2023-12-05 20:58:31,005 INFO L125 PetriNetUnfolderBase]: For 21155/24341 co-relation queries the response was YES. [2023-12-05 20:58:31,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93334 conditions, 36041 events. 15728/36041 cut-off events. For 21155/24341 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 383758 event pairs, 14749 based on Foata normal form. 2/34599 useless extension candidates. Maximal degree in co-relation 92259. Up to 23860 conditions per place. [2023-12-05 20:58:31,435 INFO L140 encePairwiseOnDemand]: 349/361 looper letters, 95 selfloop transitions, 10 changer transitions 0/320 dead transitions. [2023-12-05 20:58:31,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 320 transitions, 1333 flow [2023-12-05 20:58:31,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 20:58:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 20:58:31,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2457 transitions. [2023-12-05 20:58:31,440 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6806094182825485 [2023-12-05 20:58:31,440 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2457 transitions. [2023-12-05 20:58:31,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2457 transitions. [2023-12-05 20:58:31,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:31,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2457 transitions. [2023-12-05 20:58:31,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 245.7) internal successors, (2457), 10 states have internal predecessors, (2457), 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:31,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 361.0) internal successors, (3971), 11 states have internal predecessors, (3971), 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:31,453 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 361.0) internal successors, (3971), 11 states have internal predecessors, (3971), 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:31,454 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, -2 predicate places. [2023-12-05 20:58:31,454 INFO L500 AbstractCegarLoop]: Abstraction has has 336 places, 320 transitions, 1333 flow [2023-12-05 20:58:31,455 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 237.625) internal successors, (1901), 8 states have internal predecessors, (1901), 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:31,455 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:31,455 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] [2023-12-05 20:58:31,455 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 20:58:31,455 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:31,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1873921760, now seen corresponding path program 1 times [2023-12-05 20:58:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:31,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211779595] [2023-12-05 20:58:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:31,530 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:31,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:31,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211779595] [2023-12-05 20:58:31,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211779595] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:31,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:31,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479824784] [2023-12-05 20:58:31,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:31,534 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:31,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:31,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:31,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:31,539 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 361 [2023-12-05 20:58:31,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 320 transitions, 1333 flow. Second operand has 8 states, 8 states have (on average 234.75) internal successors, (1878), 8 states have internal predecessors, (1878), 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:31,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:31,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 361 [2023-12-05 20:58:31,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:35,313 INFO L124 PetriNetUnfolderBase]: 15728/36039 cut-off events. [2023-12-05 20:58:35,313 INFO L125 PetriNetUnfolderBase]: For 41949/46844 co-relation queries the response was YES. [2023-12-05 20:58:35,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109950 conditions, 36039 events. 15728/36039 cut-off events. For 41949/46844 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 384197 event pairs, 14749 based on Foata normal form. 0/34597 useless extension candidates. Maximal degree in co-relation 108673. Up to 23858 conditions per place. [2023-12-05 20:58:35,608 INFO L140 encePairwiseOnDemand]: 350/361 looper letters, 95 selfloop transitions, 9 changer transitions 0/318 dead transitions. [2023-12-05 20:58:35,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 318 transitions, 1525 flow [2023-12-05 20:58:35,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 20:58:35,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 20:58:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2194 transitions. [2023-12-05 20:58:35,613 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.675284702985534 [2023-12-05 20:58:35,613 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2194 transitions. [2023-12-05 20:58:35,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2194 transitions. [2023-12-05 20:58:35,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:35,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2194 transitions. [2023-12-05 20:58:35,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 243.77777777777777) internal successors, (2194), 9 states have internal predecessors, (2194), 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,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 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,622 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 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,624 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 4 predicate places. [2023-12-05 20:58:35,624 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 318 transitions, 1525 flow [2023-12-05 20:58:35,625 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 234.75) internal successors, (1878), 8 states have internal predecessors, (1878), 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,625 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:35,625 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] [2023-12-05 20:58:35,625 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 20:58:35,625 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:35,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash 376553368, now seen corresponding path program 1 times [2023-12-05 20:58:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925029303] [2023-12-05 20:58:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:35,704 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,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:35,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925029303] [2023-12-05 20:58:35,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925029303] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:35,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:35,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:35,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613752192] [2023-12-05 20:58:35,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:35,705 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:35,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:35,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:35,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:35,707 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 361 [2023-12-05 20:58:35,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 318 transitions, 1525 flow. Second operand has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 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,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:35,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 361 [2023-12-05 20:58:35,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:38,576 INFO L124 PetriNetUnfolderBase]: 11375/26843 cut-off events. [2023-12-05 20:58:38,576 INFO L125 PetriNetUnfolderBase]: For 57056/61285 co-relation queries the response was YES. [2023-12-05 20:58:38,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94544 conditions, 26843 events. 11375/26843 cut-off events. For 57056/61285 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 278531 event pairs, 10632 based on Foata normal form. 2106/27858 useless extension candidates. Maximal degree in co-relation 93076. Up to 17564 conditions per place. [2023-12-05 20:58:38,918 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 88 selfloop transitions, 1 changer transitions 0/316 dead transitions. [2023-12-05 20:58:38,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 316 transitions, 1687 flow [2023-12-05 20:58:38,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:38,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2023-12-05 20:58:38,921 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7710064635272391 [2023-12-05 20:58:38,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 835 transitions. [2023-12-05 20:58:38,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 835 transitions. [2023-12-05 20:58:38,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:38,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 835 transitions. [2023-12-05 20:58:38,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 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,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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,924 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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,925 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 4 predicate places. [2023-12-05 20:58:38,925 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 316 transitions, 1687 flow [2023-12-05 20:58:38,925 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 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,925 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:38,925 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] [2023-12-05 20:58:38,925 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 20:58:38,926 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:38,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 376553369, now seen corresponding path program 1 times [2023-12-05 20:58:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913915995] [2023-12-05 20:58:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:39,223 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,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:39,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913915995] [2023-12-05 20:58:39,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913915995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:39,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:39,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-05 20:58:39,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198856327] [2023-12-05 20:58:39,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:39,227 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-05 20:58:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:39,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-05 20:58:39,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-05 20:58:39,230 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 361 [2023-12-05 20:58:39,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 316 transitions, 1687 flow. Second operand has 12 states, 12 states have (on average 263.3333333333333) internal successors, (3160), 12 states have internal predecessors, (3160), 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,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:39,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 361 [2023-12-05 20:58:39,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:42,407 INFO L124 PetriNetUnfolderBase]: 11374/26839 cut-off events. [2023-12-05 20:58:42,407 INFO L125 PetriNetUnfolderBase]: For 74437/78931 co-relation queries the response was YES. [2023-12-05 20:58:42,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102194 conditions, 26839 events. 11374/26839 cut-off events. For 74437/78931 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 278196 event pairs, 10632 based on Foata normal form. 0/25749 useless extension candidates. Maximal degree in co-relation 100585. Up to 17564 conditions per place. [2023-12-05 20:58:42,605 INFO L140 encePairwiseOnDemand]: 344/361 looper letters, 58 selfloop transitions, 16 changer transitions 0/312 dead transitions. [2023-12-05 20:58:42,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 312 transitions, 1827 flow [2023-12-05 20:58:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 20:58:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 20:58:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3207 transitions. [2023-12-05 20:58:42,611 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7403047091412742 [2023-12-05 20:58:42,611 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3207 transitions. [2023-12-05 20:58:42,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3207 transitions. [2023-12-05 20:58:42,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:42,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3207 transitions. [2023-12-05 20:58:42,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 267.25) internal successors, (3207), 12 states have internal predecessors, (3207), 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,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 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,622 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 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,623 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 12 predicate places. [2023-12-05 20:58:42,623 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 312 transitions, 1827 flow [2023-12-05 20:58:42,624 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 263.3333333333333) internal successors, (3160), 12 states have internal predecessors, (3160), 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,624 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:42,624 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,624 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 20:58:42,624 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:42,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:42,625 INFO L85 PathProgramCache]: Analyzing trace with hash 534413854, now seen corresponding path program 1 times [2023-12-05 20:58:42,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:42,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634010497] [2023-12-05 20:58:42,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:42,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:42,714 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,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:42,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634010497] [2023-12-05 20:58:42,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634010497] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:42,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:42,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355014609] [2023-12-05 20:58:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:42,718 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 20:58:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 20:58:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 20:58:42,720 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 361 [2023-12-05 20:58:42,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 312 transitions, 1827 flow. Second operand has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 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,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:42,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 361 [2023-12-05 20:58:42,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:44,806 INFO L124 PetriNetUnfolderBase]: 7021/17643 cut-off events. [2023-12-05 20:58:44,806 INFO L125 PetriNetUnfolderBase]: For 71730/76108 co-relation queries the response was YES. [2023-12-05 20:58:44,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80053 conditions, 17643 events. 7021/17643 cut-off events. For 71730/76108 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 175901 event pairs, 6515 based on Foata normal form. 2106/19010 useless extension candidates. Maximal degree in co-relation 78187. Up to 11270 conditions per place. [2023-12-05 20:58:44,951 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 117 selfloop transitions, 1 changer transitions 0/310 dead transitions. [2023-12-05 20:58:44,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 310 transitions, 2047 flow [2023-12-05 20:58:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 756 transitions. [2023-12-05 20:58:44,976 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6980609418282548 [2023-12-05 20:58:44,976 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 756 transitions. [2023-12-05 20:58:44,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 756 transitions. [2023-12-05 20:58:44,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:44,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 756 transitions. [2023-12-05 20:58:44,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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,980 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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,980 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 12 predicate places. [2023-12-05 20:58:44,980 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 310 transitions, 2047 flow [2023-12-05 20:58:44,981 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.75) internal successors, (863), 4 states have internal predecessors, (863), 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,981 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:44,981 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] [2023-12-05 20:58:44,981 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-05 20:58:44,981 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:44,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:44,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1360809092, now seen corresponding path program 1 times [2023-12-05 20:58:44,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:44,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833769518] [2023-12-05 20:58:44,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:45,061 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,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:45,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833769518] [2023-12-05 20:58:45,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833769518] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:45,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:45,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:45,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594279265] [2023-12-05 20:58:45,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:45,062 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:45,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:45,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:45,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:45,063 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 361 [2023-12-05 20:58:45,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 310 transitions, 2047 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:45,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 361 [2023-12-05 20:58:45,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:47,183 INFO L124 PetriNetUnfolderBase]: 6917/17355 cut-off events. [2023-12-05 20:58:47,184 INFO L125 PetriNetUnfolderBase]: For 94761/99753 co-relation queries the response was YES. [2023-12-05 20:58:47,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86961 conditions, 17355 events. 6917/17355 cut-off events. For 94761/99753 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 172669 event pairs, 6418 based on Foata normal form. 98/16722 useless extension candidates. Maximal degree in co-relation 85300. Up to 11073 conditions per place. [2023-12-05 20:58:47,315 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 86 selfloop transitions, 1 changer transitions 0/308 dead transitions. [2023-12-05 20:58:47,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 308 transitions, 2197 flow [2023-12-05 20:58:47,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 833 transitions. [2023-12-05 20:58:47,330 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7691597414589104 [2023-12-05 20:58:47,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 833 transitions. [2023-12-05 20:58:47,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 833 transitions. [2023-12-05 20:58:47,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:47,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 833 transitions. [2023-12-05 20:58:47,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 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,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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,333 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 12 predicate places. [2023-12-05 20:58:47,333 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 308 transitions, 2197 flow [2023-12-05 20:58:47,333 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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,334 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:47,334 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] [2023-12-05 20:58:47,334 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 20:58:47,334 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:47,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1360809093, now seen corresponding path program 1 times [2023-12-05 20:58:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852183642] [2023-12-05 20:58:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:47,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:47,388 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,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:47,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852183642] [2023-12-05 20:58:47,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852183642] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:47,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:47,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 20:58:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386638087] [2023-12-05 20:58:47,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:47,389 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:47,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:47,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:47,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:47,390 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 361 [2023-12-05 20:58:47,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 308 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:47,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 361 [2023-12-05 20:58:47,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:49,614 INFO L124 PetriNetUnfolderBase]: 6813/17067 cut-off events. [2023-12-05 20:58:49,615 INFO L125 PetriNetUnfolderBase]: For 114097/119762 co-relation queries the response was YES. [2023-12-05 20:58:49,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93738 conditions, 17067 events. 6813/17067 cut-off events. For 114097/119762 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 169059 event pairs, 6321 based on Foata normal form. 98/16442 useless extension candidates. Maximal degree in co-relation 92325. Up to 10876 conditions per place. [2023-12-05 20:58:49,768 INFO L140 encePairwiseOnDemand]: 358/361 looper letters, 83 selfloop transitions, 1 changer transitions 0/306 dead transitions. [2023-12-05 20:58:49,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 306 transitions, 2345 flow [2023-12-05 20:58:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2023-12-05 20:58:49,770 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2023-12-05 20:58:49,770 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 836 transitions. [2023-12-05 20:58:49,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 836 transitions. [2023-12-05 20:58:49,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:49,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 836 transitions. [2023-12-05 20:58:49,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 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:49,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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:49,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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:49,773 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 12 predicate places. [2023-12-05 20:58:49,773 INFO L500 AbstractCegarLoop]: Abstraction has has 350 places, 306 transitions, 2345 flow [2023-12-05 20:58:49,773 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:49,773 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:49,773 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] [2023-12-05 20:58:49,773 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 20:58:49,774 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:49,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:49,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1136486198, now seen corresponding path program 1 times [2023-12-05 20:58:49,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:49,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148312066] [2023-12-05 20:58:49,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:49,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:49,848 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:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148312066] [2023-12-05 20:58:49,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148312066] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:58:49,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733676468] [2023-12-05 20:58:49,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:49,850 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:58:49,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:58:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:58:49,852 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 361 [2023-12-05 20:58:49,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 306 transitions, 2345 flow. Second operand has 8 states, 8 states have (on average 217.5) internal successors, (1740), 8 states have internal predecessors, (1740), 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:49,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:49,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 361 [2023-12-05 20:58:49,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:51,881 INFO L124 PetriNetUnfolderBase]: 5856/14624 cut-off events. [2023-12-05 20:58:51,881 INFO L125 PetriNetUnfolderBase]: For 149381/150464 co-relation queries the response was YES. [2023-12-05 20:58:51,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86740 conditions, 14624 events. 5856/14624 cut-off events. For 149381/150464 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 139726 event pairs, 2449 based on Foata normal form. 1015/15122 useless extension candidates. Maximal degree in co-relation 85197. Up to 8914 conditions per place. [2023-12-05 20:58:52,022 INFO L140 encePairwiseOnDemand]: 332/361 looper letters, 139 selfloop transitions, 13 changer transitions 0/338 dead transitions. [2023-12-05 20:58:52,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 338 transitions, 3267 flow [2023-12-05 20:58:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 20:58:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 20:58:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2094 transitions. [2023-12-05 20:58:52,026 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.644506001846722 [2023-12-05 20:58:52,026 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2094 transitions. [2023-12-05 20:58:52,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2094 transitions. [2023-12-05 20:58:52,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:52,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2094 transitions. [2023-12-05 20:58:52,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 232.66666666666666) internal successors, (2094), 9 states have internal predecessors, (2094), 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:52,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 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:52,033 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 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:52,034 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 4 predicate places. [2023-12-05 20:58:52,034 INFO L500 AbstractCegarLoop]: Abstraction has has 342 places, 338 transitions, 3267 flow [2023-12-05 20:58:52,035 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 217.5) internal successors, (1740), 8 states have internal predecessors, (1740), 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:52,035 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:52,035 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] [2023-12-05 20:58:52,035 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 20:58:52,035 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:52,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1136486197, now seen corresponding path program 1 times [2023-12-05 20:58:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600799159] [2023-12-05 20:58:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:52,362 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:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600799159] [2023-12-05 20:58:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600799159] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:52,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:52,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-05 20:58:52,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848992840] [2023-12-05 20:58:52,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:52,363 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 20:58:52,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:52,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 20:58:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-05 20:58:52,365 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 361 [2023-12-05 20:58:52,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 338 transitions, 3267 flow. Second operand has 10 states, 10 states have (on average 214.1) internal successors, (2141), 10 states have internal predecessors, (2141), 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:52,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:52,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 361 [2023-12-05 20:58:52,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:54,283 INFO L124 PetriNetUnfolderBase]: 4669/12571 cut-off events. [2023-12-05 20:58:54,284 INFO L125 PetriNetUnfolderBase]: For 138490/139489 co-relation queries the response was YES. [2023-12-05 20:58:54,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76147 conditions, 12571 events. 4669/12571 cut-off events. For 138490/139489 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 119944 event pairs, 1857 based on Foata normal form. 896/12971 useless extension candidates. Maximal degree in co-relation 74471. Up to 6826 conditions per place. [2023-12-05 20:58:54,539 INFO L140 encePairwiseOnDemand]: 329/361 looper letters, 123 selfloop transitions, 18 changer transitions 0/342 dead transitions. [2023-12-05 20:58:54,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 342 transitions, 3561 flow [2023-12-05 20:58:54,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 20:58:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 20:58:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2687 transitions. [2023-12-05 20:58:54,544 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6202677746999077 [2023-12-05 20:58:54,544 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2687 transitions. [2023-12-05 20:58:54,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2687 transitions. [2023-12-05 20:58:54,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:54,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2687 transitions. [2023-12-05 20:58:54,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 223.91666666666666) internal successors, (2687), 12 states have internal predecessors, (2687), 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:54,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 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:54,552 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 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:54,552 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 1 predicate places. [2023-12-05 20:58:54,552 INFO L500 AbstractCegarLoop]: Abstraction has has 339 places, 342 transitions, 3561 flow [2023-12-05 20:58:54,553 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.1) internal successors, (2141), 10 states have internal predecessors, (2141), 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:54,553 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:54,553 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] [2023-12-05 20:58:54,553 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-05 20:58:54,553 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:54,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash -871332960, now seen corresponding path program 1 times [2023-12-05 20:58:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:54,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231915889] [2023-12-05 20:58:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:55,145 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:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231915889] [2023-12-05 20:58:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231915889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:55,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:55,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-05 20:58:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994801075] [2023-12-05 20:58:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:55,146 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-05 20:58:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:55,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-05 20:58:55,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2023-12-05 20:58:55,148 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 361 [2023-12-05 20:58:55,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 342 transitions, 3561 flow. Second operand has 16 states, 16 states have (on average 180.625) internal successors, (2890), 16 states have internal predecessors, (2890), 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:55,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:55,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 361 [2023-12-05 20:58:55,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:57,770 INFO L124 PetriNetUnfolderBase]: 5050/13216 cut-off events. [2023-12-05 20:58:57,770 INFO L125 PetriNetUnfolderBase]: For 157813/159101 co-relation queries the response was YES. [2023-12-05 20:58:57,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88829 conditions, 13216 events. 5050/13216 cut-off events. For 157813/159101 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 125312 event pairs, 1836 based on Foata normal form. 64/12766 useless extension candidates. Maximal degree in co-relation 86992. Up to 7694 conditions per place. [2023-12-05 20:58:57,910 INFO L140 encePairwiseOnDemand]: 341/361 looper letters, 212 selfloop transitions, 23 changer transitions 0/393 dead transitions. [2023-12-05 20:58:57,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 393 transitions, 4982 flow [2023-12-05 20:58:57,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-05 20:58:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-05 20:58:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3019 transitions. [2023-12-05 20:58:57,915 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5226800554016621 [2023-12-05 20:58:57,915 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3019 transitions. [2023-12-05 20:58:57,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3019 transitions. [2023-12-05 20:58:57,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:57,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3019 transitions. [2023-12-05 20:58:57,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 188.6875) internal successors, (3019), 16 states have internal predecessors, (3019), 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:57,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 361.0) internal successors, (6137), 17 states have internal predecessors, (6137), 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:57,925 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 361.0) internal successors, (6137), 17 states have internal predecessors, (6137), 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:57,926 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 16 predicate places. [2023-12-05 20:58:57,926 INFO L500 AbstractCegarLoop]: Abstraction has has 354 places, 393 transitions, 4982 flow [2023-12-05 20:58:57,926 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 180.625) internal successors, (2890), 16 states have internal predecessors, (2890), 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:57,927 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:57,927 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] [2023-12-05 20:58:57,927 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 20:58:57,927 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:57,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:57,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1007428284, now seen corresponding path program 1 times [2023-12-05 20:58:57,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:57,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042349608] [2023-12-05 20:58:57,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:57,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:58:58,096 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:58,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:58:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042349608] [2023-12-05 20:58:58,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042349608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:58:58,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:58:58,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:58:58,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780767125] [2023-12-05 20:58:58,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:58:58,097 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:58:58,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:58:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:58:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:58:58,098 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 361 [2023-12-05 20:58:58,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 393 transitions, 4982 flow. Second operand has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 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:58,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:58:58,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 361 [2023-12-05 20:58:58,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:58:59,308 INFO L124 PetriNetUnfolderBase]: 2765/7128 cut-off events. [2023-12-05 20:58:59,308 INFO L125 PetriNetUnfolderBase]: For 103356/103902 co-relation queries the response was YES. [2023-12-05 20:58:59,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52657 conditions, 7128 events. 2765/7128 cut-off events. For 103356/103902 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 55448 event pairs, 792 based on Foata normal form. 0/6892 useless extension candidates. Maximal degree in co-relation 50449. Up to 4503 conditions per place. [2023-12-05 20:58:59,392 INFO L140 encePairwiseOnDemand]: 357/361 looper letters, 36 selfloop transitions, 3 changer transitions 0/379 dead transitions. [2023-12-05 20:58:59,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 379 transitions, 4848 flow [2023-12-05 20:58:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 20:58:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 20:58:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2023-12-05 20:58:59,394 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9445983379501385 [2023-12-05 20:58:59,394 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1023 transitions. [2023-12-05 20:58:59,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1023 transitions. [2023-12-05 20:58:59,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:58:59,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1023 transitions. [2023-12-05 20:58:59,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 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:59,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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:59,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 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:59,398 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 18 predicate places. [2023-12-05 20:58:59,398 INFO L500 AbstractCegarLoop]: Abstraction has has 356 places, 379 transitions, 4848 flow [2023-12-05 20:58:59,399 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 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:59,399 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:58:59,399 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] [2023-12-05 20:58:59,399 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 20:58:59,399 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:58:59,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:58:59,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1781427125, now seen corresponding path program 1 times [2023-12-05 20:58:59,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:58:59,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805748243] [2023-12-05 20:58:59,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:58:59,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:58:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:00,338 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:59:00,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:00,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805748243] [2023-12-05 20:59:00,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805748243] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:00,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:00,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-05 20:59:00,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345356032] [2023-12-05 20:59:00,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:00,339 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-05 20:59:00,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:00,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-05 20:59:00,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-12-05 20:59:00,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 361 [2023-12-05 20:59:00,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 379 transitions, 4848 flow. Second operand has 18 states, 18 states have (on average 179.38888888888889) internal successors, (3229), 18 states have internal predecessors, (3229), 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:59:00,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:00,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 361 [2023-12-05 20:59:00,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:02,381 INFO L124 PetriNetUnfolderBase]: 2758/7081 cut-off events. [2023-12-05 20:59:02,381 INFO L125 PetriNetUnfolderBase]: For 115989/116373 co-relation queries the response was YES. [2023-12-05 20:59:02,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56991 conditions, 7081 events. 2758/7081 cut-off events. For 115989/116373 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 54898 event pairs, 412 based on Foata normal form. 8/6861 useless extension candidates. Maximal degree in co-relation 54602. Up to 4486 conditions per place. [2023-12-05 20:59:02,465 INFO L140 encePairwiseOnDemand]: 340/361 looper letters, 207 selfloop transitions, 27 changer transitions 0/394 dead transitions. [2023-12-05 20:59:02,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 394 transitions, 5752 flow [2023-12-05 20:59:02,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-05 20:59:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-12-05 20:59:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3147 transitions. [2023-12-05 20:59:02,470 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.512791266090924 [2023-12-05 20:59:02,471 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3147 transitions. [2023-12-05 20:59:02,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3147 transitions. [2023-12-05 20:59:02,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:02,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3147 transitions. [2023-12-05 20:59:02,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 185.11764705882354) internal successors, (3147), 17 states have internal predecessors, (3147), 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:59:02,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 361.0) internal successors, (6498), 18 states have internal predecessors, (6498), 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:59:02,483 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 361.0) internal successors, (6498), 18 states have internal predecessors, (6498), 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:59:02,484 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 33 predicate places. [2023-12-05 20:59:02,485 INFO L500 AbstractCegarLoop]: Abstraction has has 371 places, 394 transitions, 5752 flow [2023-12-05 20:59:02,486 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 179.38888888888889) internal successors, (3229), 18 states have internal predecessors, (3229), 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:59:02,486 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:02,486 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] [2023-12-05 20:59:02,486 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-05 20:59:02,486 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:02,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:02,486 INFO L85 PathProgramCache]: Analyzing trace with hash 292864336, now seen corresponding path program 1 times [2023-12-05 20:59:02,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:02,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455579626] [2023-12-05 20:59:02,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:02,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:03,120 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:59:03,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:03,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455579626] [2023-12-05 20:59:03,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455579626] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:03,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:03,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-05 20:59:03,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086681114] [2023-12-05 20:59:03,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:03,121 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-05 20:59:03,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:03,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-05 20:59:03,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-12-05 20:59:03,123 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 361 [2023-12-05 20:59:03,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 394 transitions, 5752 flow. Second operand has 17 states, 17 states have (on average 188.0) internal successors, (3196), 17 states have internal predecessors, (3196), 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:59:03,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:03,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 361 [2023-12-05 20:59:03,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:05,359 INFO L124 PetriNetUnfolderBase]: 3217/7793 cut-off events. [2023-12-05 20:59:05,359 INFO L125 PetriNetUnfolderBase]: For 167218/167673 co-relation queries the response was YES. [2023-12-05 20:59:05,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68602 conditions, 7793 events. 3217/7793 cut-off events. For 167218/167673 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 59876 event pairs, 414 based on Foata normal form. 2/7562 useless extension candidates. Maximal degree in co-relation 66050. Up to 5026 conditions per place. [2023-12-05 20:59:05,562 INFO L140 encePairwiseOnDemand]: 330/361 looper letters, 238 selfloop transitions, 38 changer transitions 0/459 dead transitions. [2023-12-05 20:59:05,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 459 transitions, 7895 flow [2023-12-05 20:59:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-05 20:59:05,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-12-05 20:59:05,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3701 transitions. [2023-12-05 20:59:05,566 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.539583029596151 [2023-12-05 20:59:05,566 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3701 transitions. [2023-12-05 20:59:05,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3701 transitions. [2023-12-05 20:59:05,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:05,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3701 transitions. [2023-12-05 20:59:05,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 194.78947368421052) internal successors, (3701), 19 states have internal predecessors, (3701), 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:59:05,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 361.0) internal successors, (7220), 20 states have internal predecessors, (7220), 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:59:05,579 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 361.0) internal successors, (7220), 20 states have internal predecessors, (7220), 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:59:05,579 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 51 predicate places. [2023-12-05 20:59:05,579 INFO L500 AbstractCegarLoop]: Abstraction has has 389 places, 459 transitions, 7895 flow [2023-12-05 20:59:05,580 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 188.0) internal successors, (3196), 17 states have internal predecessors, (3196), 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:59:05,580 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:05,580 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] [2023-12-05 20:59:05,580 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 20:59:05,581 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:05,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash -610835850, now seen corresponding path program 1 times [2023-12-05 20:59:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:05,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349568810] [2023-12-05 20:59:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:05,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:05,732 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:59:05,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:05,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349568810] [2023-12-05 20:59:05,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349568810] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:05,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:05,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-05 20:59:05,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759477978] [2023-12-05 20:59:05,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:05,736 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-05 20:59:05,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:05,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-05 20:59:05,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-05 20:59:05,738 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 361 [2023-12-05 20:59:05,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 459 transitions, 7895 flow. Second operand has 7 states, 7 states have (on average 246.85714285714286) internal successors, (1728), 7 states have internal predecessors, (1728), 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:59:05,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:05,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 361 [2023-12-05 20:59:05,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:07,150 INFO L124 PetriNetUnfolderBase]: 3017/7378 cut-off events. [2023-12-05 20:59:07,150 INFO L125 PetriNetUnfolderBase]: For 188651/189114 co-relation queries the response was YES. [2023-12-05 20:59:07,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68159 conditions, 7378 events. 3017/7378 cut-off events. For 188651/189114 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 56086 event pairs, 346 based on Foata normal form. 137/7288 useless extension candidates. Maximal degree in co-relation 65520. Up to 4701 conditions per place. [2023-12-05 20:59:07,243 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 217 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2023-12-05 20:59:07,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 452 transitions, 8179 flow [2023-12-05 20:59:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 20:59:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 20:59:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1046 transitions. [2023-12-05 20:59:07,244 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.724376731301939 [2023-12-05 20:59:07,244 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1046 transitions. [2023-12-05 20:59:07,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1046 transitions. [2023-12-05 20:59:07,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:07,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1046 transitions. [2023-12-05 20:59:07,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 261.5) internal successors, (1046), 4 states have internal predecessors, (1046), 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:59:07,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 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:59:07,246 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 361.0) internal successors, (1805), 5 states have internal predecessors, (1805), 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:59:07,246 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 51 predicate places. [2023-12-05 20:59:07,247 INFO L500 AbstractCegarLoop]: Abstraction has has 389 places, 452 transitions, 8179 flow [2023-12-05 20:59:07,247 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 246.85714285714286) internal successors, (1728), 7 states have internal predecessors, (1728), 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:59:07,247 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:07,247 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] [2023-12-05 20:59:07,247 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-05 20:59:07,247 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:07,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:07,247 INFO L85 PathProgramCache]: Analyzing trace with hash -610835849, now seen corresponding path program 1 times [2023-12-05 20:59:07,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:07,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054230598] [2023-12-05 20:59:07,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:07,461 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:59:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054230598] [2023-12-05 20:59:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054230598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:07,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-05 20:59:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65182173] [2023-12-05 20:59:07,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:07,462 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-05 20:59:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-05 20:59:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-05 20:59:07,463 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 361 [2023-12-05 20:59:07,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 452 transitions, 8179 flow. Second operand has 6 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 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:59:07,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:07,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 361 [2023-12-05 20:59:07,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:09,127 INFO L124 PetriNetUnfolderBase]: 3006/7344 cut-off events. [2023-12-05 20:59:09,127 INFO L125 PetriNetUnfolderBase]: For 211789/212356 co-relation queries the response was YES. [2023-12-05 20:59:09,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71971 conditions, 7344 events. 3006/7344 cut-off events. For 211789/212356 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 55959 event pairs, 352 based on Foata normal form. 9/7125 useless extension candidates. Maximal degree in co-relation 69175. Up to 4682 conditions per place. [2023-12-05 20:59:09,210 INFO L140 encePairwiseOnDemand]: 356/361 looper letters, 241 selfloop transitions, 4 changer transitions 0/451 dead transitions. [2023-12-05 20:59:09,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 451 transitions, 8651 flow [2023-12-05 20:59:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 20:59:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 20:59:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1342 transitions. [2023-12-05 20:59:09,212 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6195752539242844 [2023-12-05 20:59:09,212 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1342 transitions. [2023-12-05 20:59:09,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1342 transitions. [2023-12-05 20:59:09,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:09,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1342 transitions. [2023-12-05 20:59:09,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 223.66666666666666) internal successors, (1342), 6 states have internal predecessors, (1342), 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:59:09,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 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:59:09,215 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 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:59:09,215 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 55 predicate places. [2023-12-05 20:59:09,215 INFO L500 AbstractCegarLoop]: Abstraction has has 393 places, 451 transitions, 8651 flow [2023-12-05 20:59:09,215 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 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:59:09,215 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:09,215 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:59:09,215 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-05 20:59:09,215 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:09,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:09,216 INFO L85 PathProgramCache]: Analyzing trace with hash -3942074, now seen corresponding path program 1 times [2023-12-05 20:59:09,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:09,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699569337] [2023-12-05 20:59:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:09,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:09,318 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:59:09,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:09,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699569337] [2023-12-05 20:59:09,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699569337] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:09,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:09,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:59:09,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640717103] [2023-12-05 20:59:09,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:09,319 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:59:09,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:09,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:59:09,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:59:09,320 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 361 [2023-12-05 20:59:09,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 451 transitions, 8651 flow. Second operand has 8 states, 8 states have (on average 236.625) internal successors, (1893), 8 states have internal predecessors, (1893), 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:59:09,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:09,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 361 [2023-12-05 20:59:09,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:10,914 INFO L124 PetriNetUnfolderBase]: 3026/7346 cut-off events. [2023-12-05 20:59:10,915 INFO L125 PetriNetUnfolderBase]: For 247233/247838 co-relation queries the response was YES. [2023-12-05 20:59:10,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75817 conditions, 7346 events. 3026/7346 cut-off events. For 247233/247838 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 55828 event pairs, 352 based on Foata normal form. 18/7136 useless extension candidates. Maximal degree in co-relation 72875. Up to 4684 conditions per place. [2023-12-05 20:59:11,004 INFO L140 encePairwiseOnDemand]: 350/361 looper letters, 233 selfloop transitions, 9 changer transitions 0/459 dead transitions. [2023-12-05 20:59:11,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 459 transitions, 9441 flow [2023-12-05 20:59:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 20:59:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 20:59:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2181 transitions. [2023-12-05 20:59:11,006 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6712834718374885 [2023-12-05 20:59:11,006 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2181 transitions. [2023-12-05 20:59:11,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2181 transitions. [2023-12-05 20:59:11,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:11,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2181 transitions. [2023-12-05 20:59:11,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 242.33333333333334) internal successors, (2181), 9 states have internal predecessors, (2181), 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:59:11,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 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:59:11,011 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 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:59:11,011 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 61 predicate places. [2023-12-05 20:59:11,011 INFO L500 AbstractCegarLoop]: Abstraction has has 399 places, 459 transitions, 9441 flow [2023-12-05 20:59:11,011 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 236.625) internal successors, (1893), 8 states have internal predecessors, (1893), 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:59:11,011 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:11,011 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:59:11,011 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-05 20:59:11,011 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:11,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:11,012 INFO L85 PathProgramCache]: Analyzing trace with hash -3942073, now seen corresponding path program 1 times [2023-12-05 20:59:11,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:11,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714206144] [2023-12-05 20:59:11,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:11,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:11,183 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:59:11,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:11,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714206144] [2023-12-05 20:59:11,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714206144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:11,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:11,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-05 20:59:11,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206636085] [2023-12-05 20:59:11,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:11,185 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 20:59:11,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:11,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 20:59:11,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-05 20:59:11,186 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 361 [2023-12-05 20:59:11,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 459 transitions, 9441 flow. Second operand has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 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:59:11,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:11,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 361 [2023-12-05 20:59:11,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:12,970 INFO L124 PetriNetUnfolderBase]: 3007/7323 cut-off events. [2023-12-05 20:59:12,970 INFO L125 PetriNetUnfolderBase]: For 274258/274793 co-relation queries the response was YES. [2023-12-05 20:59:13,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79098 conditions, 7323 events. 3007/7323 cut-off events. For 274258/274793 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 55729 event pairs, 346 based on Foata normal form. 18/7114 useless extension candidates. Maximal degree in co-relation 76005. Up to 4646 conditions per place. [2023-12-05 20:59:13,084 INFO L140 encePairwiseOnDemand]: 345/361 looper letters, 218 selfloop transitions, 14 changer transitions 0/457 dead transitions. [2023-12-05 20:59:13,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 457 transitions, 9865 flow [2023-12-05 20:59:13,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 20:59:13,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 20:59:13,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2845 transitions. [2023-12-05 20:59:13,086 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6567405355493998 [2023-12-05 20:59:13,086 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2845 transitions. [2023-12-05 20:59:13,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2845 transitions. [2023-12-05 20:59:13,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:13,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2845 transitions. [2023-12-05 20:59:13,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 237.08333333333334) internal successors, (2845), 12 states have internal predecessors, (2845), 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:59:13,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 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:59:13,092 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 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:59:13,092 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 70 predicate places. [2023-12-05 20:59:13,092 INFO L500 AbstractCegarLoop]: Abstraction has has 408 places, 457 transitions, 9865 flow [2023-12-05 20:59:13,092 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 233.0) internal successors, (2330), 10 states have internal predecessors, (2330), 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:59:13,092 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:13,092 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, 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:59:13,092 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-05 20:59:13,092 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:13,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:13,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1105186070, now seen corresponding path program 1 times [2023-12-05 20:59:13,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:13,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90416331] [2023-12-05 20:59:13,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:13,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:16,195 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:59:16,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:16,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90416331] [2023-12-05 20:59:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90416331] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:16,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:16,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-12-05 20:59:16,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109480919] [2023-12-05 20:59:16,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:16,196 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-05 20:59:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:16,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-05 20:59:16,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2023-12-05 20:59:16,199 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 361 [2023-12-05 20:59:16,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 457 transitions, 9865 flow. Second operand has 28 states, 28 states have (on average 169.46428571428572) internal successors, (4745), 28 states have internal predecessors, (4745), 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:59:16,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:16,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 361 [2023-12-05 20:59:16,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:22,327 INFO L124 PetriNetUnfolderBase]: 3598/8484 cut-off events. [2023-12-05 20:59:22,327 INFO L125 PetriNetUnfolderBase]: For 377042/378031 co-relation queries the response was YES. [2023-12-05 20:59:22,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97680 conditions, 8484 events. 3598/8484 cut-off events. For 377042/378031 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 64769 event pairs, 363 based on Foata normal form. 21/8224 useless extension candidates. Maximal degree in co-relation 94130. Up to 5336 conditions per place. [2023-12-05 20:59:22,459 INFO L140 encePairwiseOnDemand]: 323/361 looper letters, 344 selfloop transitions, 60 changer transitions 2/558 dead transitions. [2023-12-05 20:59:22,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 558 transitions, 14159 flow [2023-12-05 20:59:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-05 20:59:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-12-05 20:59:22,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6246 transitions. [2023-12-05 20:59:22,464 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4806094182825485 [2023-12-05 20:59:22,464 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6246 transitions. [2023-12-05 20:59:22,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6246 transitions. [2023-12-05 20:59:22,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:22,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6246 transitions. [2023-12-05 20:59:22,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 173.5) internal successors, (6246), 36 states have internal predecessors, (6246), 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:59:22,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 361.0) internal successors, (13357), 37 states have internal predecessors, (13357), 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:59:22,477 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 361.0) internal successors, (13357), 37 states have internal predecessors, (13357), 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:59:22,477 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 105 predicate places. [2023-12-05 20:59:22,477 INFO L500 AbstractCegarLoop]: Abstraction has has 443 places, 558 transitions, 14159 flow [2023-12-05 20:59:22,478 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 169.46428571428572) internal successors, (4745), 28 states have internal predecessors, (4745), 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:59:22,478 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:22,478 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, 1, 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:59:22,478 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-05 20:59:22,478 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:22,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1590831398, now seen corresponding path program 1 times [2023-12-05 20:59:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:22,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391780308] [2023-12-05 20:59:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:22,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:23,823 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:59:23,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:23,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391780308] [2023-12-05 20:59:23,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391780308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:23,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:23,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2023-12-05 20:59:23,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16712642] [2023-12-05 20:59:23,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:23,824 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-05 20:59:23,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:23,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-05 20:59:23,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=729, Unknown=0, NotChecked=0, Total=812 [2023-12-05 20:59:23,826 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 361 [2023-12-05 20:59:23,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 558 transitions, 14159 flow. Second operand has 29 states, 29 states have (on average 166.3448275862069) internal successors, (4824), 29 states have internal predecessors, (4824), 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:59:23,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:23,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 361 [2023-12-05 20:59:23,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:31,156 INFO L124 PetriNetUnfolderBase]: 6878/16626 cut-off events. [2023-12-05 20:59:31,156 INFO L125 PetriNetUnfolderBase]: For 757235/763578 co-relation queries the response was YES. [2023-12-05 20:59:31,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191772 conditions, 16626 events. 6878/16626 cut-off events. For 757235/763578 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 143917 event pairs, 847 based on Foata normal form. 188/16067 useless extension candidates. Maximal degree in co-relation 185214. Up to 10043 conditions per place. [2023-12-05 20:59:31,402 INFO L140 encePairwiseOnDemand]: 320/361 looper letters, 754 selfloop transitions, 70 changer transitions 2/979 dead transitions. [2023-12-05 20:59:31,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 979 transitions, 29799 flow [2023-12-05 20:59:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-05 20:59:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-12-05 20:59:31,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5707 transitions. [2023-12-05 20:59:31,406 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4940270083102493 [2023-12-05 20:59:31,406 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5707 transitions. [2023-12-05 20:59:31,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5707 transitions. [2023-12-05 20:59:31,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:31,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5707 transitions. [2023-12-05 20:59:31,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 178.34375) internal successors, (5707), 32 states have internal predecessors, (5707), 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:59:31,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 361.0) internal successors, (11913), 33 states have internal predecessors, (11913), 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:59:31,417 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 361.0) internal successors, (11913), 33 states have internal predecessors, (11913), 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:59:31,418 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 136 predicate places. [2023-12-05 20:59:31,418 INFO L500 AbstractCegarLoop]: Abstraction has has 474 places, 979 transitions, 29799 flow [2023-12-05 20:59:31,418 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 166.3448275862069) internal successors, (4824), 29 states have internal predecessors, (4824), 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:59:31,418 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:31,418 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, 1, 1, 1, 1, 1, 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:59:31,418 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-05 20:59:31,418 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:31,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:31,419 INFO L85 PathProgramCache]: Analyzing trace with hash -477133247, now seen corresponding path program 1 times [2023-12-05 20:59:31,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:31,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567812941] [2023-12-05 20:59:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:31,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:32,887 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:59:32,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:32,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567812941] [2023-12-05 20:59:32,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567812941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:32,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:32,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2023-12-05 20:59:32,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219958333] [2023-12-05 20:59:32,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:32,888 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-05 20:59:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:32,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-05 20:59:32,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2023-12-05 20:59:32,890 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 361 [2023-12-05 20:59:32,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 979 transitions, 29799 flow. Second operand has 26 states, 26 states have (on average 168.69230769230768) internal successors, (4386), 26 states have internal predecessors, (4386), 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:59:32,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:32,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 361 [2023-12-05 20:59:32,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:40,134 INFO L124 PetriNetUnfolderBase]: 6973/16801 cut-off events. [2023-12-05 20:59:40,134 INFO L125 PetriNetUnfolderBase]: For 824785/830172 co-relation queries the response was YES. [2023-12-05 20:59:40,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205271 conditions, 16801 events. 6973/16801 cut-off events. For 824785/830172 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 146249 event pairs, 533 based on Foata normal form. 133/16238 useless extension candidates. Maximal degree in co-relation 198168. Up to 10192 conditions per place. [2023-12-05 20:59:40,423 INFO L140 encePairwiseOnDemand]: 324/361 looper letters, 846 selfloop transitions, 81 changer transitions 4/1091 dead transitions. [2023-12-05 20:59:40,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 1091 transitions, 36229 flow [2023-12-05 20:59:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-05 20:59:40,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-12-05 20:59:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5545 transitions. [2023-12-05 20:59:40,428 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4800034626038781 [2023-12-05 20:59:40,428 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5545 transitions. [2023-12-05 20:59:40,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5545 transitions. [2023-12-05 20:59:40,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:40,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5545 transitions. [2023-12-05 20:59:40,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 173.28125) internal successors, (5545), 32 states have internal predecessors, (5545), 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:59:40,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 361.0) internal successors, (11913), 33 states have internal predecessors, (11913), 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:59:40,440 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 361.0) internal successors, (11913), 33 states have internal predecessors, (11913), 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:59:40,440 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 167 predicate places. [2023-12-05 20:59:40,440 INFO L500 AbstractCegarLoop]: Abstraction has has 505 places, 1091 transitions, 36229 flow [2023-12-05 20:59:40,441 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 168.69230769230768) internal successors, (4386), 26 states have internal predecessors, (4386), 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:59:40,441 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:40,441 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, 1, 1, 1, 1, 1, 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:59:40,441 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-05 20:59:40,441 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:40,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1089893773, now seen corresponding path program 2 times [2023-12-05 20:59:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:40,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372820573] [2023-12-05 20:59:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:41,970 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:59:41,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:41,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372820573] [2023-12-05 20:59:41,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372820573] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:41,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:41,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-12-05 20:59:41,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926808043] [2023-12-05 20:59:41,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:41,971 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-05 20:59:41,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-05 20:59:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2023-12-05 20:59:41,973 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 361 [2023-12-05 20:59:41,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 1091 transitions, 36229 flow. Second operand has 28 states, 28 states have (on average 168.5) internal successors, (4718), 28 states have internal predecessors, (4718), 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:59:41,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:41,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 361 [2023-12-05 20:59:41,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:49,441 INFO L124 PetriNetUnfolderBase]: 6975/16756 cut-off events. [2023-12-05 20:59:49,442 INFO L125 PetriNetUnfolderBase]: For 891829/898047 co-relation queries the response was YES. [2023-12-05 20:59:49,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215942 conditions, 16756 events. 6975/16756 cut-off events. For 891829/898047 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 145624 event pairs, 535 based on Foata normal form. 152/16214 useless extension candidates. Maximal degree in co-relation 208498. Up to 10191 conditions per place. [2023-12-05 20:59:49,905 INFO L140 encePairwiseOnDemand]: 324/361 looper letters, 855 selfloop transitions, 80 changer transitions 4/1099 dead transitions. [2023-12-05 20:59:49,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 1099 transitions, 38461 flow [2023-12-05 20:59:49,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-05 20:59:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-12-05 20:59:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5020 transitions. [2023-12-05 20:59:49,910 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4795109370522495 [2023-12-05 20:59:49,910 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5020 transitions. [2023-12-05 20:59:49,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5020 transitions. [2023-12-05 20:59:49,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:49,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5020 transitions. [2023-12-05 20:59:49,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 173.10344827586206) internal successors, (5020), 29 states have internal predecessors, (5020), 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:59:49,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 361.0) internal successors, (10830), 30 states have internal predecessors, (10830), 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:59:49,920 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 361.0) internal successors, (10830), 30 states have internal predecessors, (10830), 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:59:49,920 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 195 predicate places. [2023-12-05 20:59:49,921 INFO L500 AbstractCegarLoop]: Abstraction has has 533 places, 1099 transitions, 38461 flow [2023-12-05 20:59:49,921 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 168.5) internal successors, (4718), 28 states have internal predecessors, (4718), 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:59:49,921 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:49,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:49,921 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-05 20:59:49,921 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:49,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1565800729, now seen corresponding path program 1 times [2023-12-05 20:59:49,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:49,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316333423] [2023-12-05 20:59:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:49,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:50,110 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:59:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316333423] [2023-12-05 20:59:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316333423] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:50,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:50,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 20:59:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032877199] [2023-12-05 20:59:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:50,111 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 20:59:50,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:50,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 20:59:50,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-05 20:59:50,113 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 361 [2023-12-05 20:59:50,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 1099 transitions, 38461 flow. Second operand has 8 states, 8 states have (on average 209.125) internal successors, (1673), 8 states have internal predecessors, (1673), 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:59:50,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:50,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 361 [2023-12-05 20:59:50,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 20:59:57,281 INFO L124 PetriNetUnfolderBase]: 9108/21208 cut-off events. [2023-12-05 20:59:57,281 INFO L125 PetriNetUnfolderBase]: For 1406601/1414936 co-relation queries the response was YES. [2023-12-05 20:59:57,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282677 conditions, 21208 events. 9108/21208 cut-off events. For 1406601/1414936 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 189003 event pairs, 469 based on Foata normal form. 97/20258 useless extension candidates. Maximal degree in co-relation 274761. Up to 12637 conditions per place. [2023-12-05 20:59:57,643 INFO L140 encePairwiseOnDemand]: 354/361 looper letters, 1044 selfloop transitions, 5 changer transitions 4/1316 dead transitions. [2023-12-05 20:59:57,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 1316 transitions, 50389 flow [2023-12-05 20:59:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-05 20:59:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-05 20:59:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1354 transitions. [2023-12-05 20:59:57,646 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6251154201292706 [2023-12-05 20:59:57,646 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1354 transitions. [2023-12-05 20:59:57,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1354 transitions. [2023-12-05 20:59:57,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 20:59:57,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1354 transitions. [2023-12-05 20:59:57,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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:59:57,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 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:59:57,649 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 361.0) internal successors, (2527), 7 states have internal predecessors, (2527), 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:59:57,649 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 200 predicate places. [2023-12-05 20:59:57,649 INFO L500 AbstractCegarLoop]: Abstraction has has 538 places, 1316 transitions, 50389 flow [2023-12-05 20:59:57,649 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 209.125) internal successors, (1673), 8 states have internal predecessors, (1673), 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:59:57,649 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 20:59:57,650 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:57,650 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-05 20:59:57,650 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 20:59:57,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 20:59:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash 560730454, now seen corresponding path program 1 times [2023-12-05 20:59:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 20:59:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408095847] [2023-12-05 20:59:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 20:59:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 20:59:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 20:59:57,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 20:59:57,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 20:59:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408095847] [2023-12-05 20:59:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408095847] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 20:59:57,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 20:59:57,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 20:59:57,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752729264] [2023-12-05 20:59:57,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 20:59:57,689 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 20:59:57,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 20:59:57,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 20:59:57,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 20:59:57,689 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 361 [2023-12-05 20:59:57,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 1316 transitions, 50389 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 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:59:57,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 20:59:57,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 361 [2023-12-05 20:59:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:00,444 INFO L124 PetriNetUnfolderBase]: 3322/8262 cut-off events. [2023-12-05 21:00:00,445 INFO L125 PetriNetUnfolderBase]: For 682544/685673 co-relation queries the response was YES. [2023-12-05 21:00:00,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109310 conditions, 8262 events. 3322/8262 cut-off events. For 682544/685673 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 64075 event pairs, 248 based on Foata normal form. 5/7756 useless extension candidates. Maximal degree in co-relation 102854. Up to 4409 conditions per place. [2023-12-05 21:00:00,719 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 288 selfloop transitions, 5 changer transitions 7/802 dead transitions. [2023-12-05 21:00:00,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 802 transitions, 29405 flow [2023-12-05 21:00:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1022 transitions. [2023-12-05 21:00:00,720 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9436749769159741 [2023-12-05 21:00:00,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1022 transitions. [2023-12-05 21:00:00,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1022 transitions. [2023-12-05 21:00:00,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:00,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1022 transitions. [2023-12-05 21:00:00,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 340.6666666666667) internal successors, (1022), 3 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:00,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:00,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:00,723 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 200 predicate places. [2023-12-05 21:00:00,723 INFO L500 AbstractCegarLoop]: Abstraction has has 538 places, 802 transitions, 29405 flow [2023-12-05 21:00:00,723 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:00,723 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:00,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:00,723 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-05 21:00:00,723 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 21:00:00,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1087407215, now seen corresponding path program 1 times [2023-12-05 21:00:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035652269] [2023-12-05 21:00:00,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:00,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:00,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035652269] [2023-12-05 21:00:00,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035652269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:00,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:00,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:00:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422203710] [2023-12-05 21:00:00,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:00,807 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:00:00,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:00,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:00:00,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:00:00,808 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 361 [2023-12-05 21:00:00,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 802 transitions, 29405 flow. Second operand has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:00,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:00,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 361 [2023-12-05 21:00:00,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:02,458 INFO L124 PetriNetUnfolderBase]: 1922/5630 cut-off events. [2023-12-05 21:00:02,458 INFO L125 PetriNetUnfolderBase]: For 549166/552608 co-relation queries the response was YES. [2023-12-05 21:00:02,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65184 conditions, 5630 events. 1922/5630 cut-off events. For 549166/552608 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 41672 event pairs, 212 based on Foata normal form. 575/5840 useless extension candidates. Maximal degree in co-relation 58402. Up to 2599 conditions per place. [2023-12-05 21:00:02,524 INFO L140 encePairwiseOnDemand]: 355/361 looper letters, 101 selfloop transitions, 45 changer transitions 43/689 dead transitions. [2023-12-05 21:00:02,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 689 transitions, 23973 flow [2023-12-05 21:00:02,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:00:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:00:02,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2023-12-05 21:00:02,525 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9390581717451524 [2023-12-05 21:00:02,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1017 transitions. [2023-12-05 21:00:02,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1017 transitions. [2023-12-05 21:00:02,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:02,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1017 transitions. [2023-12-05 21:00:02,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:02,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:02,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 361.0) internal successors, (1444), 4 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:02,527 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 202 predicate places. [2023-12-05 21:00:02,527 INFO L500 AbstractCegarLoop]: Abstraction has has 540 places, 689 transitions, 23973 flow [2023-12-05 21:00:02,528 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.3333333333333) internal successors, (1009), 3 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:02,528 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:02,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:02,528 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-05 21:00:02,528 INFO L425 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 21:00:02,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:02,528 INFO L85 PathProgramCache]: Analyzing trace with hash -190263379, now seen corresponding path program 1 times [2023-12-05 21:00:02,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:02,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916258258] [2023-12-05 21:00:02,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:02,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:02,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916258258] [2023-12-05 21:00:02,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916258258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:02,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:02,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-05 21:00:02,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018182713] [2023-12-05 21:00:02,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:02,795 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-05 21:00:02,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:02,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-05 21:00:02,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-05 21:00:02,796 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 361 [2023-12-05 21:00:02,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 689 transitions, 23973 flow. Second operand has 10 states, 10 states have (on average 228.6) internal successors, (2286), 10 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:02,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:02,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 361 [2023-12-05 21:00:02,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:04,610 INFO L124 PetriNetUnfolderBase]: 1776/5274 cut-off events. [2023-12-05 21:00:04,610 INFO L125 PetriNetUnfolderBase]: For 474485/476181 co-relation queries the response was YES. [2023-12-05 21:00:04,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64413 conditions, 5274 events. 1776/5274 cut-off events. For 474485/476181 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 38113 event pairs, 184 based on Foata normal form. 158/5095 useless extension candidates. Maximal degree in co-relation 57671. Up to 2419 conditions per place. [2023-12-05 21:00:04,681 INFO L140 encePairwiseOnDemand]: 340/361 looper letters, 401 selfloop transitions, 15 changer transitions 43/685 dead transitions. [2023-12-05 21:00:04,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 685 transitions, 25095 flow [2023-12-05 21:00:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-05 21:00:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-05 21:00:04,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2775 transitions. [2023-12-05 21:00:04,692 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6405817174515236 [2023-12-05 21:00:04,693 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2775 transitions. [2023-12-05 21:00:04,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2775 transitions. [2023-12-05 21:00:04,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:04,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2775 transitions. [2023-12-05 21:00:04,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 231.25) internal successors, (2775), 12 states have internal predecessors, (2775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:04,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:04,705 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 361.0) internal successors, (4693), 13 states have internal predecessors, (4693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:04,706 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 206 predicate places. [2023-12-05 21:00:04,707 INFO L500 AbstractCegarLoop]: Abstraction has has 544 places, 685 transitions, 25095 flow [2023-12-05 21:00:04,707 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 228.6) internal successors, (2286), 10 states have internal predecessors, (2286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:04,707 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:04,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:04,707 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-05 21:00:04,707 INFO L425 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 21:00:04,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:04,708 INFO L85 PathProgramCache]: Analyzing trace with hash -190263380, now seen corresponding path program 1 times [2023-12-05 21:00:04,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:04,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988928575] [2023-12-05 21:00:04,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:04,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:04,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:04,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988928575] [2023-12-05 21:00:04,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988928575] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:04,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:04,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-05 21:00:04,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880967128] [2023-12-05 21:00:04,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:04,832 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-05 21:00:04,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:04,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-05 21:00:04,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-05 21:00:04,834 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 361 [2023-12-05 21:00:04,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 685 transitions, 25095 flow. Second operand has 8 states, 8 states have (on average 232.625) internal successors, (1861), 8 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 21:00:04,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:04,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 361 [2023-12-05 21:00:04,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:06,385 INFO L124 PetriNetUnfolderBase]: 1514/4749 cut-off events. [2023-12-05 21:00:06,386 INFO L125 PetriNetUnfolderBase]: For 472462/474138 co-relation queries the response was YES. [2023-12-05 21:00:06,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59304 conditions, 4749 events. 1514/4749 cut-off events. For 472462/474138 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 33619 event pairs, 135 based on Foata normal form. 212/4667 useless extension candidates. Maximal degree in co-relation 53485. Up to 2109 conditions per place. [2023-12-05 21:00:06,445 INFO L140 encePairwiseOnDemand]: 344/361 looper letters, 375 selfloop transitions, 10 changer transitions 43/661 dead transitions. [2023-12-05 21:00:06,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 661 transitions, 24991 flow [2023-12-05 21:00:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-05 21:00:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-05 21:00:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2120 transitions. [2023-12-05 21:00:06,447 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6525084641428132 [2023-12-05 21:00:06,447 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2120 transitions. [2023-12-05 21:00:06,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2120 transitions. [2023-12-05 21:00:06,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:06,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2120 transitions. [2023-12-05 21:00:06,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 235.55555555555554) internal successors, (2120), 9 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:06,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:06,451 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 361.0) internal successors, (3610), 10 states have internal predecessors, (3610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:06,451 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 206 predicate places. [2023-12-05 21:00:06,451 INFO L500 AbstractCegarLoop]: Abstraction has has 544 places, 661 transitions, 24991 flow [2023-12-05 21:00:06,452 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 232.625) internal successors, (1861), 8 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 21:00:06,452 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:06,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:06,452 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-05 21:00:06,452 INFO L425 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 21:00:06,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1603196499, now seen corresponding path program 1 times [2023-12-05 21:00:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:06,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996089261] [2023-12-05 21:00:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:07,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:07,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996089261] [2023-12-05 21:00:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996089261] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:07,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-12-05 21:00:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444084609] [2023-12-05 21:00:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:07,204 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-05 21:00:07,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:07,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-05 21:00:07,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-12-05 21:00:07,206 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 361 [2023-12-05 21:00:07,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 661 transitions, 24991 flow. Second operand has 19 states, 19 states have (on average 173.1578947368421) internal successors, (3290), 19 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:07,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:07,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 361 [2023-12-05 21:00:07,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:09,100 INFO L124 PetriNetUnfolderBase]: 1517/4722 cut-off events. [2023-12-05 21:00:09,100 INFO L125 PetriNetUnfolderBase]: For 475495/477163 co-relation queries the response was YES. [2023-12-05 21:00:09,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62000 conditions, 4722 events. 1517/4722 cut-off events. For 475495/477163 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 33260 event pairs, 135 based on Foata normal form. 0/4436 useless extension candidates. Maximal degree in co-relation 55965. Up to 2126 conditions per place. [2023-12-05 21:00:09,171 INFO L140 encePairwiseOnDemand]: 331/361 looper letters, 422 selfloop transitions, 53 changer transitions 43/687 dead transitions. [2023-12-05 21:00:09,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 687 transitions, 27323 flow [2023-12-05 21:00:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-05 21:00:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-12-05 21:00:09,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3525 transitions. [2023-12-05 21:00:09,174 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48822714681440443 [2023-12-05 21:00:09,174 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3525 transitions. [2023-12-05 21:00:09,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3525 transitions. [2023-12-05 21:00:09,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:09,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3525 transitions. [2023-12-05 21:00:09,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 176.25) internal successors, (3525), 20 states have internal predecessors, (3525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:09,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 361.0) internal successors, (7581), 21 states have internal predecessors, (7581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:09,180 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 361.0) internal successors, (7581), 21 states have internal predecessors, (7581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:09,180 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 225 predicate places. [2023-12-05 21:00:09,180 INFO L500 AbstractCegarLoop]: Abstraction has has 563 places, 687 transitions, 27323 flow [2023-12-05 21:00:09,181 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 173.1578947368421) internal successors, (3290), 19 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:09,181 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:09,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:09,181 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-05 21:00:09,181 INFO L425 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 21:00:09,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:09,181 INFO L85 PathProgramCache]: Analyzing trace with hash 838679639, now seen corresponding path program 2 times [2023-12-05 21:00:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:09,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555722419] [2023-12-05 21:00:09,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:09,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:10,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:10,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555722419] [2023-12-05 21:00:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555722419] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-05 21:00:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698497895] [2023-12-05 21:00:10,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:10,056 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-05 21:00:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:10,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-05 21:00:10,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-05 21:00:10,058 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 361 [2023-12-05 21:00:10,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 687 transitions, 27323 flow. Second operand has 18 states, 18 states have (on average 187.33333333333334) internal successors, (3372), 18 states have internal predecessors, (3372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:10,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:10,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 361 [2023-12-05 21:00:10,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:11,584 INFO L124 PetriNetUnfolderBase]: 1086/3491 cut-off events. [2023-12-05 21:00:11,584 INFO L125 PetriNetUnfolderBase]: For 357158/358482 co-relation queries the response was YES. [2023-12-05 21:00:11,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46577 conditions, 3491 events. 1086/3491 cut-off events. For 357158/358482 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 22404 event pairs, 100 based on Foata normal form. 0/3284 useless extension candidates. Maximal degree in co-relation 42061. Up to 1535 conditions per place. [2023-12-05 21:00:11,641 INFO L140 encePairwiseOnDemand]: 340/361 looper letters, 336 selfloop transitions, 34 changer transitions 30/566 dead transitions. [2023-12-05 21:00:11,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 566 transitions, 21914 flow [2023-12-05 21:00:11,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-05 21:00:11,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-12-05 21:00:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3227 transitions. [2023-12-05 21:00:11,644 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5258269512791266 [2023-12-05 21:00:11,644 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3227 transitions. [2023-12-05 21:00:11,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3227 transitions. [2023-12-05 21:00:11,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:11,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3227 transitions. [2023-12-05 21:00:11,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 189.8235294117647) internal successors, (3227), 17 states have internal predecessors, (3227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:11,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 361.0) internal successors, (6498), 18 states have internal predecessors, (6498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:11,650 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 361.0) internal successors, (6498), 18 states have internal predecessors, (6498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:11,650 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 230 predicate places. [2023-12-05 21:00:11,650 INFO L500 AbstractCegarLoop]: Abstraction has has 568 places, 566 transitions, 21914 flow [2023-12-05 21:00:11,651 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 187.33333333333334) internal successors, (3372), 18 states have internal predecessors, (3372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:11,651 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:11,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:11,651 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-05 21:00:11,651 INFO L425 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 21:00:11,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:11,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1529085012, now seen corresponding path program 1 times [2023-12-05 21:00:11,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:11,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116304868] [2023-12-05 21:00:11,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:00:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:00:13,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:00:13,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116304868] [2023-12-05 21:00:13,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116304868] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:00:13,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:00:13,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2023-12-05 21:00:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843418548] [2023-12-05 21:00:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:00:13,233 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-05 21:00:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:00:13,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-05 21:00:13,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2023-12-05 21:00:13,236 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 361 [2023-12-05 21:00:13,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 566 transitions, 21914 flow. Second operand has 31 states, 31 states have (on average 158.90322580645162) internal successors, (4926), 31 states have internal predecessors, (4926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:13,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:00:13,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 361 [2023-12-05 21:00:13,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:00:15,583 INFO L124 PetriNetUnfolderBase]: 1084/3479 cut-off events. [2023-12-05 21:00:15,583 INFO L125 PetriNetUnfolderBase]: For 382846/384340 co-relation queries the response was YES. [2023-12-05 21:00:15,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48152 conditions, 3479 events. 1084/3479 cut-off events. For 382846/384340 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 22126 event pairs, 103 based on Foata normal form. 8/3285 useless extension candidates. Maximal degree in co-relation 43476. Up to 1527 conditions per place. [2023-12-05 21:00:15,645 INFO L140 encePairwiseOnDemand]: 321/361 looper letters, 323 selfloop transitions, 77 changer transitions 30/572 dead transitions. [2023-12-05 21:00:15,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 572 transitions, 22925 flow [2023-12-05 21:00:15,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-05 21:00:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-12-05 21:00:15,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5020 transitions. [2023-12-05 21:00:15,648 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4485747475650076 [2023-12-05 21:00:15,648 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5020 transitions. [2023-12-05 21:00:15,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5020 transitions. [2023-12-05 21:00:15,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:00:15,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5020 transitions. [2023-12-05 21:00:15,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 161.93548387096774) internal successors, (5020), 31 states have internal predecessors, (5020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 361.0) internal successors, (11552), 32 states have internal predecessors, (11552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,658 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 361.0) internal successors, (11552), 32 states have internal predecessors, (11552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,659 INFO L308 CegarLoopForPetriNet]: 338 programPoint places, 260 predicate places. [2023-12-05 21:00:15,659 INFO L500 AbstractCegarLoop]: Abstraction has has 598 places, 572 transitions, 22925 flow [2023-12-05 21:00:15,660 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 158.90322580645162) internal successors, (4926), 31 states have internal predecessors, (4926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:00:15,660 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:00:15,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:00:15,660 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-05 21:00:15,660 INFO L425 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 133 more)] === [2023-12-05 21:00:15,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:00:15,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1695799099, now seen corresponding path program 1 times [2023-12-05 21:00:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:00:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988802704] [2023-12-05 21:00:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:00:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:00:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-05 21:02:21,407 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-05 21:02:21,460 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-05 21:02:21,461 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:219) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-05 21:02:21,469 INFO L158 Benchmark]: Toolchain (without parser) took 242966.04ms. Allocated memory was 181.4MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 129.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 6.9GB. Max. memory is 8.0GB. [2023-12-05 21:02:21,469 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 137.4MB in the beginning and 137.2MB in the end (delta: 178.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-05 21:02:21,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.17ms. Allocated memory is still 181.4MB. Free memory was 129.2MB in the beginning and 98.7MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-05 21:02:21,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.10ms. Allocated memory is still 181.4MB. Free memory was 98.7MB in the beginning and 152.7MB in the end (delta: -54.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. [2023-12-05 21:02:21,470 INFO L158 Benchmark]: Boogie Preprocessor took 49.45ms. Allocated memory is still 181.4MB. Free memory was 152.7MB in the beginning and 150.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-05 21:02:21,470 INFO L158 Benchmark]: RCFGBuilder took 682.87ms. Allocated memory is still 181.4MB. Free memory was 150.1MB in the beginning and 113.9MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-05 21:02:21,471 INFO L158 Benchmark]: TraceAbstraction took 241676.90ms. Allocated memory was 181.4MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 112.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 6.8GB. Max. memory is 8.0GB. [2023-12-05 21:02:21,475 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.11ms. Allocated memory is still 181.4MB. Free memory was 137.4MB in the beginning and 137.2MB in the end (delta: 178.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 459.17ms. Allocated memory is still 181.4MB. Free memory was 129.2MB in the beginning and 98.7MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 92.10ms. Allocated memory is still 181.4MB. Free memory was 98.7MB in the beginning and 152.7MB in the end (delta: -54.0MB). Peak memory consumption was 9.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 49.45ms. Allocated memory is still 181.4MB. Free memory was 152.7MB in the beginning and 150.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 682.87ms. Allocated memory is still 181.4MB. Free memory was 150.1MB in the beginning and 113.9MB in the end (delta: 36.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 241676.90ms. Allocated memory was 181.4MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 112.9MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 6.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown