/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/08_rand_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:19:27,964 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:19:28,025 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 04:19:28,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:19:28,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:19:28,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:19:28,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:19:28,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:19:28,055 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:19:28,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:19:28,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:19:28,059 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:19:28,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:19:28,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:19:28,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:19:28,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:19:28,060 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:19:28,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:19:28,060 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:19:28,060 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:19:28,061 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:19:28,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:19:28,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:19:28,062 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:19:28,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:19:28,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:19:28,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:19:28,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:19:28,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:19:28,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:19:28,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:19:28,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:19:28,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:19:28,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:19:28,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:19:28,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:19:28,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:19:28,235 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:19:28,235 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:19:28,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/08_rand_cas.i [2023-11-30 04:19:29,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:19:29,462 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:19:29,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i [2023-11-30 04:19:29,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6487bede3/962b33c6288345a1bb0ec0a61bdf2e8e/FLAG411d5c9ac [2023-11-30 04:19:29,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6487bede3/962b33c6288345a1bb0ec0a61bdf2e8e [2023-11-30 04:19:29,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:19:29,496 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:19:29,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:19:29,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:19:29,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:19:29,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0b62e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29, skipping insertion in model container [2023-11-30 04:19:29,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,547 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:19:29,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:19:29,824 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:19:29,873 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:19:29,896 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:19:29,896 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 04:19:29,901 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:19:29,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29 WrapperNode [2023-11-30 04:19:29,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:19:29,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:19:29,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:19:29,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:19:29,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,955 INFO L138 Inliner]: procedures = 178, calls = 41, calls flagged for inlining = 16, calls inlined = 17, statements flattened = 155 [2023-11-30 04:19:29,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:19:29,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:19:29,956 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:19:29,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:19:29,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,991 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:29,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:19:29,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:19:29,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:19:29,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:19:29,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (1/1) ... [2023-11-30 04:19:30,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:19:30,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:19:30,036 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 04:19:30,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 04:19:30,078 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 04:19:30,079 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 04:19:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:19:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 04:19:30,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:19:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:19:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:19:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:19:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 04:19:30,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:19:30,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:19:30,081 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:19:30,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 04:19:30,184 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:19:30,186 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:19:30,422 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:19:30,536 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:19:30,536 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-30 04:19:30,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:19:30 BoogieIcfgContainer [2023-11-30 04:19:30,537 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:19:30,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:19:30,539 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:19:30,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:19:30,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:19:29" (1/3) ... [2023-11-30 04:19:30,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36426721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:19:30, skipping insertion in model container [2023-11-30 04:19:30,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:19:29" (2/3) ... [2023-11-30 04:19:30,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36426721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:19:30, skipping insertion in model container [2023-11-30 04:19:30,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:19:30" (3/3) ... [2023-11-30 04:19:30,543 INFO L112 eAbstractionObserver]: Analyzing ICFG 08_rand_cas.i [2023-11-30 04:19:30,556 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:19:30,557 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-30 04:19:30,557 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:19:30,641 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:19:30,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 151 transitions, 306 flow [2023-11-30 04:19:30,745 INFO L124 PetriNetUnfolderBase]: 17/164 cut-off events. [2023-11-30 04:19:30,746 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:19:30,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 164 events. 17/164 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 341 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2023-11-30 04:19:30,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 151 transitions, 306 flow [2023-11-30 04:19:30,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 151 transitions, 306 flow [2023-11-30 04:19:30,767 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:19:30,778 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;@2cc427df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:19:30,778 INFO L363 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2023-11-30 04:19:30,784 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:19:30,784 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2023-11-30 04:19:30,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:19:30,784 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:30,785 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:30,785 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-30 04:19:30,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:30,789 INFO L85 PathProgramCache]: Analyzing trace with hash 125640609, now seen corresponding path program 1 times [2023-11-30 04:19:30,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:30,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188023239] [2023-11-30 04:19:30,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:30,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:19:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:19:31,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:19:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188023239] [2023-11-30 04:19:31,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188023239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:19:31,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:19:31,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:19:31,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569803569] [2023-11-30 04:19:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:19:31,026 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:19:31,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:19:31,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:19:31,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:19:31,047 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 151 [2023-11-30 04:19:31,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 151 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:19:31,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 151 [2023-11-30 04:19:31,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:19:31,189 INFO L124 PetriNetUnfolderBase]: 52/372 cut-off events. [2023-11-30 04:19:31,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:19:31,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 372 events. 52/372 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1680 event pairs, 42 based on Foata normal form. 53/342 useless extension candidates. Maximal degree in co-relation 463. Up to 112 conditions per place. [2023-11-30 04:19:31,197 INFO L140 encePairwiseOnDemand]: 132/151 looper letters, 31 selfloop transitions, 3 changer transitions 0/123 dead transitions. [2023-11-30 04:19:31,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 123 transitions, 318 flow [2023-11-30 04:19:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:19:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:19:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-11-30 04:19:31,213 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7682119205298014 [2023-11-30 04:19:31,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-11-30 04:19:31,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-11-30 04:19:31,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:19:31,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-11-30 04:19:31,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,225 INFO L307 CegarLoopForPetriNet]: 138 programPoint places, -16 predicate places. [2023-11-30 04:19:31,226 INFO L500 AbstractCegarLoop]: Abstraction has has 122 places, 123 transitions, 318 flow [2023-11-30 04:19:31,226 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,226 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:31,226 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:31,226 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:19:31,227 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-30 04:19:31,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:31,227 INFO L85 PathProgramCache]: Analyzing trace with hash 125640610, now seen corresponding path program 1 times [2023-11-30 04:19:31,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:31,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957198984] [2023-11-30 04:19:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:19:31,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:19:31,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:19:31,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957198984] [2023-11-30 04:19:31,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957198984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:19:31,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:19:31,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:19:31,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656462556] [2023-11-30 04:19:31,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:19:31,356 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:19:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:19:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:19:31,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:19:31,359 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 151 [2023-11-30 04:19:31,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 123 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:19:31,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 151 [2023-11-30 04:19:31,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:19:31,427 INFO L124 PetriNetUnfolderBase]: 29/251 cut-off events. [2023-11-30 04:19:31,427 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2023-11-30 04:19:31,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 251 events. 29/251 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 880 event pairs, 23 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 368. Up to 71 conditions per place. [2023-11-30 04:19:31,429 INFO L140 encePairwiseOnDemand]: 149/151 looper letters, 29 selfloop transitions, 1 changer transitions 0/121 dead transitions. [2023-11-30 04:19:31,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 121 transitions, 370 flow [2023-11-30 04:19:31,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:19:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:19:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2023-11-30 04:19:31,431 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7284768211920529 [2023-11-30 04:19:31,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2023-11-30 04:19:31,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2023-11-30 04:19:31,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:19:31,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2023-11-30 04:19:31,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,437 INFO L307 CegarLoopForPetriNet]: 138 programPoint places, -15 predicate places. [2023-11-30 04:19:31,438 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 121 transitions, 370 flow [2023-11-30 04:19:31,438 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,438 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:31,438 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:31,438 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:19:31,438 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2023-11-30 04:19:31,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:31,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1975057699, now seen corresponding path program 1 times [2023-11-30 04:19:31,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:31,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188547641] [2023-11-30 04:19:31,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:31,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:19:31,468 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:19:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:19:31,503 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:19:31,503 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:19:31,504 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 35 remaining) [2023-11-30 04:19:31,506 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 35 remaining) [2023-11-30 04:19:31,506 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 35 remaining) [2023-11-30 04:19:31,507 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 35 remaining) [2023-11-30 04:19:31,507 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 35 remaining) [2023-11-30 04:19:31,508 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 35 remaining) [2023-11-30 04:19:31,511 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 35 remaining) [2023-11-30 04:19:31,513 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 35 remaining) [2023-11-30 04:19:31,514 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 35 remaining) [2023-11-30 04:19:31,514 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 35 remaining) [2023-11-30 04:19:31,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 35 remaining) [2023-11-30 04:19:31,515 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 35 remaining) [2023-11-30 04:19:31,516 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 35 remaining) [2023-11-30 04:19:31,516 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 35 remaining) [2023-11-30 04:19:31,517 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 35 remaining) [2023-11-30 04:19:31,519 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 35 remaining) [2023-11-30 04:19:31,519 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 35 remaining) [2023-11-30 04:19:31,519 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 35 remaining) [2023-11-30 04:19:31,520 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 35 remaining) [2023-11-30 04:19:31,520 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 35 remaining) [2023-11-30 04:19:31,520 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 35 remaining) [2023-11-30 04:19:31,520 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 35 remaining) [2023-11-30 04:19:31,520 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 35 remaining) [2023-11-30 04:19:31,520 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 35 remaining) [2023-11-30 04:19:31,520 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 35 remaining) [2023-11-30 04:19:31,521 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 35 remaining) [2023-11-30 04:19:31,521 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 35 remaining) [2023-11-30 04:19:31,521 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 35 remaining) [2023-11-30 04:19:31,521 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 35 remaining) [2023-11-30 04:19:31,521 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 35 remaining) [2023-11-30 04:19:31,521 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 35 remaining) [2023-11-30 04:19:31,521 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 35 remaining) [2023-11-30 04:19:31,522 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 35 remaining) [2023-11-30 04:19:31,522 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 35 remaining) [2023-11-30 04:19:31,522 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 35 remaining) [2023-11-30 04:19:31,522 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:19:31,522 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:19:31,524 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:19:31,524 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 04:19:31,637 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:19:31,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 246 places, 272 transitions, 554 flow [2023-11-30 04:19:31,680 INFO L124 PetriNetUnfolderBase]: 33/300 cut-off events. [2023-11-30 04:19:31,680 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:19:31,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 300 events. 33/300 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1054 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 255. Up to 6 conditions per place. [2023-11-30 04:19:31,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 246 places, 272 transitions, 554 flow [2023-11-30 04:19:31,688 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 272 transitions, 554 flow [2023-11-30 04:19:31,689 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:19:31,693 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;@2cc427df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:19:31,693 INFO L363 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-11-30 04:19:31,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:19:31,695 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2023-11-30 04:19:31,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:19:31,695 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:31,696 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:31,696 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-30 04:19:31,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash 200036769, now seen corresponding path program 1 times [2023-11-30 04:19:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131996108] [2023-11-30 04:19:31,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:19:31,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:19:31,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:19:31,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131996108] [2023-11-30 04:19:31,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131996108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:19:31,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:19:31,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:19:31,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974517938] [2023-11-30 04:19:31,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:19:31,755 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:19:31,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:19:31,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:19:31,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:19:31,757 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 272 [2023-11-30 04:19:31,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 272 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:31,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:19:31,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 272 [2023-11-30 04:19:31,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:19:33,069 INFO L124 PetriNetUnfolderBase]: 3102/11497 cut-off events. [2023-11-30 04:19:33,069 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-11-30 04:19:33,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16282 conditions, 11497 events. 3102/11497 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 130374 event pairs, 2438 based on Foata normal form. 2044/10281 useless extension candidates. Maximal degree in co-relation 3801. Up to 4270 conditions per place. [2023-11-30 04:19:33,137 INFO L140 encePairwiseOnDemand]: 239/272 looper letters, 98 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2023-11-30 04:19:33,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 266 transitions, 751 flow [2023-11-30 04:19:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:19:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:19:33,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2023-11-30 04:19:33,139 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8566176470588235 [2023-11-30 04:19:33,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 699 transitions. [2023-11-30 04:19:33,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions. [2023-11-30 04:19:33,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:19:33,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions. [2023-11-30 04:19:33,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:33,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:33,142 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:33,144 INFO L307 CegarLoopForPetriNet]: 246 programPoint places, -28 predicate places. [2023-11-30 04:19:33,145 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 266 transitions, 751 flow [2023-11-30 04:19:33,145 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:33,145 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:33,145 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:33,145 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:19:33,145 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-30 04:19:33,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash 200036770, now seen corresponding path program 1 times [2023-11-30 04:19:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:33,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790635558] [2023-11-30 04:19:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:19:33,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:19:33,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:19:33,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790635558] [2023-11-30 04:19:33,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790635558] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:19:33,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:19:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:19:33,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394587764] [2023-11-30 04:19:33,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:19:33,219 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:19:33,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:19:33,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:19:33,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:19:33,221 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 272 [2023-11-30 04:19:33,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 266 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:33,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:19:33,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 272 [2023-11-30 04:19:33,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:19:34,003 INFO L124 PetriNetUnfolderBase]: 2188/8226 cut-off events. [2023-11-30 04:19:34,003 INFO L125 PetriNetUnfolderBase]: For 984/1450 co-relation queries the response was YES. [2023-11-30 04:19:34,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14765 conditions, 8226 events. 2188/8226 cut-off events. For 984/1450 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 87609 event pairs, 1734 based on Foata normal form. 0/6435 useless extension candidates. Maximal degree in co-relation 3568. Up to 3166 conditions per place. [2023-11-30 04:19:34,053 INFO L140 encePairwiseOnDemand]: 270/272 looper letters, 90 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2023-11-30 04:19:34,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 264 transitions, 925 flow [2023-11-30 04:19:34,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:19:34,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:19:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 601 transitions. [2023-11-30 04:19:34,058 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7365196078431373 [2023-11-30 04:19:34,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 601 transitions. [2023-11-30 04:19:34,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 601 transitions. [2023-11-30 04:19:34,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:19:34,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 601 transitions. [2023-11-30 04:19:34,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:34,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:34,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 272.0) internal successors, (1088), 4 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:34,062 INFO L307 CegarLoopForPetriNet]: 246 programPoint places, -27 predicate places. [2023-11-30 04:19:34,063 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 264 transitions, 925 flow [2023-11-30 04:19:34,063 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:34,064 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:34,064 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:34,064 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:19:34,064 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-30 04:19:34,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1533179312, now seen corresponding path program 1 times [2023-11-30 04:19:34,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:34,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71912902] [2023-11-30 04:19:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:34,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:19:34,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:19:34,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:19:34,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71912902] [2023-11-30 04:19:34,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71912902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:19:34,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:19:34,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:19:34,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993193213] [2023-11-30 04:19:34,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:19:34,241 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:19:34,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:19:34,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:19:34,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:19:34,242 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 272 [2023-11-30 04:19:34,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 264 transitions, 925 flow. Second operand has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:34,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:19:34,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 272 [2023-11-30 04:19:34,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:19:35,185 INFO L124 PetriNetUnfolderBase]: 1651/6960 cut-off events. [2023-11-30 04:19:35,185 INFO L125 PetriNetUnfolderBase]: For 2154/3150 co-relation queries the response was YES. [2023-11-30 04:19:35,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14694 conditions, 6960 events. 1651/6960 cut-off events. For 2154/3150 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 72883 event pairs, 1166 based on Foata normal form. 79/5686 useless extension candidates. Maximal degree in co-relation 4111. Up to 2505 conditions per place. [2023-11-30 04:19:35,224 INFO L140 encePairwiseOnDemand]: 244/272 looper letters, 163 selfloop transitions, 40 changer transitions 0/363 dead transitions. [2023-11-30 04:19:35,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 363 transitions, 1902 flow [2023-11-30 04:19:35,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:19:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:19:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1022 transitions. [2023-11-30 04:19:35,227 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7514705882352941 [2023-11-30 04:19:35,227 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1022 transitions. [2023-11-30 04:19:35,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1022 transitions. [2023-11-30 04:19:35,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:19:35,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1022 transitions. [2023-11-30 04:19:35,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 204.4) internal successors, (1022), 5 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-11-30 04:19:35,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:35,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 272.0) internal successors, (1632), 6 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:35,232 INFO L307 CegarLoopForPetriNet]: 246 programPoint places, -23 predicate places. [2023-11-30 04:19:35,232 INFO L500 AbstractCegarLoop]: Abstraction has has 223 places, 363 transitions, 1902 flow [2023-11-30 04:19:35,233 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:35,233 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:35,233 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:35,233 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:19:35,233 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-30 04:19:35,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1533179311, now seen corresponding path program 1 times [2023-11-30 04:19:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:35,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492945924] [2023-11-30 04:19:35,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:19:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:19:35,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:19:35,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492945924] [2023-11-30 04:19:35,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492945924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:19:35,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:19:35,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:19:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598802240] [2023-11-30 04:19:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:19:35,301 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:19:35,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:19:35,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:19:35,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:19:35,302 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 272 [2023-11-30 04:19:35,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 363 transitions, 1902 flow. Second operand has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:35,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:19:35,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 272 [2023-11-30 04:19:35,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:19:35,796 INFO L124 PetriNetUnfolderBase]: 1092/5256 cut-off events. [2023-11-30 04:19:35,796 INFO L125 PetriNetUnfolderBase]: For 3405/4634 co-relation queries the response was YES. [2023-11-30 04:19:35,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12051 conditions, 5256 events. 1092/5256 cut-off events. For 3405/4634 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 53112 event pairs, 742 based on Foata normal form. 70/4555 useless extension candidates. Maximal degree in co-relation 3686. Up to 1645 conditions per place. [2023-11-30 04:19:35,835 INFO L140 encePairwiseOnDemand]: 262/272 looper letters, 145 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2023-11-30 04:19:35,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 329 transitions, 1932 flow [2023-11-30 04:19:35,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:19:35,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:19:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2023-11-30 04:19:35,837 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7251838235294118 [2023-11-30 04:19:35,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2023-11-30 04:19:35,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2023-11-30 04:19:35,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:19:35,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2023-11-30 04:19:35,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.25) internal successors, (789), 4 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:35,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:35,840 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 272.0) internal successors, (1360), 5 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:35,841 INFO L307 CegarLoopForPetriNet]: 246 programPoint places, -28 predicate places. [2023-11-30 04:19:35,841 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 329 transitions, 1932 flow [2023-11-30 04:19:35,841 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:35,841 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:35,841 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:35,841 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:19:35,841 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 48 more)] === [2023-11-30 04:19:35,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1465967238, now seen corresponding path program 1 times [2023-11-30 04:19:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:35,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847019078] [2023-11-30 04:19:35,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:35,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:19:35,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:19:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:19:35,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:19:35,858 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:19:35,858 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 51 remaining) [2023-11-30 04:19:35,858 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 51 remaining) [2023-11-30 04:19:35,859 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 51 remaining) [2023-11-30 04:19:35,860 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 51 remaining) [2023-11-30 04:19:35,861 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 51 remaining) [2023-11-30 04:19:35,862 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 51 remaining) [2023-11-30 04:19:35,863 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:19:35,863 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 04:19:35,863 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:19:35,863 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 04:19:35,921 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:19:35,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 354 places, 393 transitions, 804 flow [2023-11-30 04:19:36,044 INFO L124 PetriNetUnfolderBase]: 49/436 cut-off events. [2023-11-30 04:19:36,044 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:19:36,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449 conditions, 436 events. 49/436 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1855 event pairs, 0 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 375. Up to 8 conditions per place. [2023-11-30 04:19:36,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 354 places, 393 transitions, 804 flow [2023-11-30 04:19:36,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 354 places, 393 transitions, 804 flow [2023-11-30 04:19:36,055 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:19:36,056 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;@2cc427df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:19:36,056 INFO L363 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-11-30 04:19:36,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:19:36,059 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2023-11-30 04:19:36,059 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:19:36,059 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:19:36,059 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:19:36,059 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-30 04:19:36,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:19:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash 733866945, now seen corresponding path program 1 times [2023-11-30 04:19:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:19:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792912150] [2023-11-30 04:19:36,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:19:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:19:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:19:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:19:36,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:19:36,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792912150] [2023-11-30 04:19:36,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792912150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:19:36,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:19:36,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:19:36,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460639603] [2023-11-30 04:19:36,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:19:36,101 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:19:36,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:19:36,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:19:36,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:19:36,102 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 393 [2023-11-30 04:19:36,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 393 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:19:36,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:19:36,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 393 [2023-11-30 04:19:36,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:20:11,727 INFO L124 PetriNetUnfolderBase]: 120215/339884 cut-off events. [2023-11-30 04:20:11,727 INFO L125 PetriNetUnfolderBase]: For 8690/8690 co-relation queries the response was YES. [2023-11-30 04:20:13,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501740 conditions, 339884 events. 120215/339884 cut-off events. For 8690/8690 co-relation queries the response was YES. Maximal size of possible extension queue 11337. Compared 5565020 event pairs, 90439 based on Foata normal form. 68551/300879 useless extension candidates. Maximal degree in co-relation 23052. Up to 137792 conditions per place. [2023-11-30 04:20:15,279 INFO L140 encePairwiseOnDemand]: 346/393 looper letters, 143 selfloop transitions, 5 changer transitions 0/387 dead transitions. [2023-11-30 04:20:15,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 387 transitions, 1100 flow [2023-11-30 04:20:15,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:20:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:20:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2023-11-30 04:20:15,282 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8625954198473282 [2023-11-30 04:20:15,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1017 transitions. [2023-11-30 04:20:15,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1017 transitions. [2023-11-30 04:20:15,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:20:15,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1017 transitions. [2023-11-30 04:20:15,284 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-11-30 04:20:15,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:15,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:15,286 INFO L307 CegarLoopForPetriNet]: 354 programPoint places, -40 predicate places. [2023-11-30 04:20:15,287 INFO L500 AbstractCegarLoop]: Abstraction has has 314 places, 387 transitions, 1100 flow [2023-11-30 04:20:15,287 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:15,287 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:20:15,287 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:20:15,287 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:20:15,287 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-30 04:20:15,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:20:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash 733866946, now seen corresponding path program 1 times [2023-11-30 04:20:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:20:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109947898] [2023-11-30 04:20:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:20:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:20:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:20:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:20:15,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:20:15,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109947898] [2023-11-30 04:20:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109947898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:20:15,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:20:15,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:20:15,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738482552] [2023-11-30 04:20:15,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:20:15,327 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:20:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:20:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:20:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:20:15,328 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 393 [2023-11-30 04:20:15,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 387 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:15,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:20:15,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 393 [2023-11-30 04:20:15,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:20:41,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L730-->thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_91| |v_~#seed~0.base_55|) 1)) InVars {~#seed~0.base=|v_~#seed~0.base_55|, #valid=|v_#valid_91|} OutVars{~#seed~0.base=|v_~#seed~0.base_55|, #valid=|v_#valid_91|} AuxVars[] AssignedVars[][100], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 109#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 245#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 144#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread1of3ForFork0InUse, 212#L785-4true]) [2023-11-30 04:20:41,767 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,767 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,767 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,767 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1356] L730-->thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< (select |v_#length_86| |v_~#seed~0.base_57|) (+ |v_~#seed~0.offset_50| 4)) (< |v_~#seed~0.offset_50| 0)) InVars {#length=|v_#length_86|, ~#seed~0.base=|v_~#seed~0.base_57|, ~#seed~0.offset=|v_~#seed~0.offset_50|} OutVars{#length=|v_#length_86|, ~#seed~0.base=|v_~#seed~0.base_57|, ~#seed~0.offset=|v_~#seed~0.offset_50|} AuxVars[] AssignedVars[][101], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 20#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 109#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 144#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 212#L785-4true]) [2023-11-30 04:20:41,767 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,767 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,767 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,767 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L730-->L732: Formula: (and (= (select |v_#valid_93| |v_~#seed~0.base_59|) 1) (<= 0 |v_~#seed~0.offset_52|) (<= (+ |v_~#seed~0.offset_52| 4) (select |v_#length_88| |v_~#seed~0.base_59|)) (= (select (select |v_#memory_int_100| |v_~#seed~0.base_59|) |v_~#seed~0.offset_52|) |v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|)) InVars {#memory_int=|v_#memory_int_100|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|} OutVars{thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_100|, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1_3|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1][102], [171#L732true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 109#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 144#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thr1Thread1of3ForFork0InUse, 212#L785-4true]) [2023-11-30 04:20:41,768 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,768 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,768 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,768 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1355] L730-->thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (not (= (select |v_#valid_91| |v_~#seed~0.base_55|) 1)) InVars {~#seed~0.base=|v_~#seed~0.base_55|, #valid=|v_#valid_91|} OutVars{~#seed~0.base=|v_~#seed~0.base_55|, #valid=|v_#valid_91|} AuxVars[] AssignedVars[][100], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 245#thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 296#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 230#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread1of3ForFork0InUse, 212#L785-4true]) [2023-11-30 04:20:41,768 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,768 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,768 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,768 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1356] L730-->thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< (select |v_#length_86| |v_~#seed~0.base_57|) (+ |v_~#seed~0.offset_50| 4)) (< |v_~#seed~0.offset_50| 0)) InVars {#length=|v_#length_86|, ~#seed~0.base=|v_~#seed~0.base_57|, ~#seed~0.offset=|v_~#seed~0.offset_50|} OutVars{#length=|v_#length_86|, ~#seed~0.base=|v_~#seed~0.base_57|, ~#seed~0.offset=|v_~#seed~0.offset_50|} AuxVars[] AssignedVars[][101], [thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 20#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 296#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 230#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread1of3ForFork0InUse, 212#L785-4true]) [2023-11-30 04:20:41,768 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,769 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,769 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,769 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L730-->L732: Formula: (and (= (select |v_#valid_93| |v_~#seed~0.base_59|) 1) (<= 0 |v_~#seed~0.offset_52|) (<= (+ |v_~#seed~0.offset_52| 4) (select |v_#length_88| |v_~#seed~0.base_59|)) (= (select (select |v_#memory_int_100| |v_~#seed~0.base_59|) |v_~#seed~0.offset_52|) |v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|)) InVars {#memory_int=|v_#memory_int_100|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|} OutVars{thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_100|, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1_3|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1][102], [171#L732true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 296#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 230#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), thr1Thread1of3ForFork0InUse, 212#L785-4true]) [2023-11-30 04:20:41,769 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,769 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:41,769 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:20:41,769 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:20:42,869 INFO L124 PetriNetUnfolderBase]: 96008/265673 cut-off events. [2023-11-30 04:20:42,869 INFO L125 PetriNetUnfolderBase]: For 39781/60496 co-relation queries the response was YES. [2023-11-30 04:20:44,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510365 conditions, 265673 events. 96008/265673 cut-off events. For 39781/60496 co-relation queries the response was YES. Maximal size of possible extension queue 9327. Compared 4186157 event pairs, 73194 based on Foata normal form. 0/197300 useless extension candidates. Maximal degree in co-relation 27657. Up to 118601 conditions per place. [2023-11-30 04:20:45,826 INFO L140 encePairwiseOnDemand]: 391/393 looper letters, 132 selfloop transitions, 1 changer transitions 0/385 dead transitions. [2023-11-30 04:20:45,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 385 transitions, 1358 flow [2023-11-30 04:20:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:20:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:20:45,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2023-11-30 04:20:45,828 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.73960983884648 [2023-11-30 04:20:45,828 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 872 transitions. [2023-11-30 04:20:45,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions. [2023-11-30 04:20:45,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:20:45,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions. [2023-11-30 04:20:45,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:45,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:45,831 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 393.0) internal successors, (1572), 4 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:45,832 INFO L307 CegarLoopForPetriNet]: 354 programPoint places, -39 predicate places. [2023-11-30 04:20:45,832 INFO L500 AbstractCegarLoop]: Abstraction has has 315 places, 385 transitions, 1358 flow [2023-11-30 04:20:45,832 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 268.0) internal successors, (804), 3 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:45,832 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:20:45,832 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:20:45,832 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:20:45,832 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-30 04:20:45,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:20:45,833 INFO L85 PathProgramCache]: Analyzing trace with hash -144451151, now seen corresponding path program 1 times [2023-11-30 04:20:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:20:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182796201] [2023-11-30 04:20:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:20:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:20:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:20:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:20:45,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:20:45,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182796201] [2023-11-30 04:20:45,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182796201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:20:45,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:20:45,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 04:20:45,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112860862] [2023-11-30 04:20:45,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:20:45,924 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 04:20:45,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:20:45,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 04:20:45,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-30 04:20:45,925 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 393 [2023-11-30 04:20:45,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 385 transitions, 1358 flow. Second operand has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:20:45,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:20:45,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 393 [2023-11-30 04:20:45,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:21:09,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1356] L730-->thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< (select |v_#length_86| |v_~#seed~0.base_57|) (+ |v_~#seed~0.offset_50| 4)) (< |v_~#seed~0.offset_50| 0)) InVars {#length=|v_#length_86|, ~#seed~0.base=|v_~#seed~0.base_57|, ~#seed~0.offset=|v_~#seed~0.offset_50|} OutVars{#length=|v_#length_86|, ~#seed~0.base=|v_~#seed~0.base_57|, ~#seed~0.offset=|v_~#seed~0.offset_50|} AuxVars[] AssignedVars[][97], [368#(and (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1)), thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 20#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 109#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 144#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 212#L785-4true, thr1Thread1of3ForFork0InUse]) [2023-11-30 04:21:09,438 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:21:09,438 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:21:09,438 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:09,438 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:09,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L730-->L732: Formula: (and (= (select |v_#valid_93| |v_~#seed~0.base_59|) 1) (<= 0 |v_~#seed~0.offset_52|) (<= (+ |v_~#seed~0.offset_52| 4) (select |v_#length_88| |v_~#seed~0.base_59|)) (= (select (select |v_#memory_int_100| |v_~#seed~0.base_59|) |v_~#seed~0.offset_52|) |v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|)) InVars {#memory_int=|v_#memory_int_100|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|} OutVars{thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_100|, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1_3|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1][98], [thr1Thread2of3ForFork0InUse, 368#(and (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1)), 171#L732true, thr1Thread3of3ForFork0InUse, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 109#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 144#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 212#L785-4true, thr1Thread1of3ForFork0InUse]) [2023-11-30 04:21:09,438 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:21:09,438 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1356] L730-->thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE: Formula: (or (< (select |v_#length_86| |v_~#seed~0.base_57|) (+ |v_~#seed~0.offset_50| 4)) (< |v_~#seed~0.offset_50| 0)) InVars {#length=|v_#length_86|, ~#seed~0.base=|v_~#seed~0.base_57|, ~#seed~0.offset=|v_~#seed~0.offset_50|} OutVars{#length=|v_#length_86|, ~#seed~0.base=|v_~#seed~0.base_57|, ~#seed~0.offset=|v_~#seed~0.offset_50|} AuxVars[] AssignedVars[][97], [thr1Thread2of3ForFork0InUse, 368#(and (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1)), thr1Thread3of3ForFork0InUse, 20#thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 296#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 230#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 212#L785-4true, thr1Thread1of3ForFork0InUse]) [2023-11-30 04:21:09,439 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L730-->L732: Formula: (and (= (select |v_#valid_93| |v_~#seed~0.base_59|) 1) (<= 0 |v_~#seed~0.offset_52|) (<= (+ |v_~#seed~0.offset_52| 4) (select |v_#length_88| |v_~#seed~0.base_59|)) (= (select (select |v_#memory_int_100| |v_~#seed~0.base_59|) |v_~#seed~0.offset_52|) |v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|)) InVars {#memory_int=|v_#memory_int_100|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|} OutVars{thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_100|, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1_3|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1][98], [thr1Thread2of3ForFork0InUse, 368#(and (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1)), 171#L732true, thr1Thread3of3ForFork0InUse, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 296#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 230#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 212#L785-4true, thr1Thread1of3ForFork0InUse]) [2023-11-30 04:21:09,439 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:21:09,439 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:10,772 INFO L124 PetriNetUnfolderBase]: 71352/209882 cut-off events. [2023-11-30 04:21:10,773 INFO L125 PetriNetUnfolderBase]: For 69610/117257 co-relation queries the response was YES. [2023-11-30 04:21:12,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495632 conditions, 209882 events. 71352/209882 cut-off events. For 69610/117257 co-relation queries the response was YES. Maximal size of possible extension queue 7168. Compared 3292993 event pairs, 40275 based on Foata normal form. 2701/163259 useless extension candidates. Maximal degree in co-relation 32047. Up to 92625 conditions per place. [2023-11-30 04:21:13,656 INFO L140 encePairwiseOnDemand]: 352/393 looper letters, 268 selfloop transitions, 59 changer transitions 0/561 dead transitions. [2023-11-30 04:21:13,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 561 transitions, 3046 flow [2023-11-30 04:21:13,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 04:21:13,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 04:21:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1511 transitions. [2023-11-30 04:21:13,679 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7689567430025446 [2023-11-30 04:21:13,679 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1511 transitions. [2023-11-30 04:21:13,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1511 transitions. [2023-11-30 04:21:13,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:21:13,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1511 transitions. [2023-11-30 04:21:13,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 302.2) internal successors, (1511), 5 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:13,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 393.0) internal successors, (2358), 6 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:13,685 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 393.0) internal successors, (2358), 6 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:13,685 INFO L307 CegarLoopForPetriNet]: 354 programPoint places, -35 predicate places. [2023-11-30 04:21:13,685 INFO L500 AbstractCegarLoop]: Abstraction has has 319 places, 561 transitions, 3046 flow [2023-11-30 04:21:13,686 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.0) internal successors, (1554), 6 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:13,686 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:21:13,686 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:21:13,686 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:21:13,686 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-30 04:21:13,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:21:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash -144451150, now seen corresponding path program 1 times [2023-11-30 04:21:13,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:21:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536294014] [2023-11-30 04:21:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:21:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:21:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:21:13,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:21:13,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:21:13,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536294014] [2023-11-30 04:21:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536294014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:21:13,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:21:13,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 04:21:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592587244] [2023-11-30 04:21:13,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:21:13,745 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 04:21:13,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:21:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 04:21:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 04:21:13,747 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 393 [2023-11-30 04:21:13,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 561 transitions, 3046 flow. Second operand has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:13,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:21:13,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 393 [2023-11-30 04:21:13,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:21:30,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L730-->L732: Formula: (and (= (select |v_#valid_93| |v_~#seed~0.base_59|) 1) (<= 0 |v_~#seed~0.offset_52|) (<= (+ |v_~#seed~0.offset_52| 4) (select |v_#length_88| |v_~#seed~0.base_59|)) (= (select (select |v_#memory_int_100| |v_~#seed~0.base_59|) |v_~#seed~0.offset_52|) |v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|)) InVars {#memory_int=|v_#memory_int_100|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|} OutVars{thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_100|, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1_3|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1][94], [368#(and (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1)), thr1Thread2of3ForFork0InUse, 171#L732true, thr1Thread3of3ForFork0InUse, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 109#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 144#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 212#L785-4true, 375#(and (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0) (= (select |#length| 3) 4)), thr1Thread1of3ForFork0InUse]) [2023-11-30 04:21:30,354 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:21:30,354 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:30,354 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:30,354 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:21:30,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L730-->L732: Formula: (and (= (select |v_#valid_93| |v_~#seed~0.base_59|) 1) (<= 0 |v_~#seed~0.offset_52|) (<= (+ |v_~#seed~0.offset_52| 4) (select |v_#length_88| |v_~#seed~0.base_59|)) (= (select (select |v_#memory_int_100| |v_~#seed~0.base_59|) |v_~#seed~0.offset_52|) |v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|)) InVars {#memory_int=|v_#memory_int_100|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|} OutVars{thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1_5|, ~#seed~0.offset=|v_~#seed~0.offset_52|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_100|, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1=|v_thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1_3|, ~#seed~0.base=|v_~#seed~0.base_59|, #length=|v_#length_88|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_~read~0#1, thr1Thread1of3ForFork0_PseudoRandomUsingAtomic_nextInt_#t~mem5#1][94], [368#(and (= 3 |~#seed~0.base|) (= (select |#valid| 3) 1)), 171#L732true, thr1Thread2of3ForFork0InUse, thr1Thread3of3ForFork0InUse, 359#(= (select |#valid| |ULTIMATE.start_main_~#t~0#1.base|) 1), 296#thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 230#thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 363#(and (= |ULTIMATE.start_main_~#t~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t~0#1.base|) 4)), 212#L785-4true, thr1Thread1of3ForFork0InUse, 375#(and (= 3 |~#seed~0.base|) (= |~#seed~0.offset| 0) (= (select |#length| 3) 4))]) [2023-11-30 04:21:30,355 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 04:21:30,355 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 04:21:30,355 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:30,355 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 04:21:31,519 INFO L124 PetriNetUnfolderBase]: 39812/129130 cut-off events. [2023-11-30 04:21:31,520 INFO L125 PetriNetUnfolderBase]: For 89686/139252 co-relation queries the response was YES. [2023-11-30 04:21:32,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341523 conditions, 129130 events. 39812/129130 cut-off events. For 89686/139252 co-relation queries the response was YES. Maximal size of possible extension queue 4387. Compared 1971978 event pairs, 20934 based on Foata normal form. 2359/109197 useless extension candidates. Maximal degree in co-relation 28143. Up to 51481 conditions per place. [2023-11-30 04:21:33,191 INFO L140 encePairwiseOnDemand]: 379/393 looper letters, 240 selfloop transitions, 2 changer transitions 0/507 dead transitions. [2023-11-30 04:21:33,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 507 transitions, 3116 flow [2023-11-30 04:21:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 04:21:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 04:21:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1140 transitions. [2023-11-30 04:21:33,194 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7251908396946565 [2023-11-30 04:21:33,194 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1140 transitions. [2023-11-30 04:21:33,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1140 transitions. [2023-11-30 04:21:33,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:21:33,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1140 transitions. [2023-11-30 04:21:33,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:33,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 393.0) internal successors, (1965), 5 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:33,198 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 393.0) internal successors, (1965), 5 states have internal predecessors, (1965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:33,198 INFO L307 CegarLoopForPetriNet]: 354 programPoint places, -44 predicate places. [2023-11-30 04:21:33,198 INFO L500 AbstractCegarLoop]: Abstraction has has 310 places, 507 transitions, 3116 flow [2023-11-30 04:21:33,199 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:33,199 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:21:33,199 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:21:33,199 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:21:33,199 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-30 04:21:33,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:21:33,199 INFO L85 PathProgramCache]: Analyzing trace with hash -15021284, now seen corresponding path program 1 times [2023-11-30 04:21:33,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:21:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592644802] [2023-11-30 04:21:33,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:21:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:21:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:21:33,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:21:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:21:33,216 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:21:33,216 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:21:33,216 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (66 of 67 remaining) [2023-11-30 04:21:33,216 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 67 remaining) [2023-11-30 04:21:33,216 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 67 remaining) [2023-11-30 04:21:33,216 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 67 remaining) [2023-11-30 04:21:33,216 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 67 remaining) [2023-11-30 04:21:33,216 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 67 remaining) [2023-11-30 04:21:33,217 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 67 remaining) [2023-11-30 04:21:33,218 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 67 remaining) [2023-11-30 04:21:33,219 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 67 remaining) [2023-11-30 04:21:33,220 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 67 remaining) [2023-11-30 04:21:33,221 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 04:21:33,221 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-11-30 04:21:33,221 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:21:33,221 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 04:21:33,281 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:21:33,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 462 places, 514 transitions, 1056 flow [2023-11-30 04:21:33,507 INFO L124 PetriNetUnfolderBase]: 65/572 cut-off events. [2023-11-30 04:21:33,507 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 04:21:33,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 572 events. 65/572 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2704 event pairs, 0 based on Foata normal form. 0/428 useless extension candidates. Maximal degree in co-relation 495. Up to 10 conditions per place. [2023-11-30 04:21:33,513 INFO L82 GeneralOperation]: Start removeDead. Operand has 462 places, 514 transitions, 1056 flow [2023-11-30 04:21:33,519 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 462 places, 514 transitions, 1056 flow [2023-11-30 04:21:33,520 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:21:33,521 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;@2cc427df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:21:33,521 INFO L363 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-11-30 04:21:33,522 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:21:33,522 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2023-11-30 04:21:33,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:21:33,522 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:21:33,522 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:21:33,522 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-11-30 04:21:33,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:21:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1727131137, now seen corresponding path program 1 times [2023-11-30 04:21:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:21:33,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837992086] [2023-11-30 04:21:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:21:33,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:21:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:21:33,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:21:33,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:21:33,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837992086] [2023-11-30 04:21:33,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837992086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:21:33,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:21:33,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:21:33,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76122702] [2023-11-30 04:21:33,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:21:33,557 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:21:33,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:21:33,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:21:33,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:21:33,558 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 514 [2023-11-30 04:21:33,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 514 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 346.3333333333333) internal successors, (1039), 3 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 04:21:33,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:21:33,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 514 [2023-11-30 04:21:33,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand