/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/weaver/parallel-barrier-loop.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 05:33:42,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 05:33:42,243 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 05:33:42,274 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 05:33:42,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 05:33:42,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 05:33:42,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 05:33:42,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 05:33:42,276 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 05:33:42,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 05:33:42,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 05:33:42,281 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 05:33:42,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 05:33:42,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 05:33:42,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 05:33:42,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 05:33:42,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 05:33:42,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 05:33:42,284 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 05:33:42,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 05:33:42,284 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 05:33:42,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 05:33:42,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 05:33:42,285 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 05:33:42,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 05:33:42,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:33:42,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 05:33:42,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 05:33:42,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 05:33:42,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 05:33:42,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 05:33:42,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 05:33:42,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 05:33:42,289 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 05:33:42,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 05:33:42,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 05:33:42,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 05:33:42,557 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 05:33:42,557 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 05:33:42,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2023-11-30 05:33:43,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 05:33:43,826 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 05:33:43,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2023-11-30 05:33:43,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5477eb7f4/b844f2e430bc4318b92d31b6e95d62fb/FLAG934e85dfa [2023-11-30 05:33:43,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5477eb7f4/b844f2e430bc4318b92d31b6e95d62fb [2023-11-30 05:33:43,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 05:33:43,847 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 05:33:43,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 05:33:43,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 05:33:43,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 05:33:43,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:33:43" (1/1) ... [2023-11-30 05:33:43,853 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d9436a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:43, skipping insertion in model container [2023-11-30 05:33:43,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 05:33:43" (1/1) ... [2023-11-30 05:33:43,883 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 05:33:44,027 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:33:44,036 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 05:33:44,065 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 05:33:44,072 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:33:44,073 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 05:33:44,079 INFO L206 MainTranslator]: Completed translation [2023-11-30 05:33:44,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44 WrapperNode [2023-11-30 05:33:44,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 05:33:44,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 05:33:44,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 05:33:44,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 05:33:44,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,130 INFO L138 Inliner]: procedures = 25, calls = 121, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 273 [2023-11-30 05:33:44,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 05:33:44,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 05:33:44,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 05:33:44,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 05:33:44,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 05:33:44,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 05:33:44,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 05:33:44,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 05:33:44,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (1/1) ... [2023-11-30 05:33:44,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 05:33:44,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 05:33:44,267 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 05:33:44,270 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 05:33:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 05:33:44,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 05:33:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 05:33:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 05:33:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 05:33:44,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 05:33:44,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 05:33:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 05:33:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-30 05:33:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-30 05:33:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-30 05:33:44,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-30 05:33:44,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 05:33:44,292 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-30 05:33:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-30 05:33:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-30 05:33:44,293 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-30 05:33:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 05:33:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 05:33:44,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 05:33:44,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 05:33:44,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 05:33:44,296 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 05:33:44,394 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 05:33:44,396 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 05:33:44,870 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 05:33:44,955 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 05:33:44,955 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-30 05:33:44,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:33:44 BoogieIcfgContainer [2023-11-30 05:33:44,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 05:33:44,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 05:33:44,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 05:33:44,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 05:33:44,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 05:33:43" (1/3) ... [2023-11-30 05:33:44,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b0edd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:33:44, skipping insertion in model container [2023-11-30 05:33:44,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 05:33:44" (2/3) ... [2023-11-30 05:33:44,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b0edd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 05:33:44, skipping insertion in model container [2023-11-30 05:33:44,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 05:33:44" (3/3) ... [2023-11-30 05:33:44,965 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2023-11-30 05:33:44,976 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 05:33:44,976 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-30 05:33:44,976 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 05:33:45,090 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-11-30 05:33:45,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 309 places, 304 transitions, 674 flow [2023-11-30 05:33:45,200 INFO L124 PetriNetUnfolderBase]: 14/272 cut-off events. [2023-11-30 05:33:45,200 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-30 05:33:45,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 272 events. 14/272 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 535 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 227. Up to 3 conditions per place. [2023-11-30 05:33:45,208 INFO L82 GeneralOperation]: Start removeDead. Operand has 309 places, 304 transitions, 674 flow [2023-11-30 05:33:45,220 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 256 places, 250 transitions, 545 flow [2023-11-30 05:33:45,232 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 05:33:45,237 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;@6db0a34c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 05:33:45,237 INFO L363 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-11-30 05:33:45,255 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 05:33:45,255 INFO L124 PetriNetUnfolderBase]: 1/85 cut-off events. [2023-11-30 05:33:45,255 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 05:33:45,255 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:33:45,256 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:33:45,256 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:33:45,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:33:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash 638531860, now seen corresponding path program 1 times [2023-11-30 05:33:45,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:33:45,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625866685] [2023-11-30 05:33:45,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:33:45,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:33:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:33:45,727 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 05:33:45,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:33:45,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625866685] [2023-11-30 05:33:45,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625866685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:33:45,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:33:45,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:33:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551481034] [2023-11-30 05:33:45,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:33:45,738 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:33:45,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:33:45,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:33:45,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:33:45,766 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 308 [2023-11-30 05:33:45,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 250 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 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 05:33:45,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:33:45,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 308 [2023-11-30 05:33:45,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:33:57,687 INFO L124 PetriNetUnfolderBase]: 38268/85163 cut-off events. [2023-11-30 05:33:57,687 INFO L125 PetriNetUnfolderBase]: For 7717/7990 co-relation queries the response was YES. [2023-11-30 05:33:58,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140793 conditions, 85163 events. 38268/85163 cut-off events. For 7717/7990 co-relation queries the response was YES. Maximal size of possible extension queue 2628. Compared 1007742 event pairs, 24216 based on Foata normal form. 15261/83654 useless extension candidates. Maximal degree in co-relation 138015. Up to 43539 conditions per place. [2023-11-30 05:33:58,993 INFO L140 encePairwiseOnDemand]: 295/308 looper letters, 112 selfloop transitions, 6 changer transitions 1/298 dead transitions. [2023-11-30 05:33:58,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 298 transitions, 919 flow [2023-11-30 05:33:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:33:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:33:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 774 transitions. [2023-11-30 05:33:59,006 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8376623376623377 [2023-11-30 05:33:59,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 774 transitions. [2023-11-30 05:33:59,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 774 transitions. [2023-11-30 05:33:59,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:33:59,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 774 transitions. [2023-11-30 05:33:59,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 0 states have call successors, (0), 0 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 05:33:59,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:33:59,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:33:59,024 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 1 predicate places. [2023-11-30 05:33:59,024 INFO L500 AbstractCegarLoop]: Abstraction has has 257 places, 298 transitions, 919 flow [2023-11-30 05:33:59,025 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 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 05:33:59,025 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:33:59,025 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:33:59,025 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 05:33:59,025 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:33:59,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:33:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 638531861, now seen corresponding path program 1 times [2023-11-30 05:33:59,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:33:59,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759430697] [2023-11-30 05:33:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:33:59,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:33:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:33:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:33:59,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:33:59,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759430697] [2023-11-30 05:33:59,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759430697] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:33:59,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:33:59,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:33:59,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919870312] [2023-11-30 05:33:59,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:33:59,321 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:33:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:33:59,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:33:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:33:59,324 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 308 [2023-11-30 05:33:59,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 298 transitions, 919 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 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 05:33:59,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:33:59,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 308 [2023-11-30 05:33:59,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:02,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][139], [113#L57true, 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), thread3Thread1of1ForFork0InUse, 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 185#L236-4true, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:02,508 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 05:34:02,508 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:02,508 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:02,508 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:02,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][139], [113#L57true, 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 185#L236-4true, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:02,511 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 05:34:02,512 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:02,512 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:02,512 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:03,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][139], [113#L57true, 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:03,203 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 05:34:03,203 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:34:03,203 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:03,203 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:03,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][139], [113#L57true, 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:03,205 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 05:34:03,205 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:03,205 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:03,205 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:34:04,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][139], [113#L57true, 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 185#L236-4true, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:04,659 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 05:34:04,659 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:04,659 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 05:34:04,660 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:04,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][139], [113#L57true, 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 185#L236-4true, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:04,663 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 05:34:04,663 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:04,663 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:04,663 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 05:34:05,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][139], [113#L57true, 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 294#L141true, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:05,466 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 05:34:05,466 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:05,466 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:05,467 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 05:34:05,469 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][139], [113#L57true, 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:05,469 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 05:34:05,469 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:05,469 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:05,469 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 05:34:10,950 INFO L124 PetriNetUnfolderBase]: 42288/94256 cut-off events. [2023-11-30 05:34:10,950 INFO L125 PetriNetUnfolderBase]: For 28115/38182 co-relation queries the response was YES. [2023-11-30 05:34:11,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198766 conditions, 94256 events. 42288/94256 cut-off events. For 28115/38182 co-relation queries the response was YES. Maximal size of possible extension queue 3067. Compared 1144608 event pairs, 27446 based on Foata normal form. 0/84095 useless extension candidates. Maximal degree in co-relation 193118. Up to 48079 conditions per place. [2023-11-30 05:34:12,349 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 95 selfloop transitions, 1 changer transitions 1/295 dead transitions. [2023-11-30 05:34:12,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 295 transitions, 1099 flow [2023-11-30 05:34:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 734 transitions. [2023-11-30 05:34:12,352 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7943722943722944 [2023-11-30 05:34:12,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 734 transitions. [2023-11-30 05:34:12,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 734 transitions. [2023-11-30 05:34:12,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:12,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 734 transitions. [2023-11-30 05:34:12,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 0 states have call successors, (0), 0 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 05:34:12,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:34:12,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:34:12,362 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 1 predicate places. [2023-11-30 05:34:12,363 INFO L500 AbstractCegarLoop]: Abstraction has has 257 places, 295 transitions, 1099 flow [2023-11-30 05:34:12,364 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 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 05:34:12,364 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:12,364 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:34:12,364 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 05:34:12,365 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:34:12,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1163934096, now seen corresponding path program 1 times [2023-11-30 05:34:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902070981] [2023-11-30 05:34:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:12,476 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 05:34:12,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902070981] [2023-11-30 05:34:12,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902070981] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:12,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:12,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582040480] [2023-11-30 05:34:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:12,479 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:12,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:12,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:12,481 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 308 [2023-11-30 05:34:12,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 295 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 05:34:12,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:12,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 308 [2023-11-30 05:34:12,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:15,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][138], [113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:15,729 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 05:34:15,729 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:15,729 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:15,729 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:15,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][138], [113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:15,731 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 05:34:15,731 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:15,731 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:15,731 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:16,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][138], [113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:16,160 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 05:34:16,160 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:34:16,160 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:16,160 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:16,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][138], [113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:16,421 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 05:34:16,421 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:16,421 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:34:16,421 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:17,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][138], [113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:17,828 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 05:34:17,828 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 05:34:17,828 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:17,828 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:17,829 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][138], [113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:17,829 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 05:34:17,829 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:17,830 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:17,830 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 05:34:18,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][138], [113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, thread3Thread1of1ForFork0InUse, 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 294#L141true, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:18,428 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 05:34:18,428 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:18,428 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:18,428 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 05:34:18,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][138], [113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 294#L141true, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:18,429 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 05:34:18,429 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 05:34:18,429 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:18,429 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:24,571 INFO L124 PetriNetUnfolderBase]: 43523/97014 cut-off events. [2023-11-30 05:34:24,571 INFO L125 PetriNetUnfolderBase]: For 60308/85772 co-relation queries the response was YES. [2023-11-30 05:34:25,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255614 conditions, 97014 events. 43523/97014 cut-off events. For 60308/85772 co-relation queries the response was YES. Maximal size of possible extension queue 3148. Compared 1183313 event pairs, 27253 based on Foata normal form. 123/86532 useless extension candidates. Maximal degree in co-relation 245909. Up to 49535 conditions per place. [2023-11-30 05:34:26,267 INFO L140 encePairwiseOnDemand]: 299/308 looper letters, 182 selfloop transitions, 9 changer transitions 3/371 dead transitions. [2023-11-30 05:34:26,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 371 transitions, 1961 flow [2023-11-30 05:34:26,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:26,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:26,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2023-11-30 05:34:26,270 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.827922077922078 [2023-11-30 05:34:26,270 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 765 transitions. [2023-11-30 05:34:26,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 765 transitions. [2023-11-30 05:34:26,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:26,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 765 transitions. [2023-11-30 05:34:26,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 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 05:34:26,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:34:26,275 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:34:26,275 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 3 predicate places. [2023-11-30 05:34:26,275 INFO L500 AbstractCegarLoop]: Abstraction has has 259 places, 371 transitions, 1961 flow [2023-11-30 05:34:26,276 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 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 05:34:26,276 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:26,276 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:34:26,276 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 05:34:26,277 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:34:26,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1163934097, now seen corresponding path program 1 times [2023-11-30 05:34:26,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:26,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265578197] [2023-11-30 05:34:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:26,401 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 05:34:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:26,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265578197] [2023-11-30 05:34:26,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265578197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:26,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:26,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:26,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248130990] [2023-11-30 05:34:26,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:26,406 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:26,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:26,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:26,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:26,415 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 308 [2023-11-30 05:34:26,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 371 transitions, 1961 flow. Second operand has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 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 05:34:26,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:26,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 308 [2023-11-30 05:34:26,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:29,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][137], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:29,362 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 05:34:29,362 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:29,362 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:29,362 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:29,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][137], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:29,365 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 05:34:29,365 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:29,365 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:29,365 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:30,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][137], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, thread3Thread1of1ForFork0InUse, 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:30,160 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 05:34:30,160 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:30,160 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:34:30,160 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:30,163 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][137], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:30,163 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 05:34:30,164 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:34:30,164 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:30,164 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:31,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][137], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 294#L141true, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:31,715 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 05:34:31,715 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 05:34:31,715 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:31,715 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:31,718 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][137], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:31,718 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 05:34:31,718 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:31,718 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 05:34:31,718 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:32,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][137], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, 246#thread1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 294#L141true, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:32,648 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 05:34:32,648 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 05:34:32,648 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:32,648 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:32,650 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][137], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:32,650 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 05:34:32,650 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:32,650 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:32,650 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 05:34:38,786 INFO L124 PetriNetUnfolderBase]: 42899/95917 cut-off events. [2023-11-30 05:34:38,786 INFO L125 PetriNetUnfolderBase]: For 105753/145470 co-relation queries the response was YES. [2023-11-30 05:34:39,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300570 conditions, 95917 events. 42899/95917 cut-off events. For 105753/145470 co-relation queries the response was YES. Maximal size of possible extension queue 3135. Compared 1171300 event pairs, 27023 based on Foata normal form. 277/86088 useless extension candidates. Maximal degree in co-relation 291758. Up to 48704 conditions per place. [2023-11-30 05:34:40,566 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 150 selfloop transitions, 1 changer transitions 3/367 dead transitions. [2023-11-30 05:34:40,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 367 transitions, 2239 flow [2023-11-30 05:34:40,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 733 transitions. [2023-11-30 05:34:40,568 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7932900432900433 [2023-11-30 05:34:40,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 733 transitions. [2023-11-30 05:34:40,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 733 transitions. [2023-11-30 05:34:40,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:40,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 733 transitions. [2023-11-30 05:34:40,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 0 states have call successors, (0), 0 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 05:34:40,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:34:40,573 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:34:40,574 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 3 predicate places. [2023-11-30 05:34:40,574 INFO L500 AbstractCegarLoop]: Abstraction has has 259 places, 367 transitions, 2239 flow [2023-11-30 05:34:40,574 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 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 05:34:40,574 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:40,574 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:34:40,575 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 05:34:40,575 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:34:40,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1546233720, now seen corresponding path program 1 times [2023-11-30 05:34:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:40,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022735057] [2023-11-30 05:34:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:40,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:40,674 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 05:34:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022735057] [2023-11-30 05:34:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022735057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:40,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892793597] [2023-11-30 05:34:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:40,676 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:40,678 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 308 [2023-11-30 05:34:40,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 367 transitions, 2239 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 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 05:34:40,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:40,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 308 [2023-11-30 05:34:40,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:34:43,515 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 131#thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0NotInUse, 174#$Ultimate##0true, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 185#L236-4true, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:43,515 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 05:34:43,515 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:43,515 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 05:34:43,515 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:43,934 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, 131#thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0NotInUse, 174#$Ultimate##0true, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 294#L141true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:43,934 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 05:34:43,934 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 05:34:43,935 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:43,935 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 05:34:45,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 131#thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 185#L236-4true, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 294#L141true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:45,280 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 05:34:45,280 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 05:34:45,280 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:45,280 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 05:34:46,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 6#L237-1true, 131#thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 294#L141true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:46,096 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 05:34:46,096 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 05:34:46,096 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:46,096 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 05:34:46,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 199#$Ultimate##0true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:46,633 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 05:34:46,633 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 05:34:46,633 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 05:34:46,633 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 05:34:47,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][187], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:47,472 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-30 05:34:47,472 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 05:34:47,472 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 05:34:47,472 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 05:34:47,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 6#L237-1true, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 199#$Ultimate##0true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:47,610 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2023-11-30 05:34:47,611 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-30 05:34:47,611 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 05:34:47,611 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 05:34:48,068 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][187], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 18#thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 6#L237-1true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 294#L141true, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:48,068 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-30 05:34:48,068 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 05:34:48,069 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 05:34:48,069 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 05:34:48,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][187], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:48,353 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 05:34:48,353 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 05:34:48,353 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 05:34:48,353 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 05:34:49,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 294#L141true, 175#L91true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:49,096 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 05:34:49,096 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:34:49,096 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:34:49,096 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:34:49,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][187], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 6#L237-1true, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 175#L91true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:49,199 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2023-11-30 05:34:49,199 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-30 05:34:49,199 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 05:34:49,199 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 05:34:49,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 6#L237-1true, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:49,497 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 05:34:49,497 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 05:34:49,497 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 05:34:49,497 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 05:34:49,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 124#L105true, 185#L236-4true, thread4Thread1of1ForFork4InUse, 294#L141true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:49,725 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 05:34:49,725 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:34:49,725 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:34:49,725 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 05:34:49,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][187], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 294#L141true, 175#L91true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:49,962 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 05:34:49,962 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:34:49,962 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:34:49,962 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:34:50,011 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][191], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 6#L237-1true, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 124#L105true, thread4Thread1of1ForFork4InUse, 294#L141true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:50,011 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 05:34:50,011 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:34:50,011 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:34:50,011 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-30 05:34:50,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][187], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 6#L237-1true, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 175#L91true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:50,558 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 05:34:50,558 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 05:34:50,558 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 05:34:50,558 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 05:34:50,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][187], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 100#L175true, 56#L155true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:50,653 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 05:34:50,654 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:34:50,654 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 05:34:50,654 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:34:50,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][187], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 314#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 77#thread1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 6#L237-1true, 56#L155true, 100#L175true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 175#L91true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 330#(= 1 (select |#valid| |thread1Thread1of1ForFork1_~#t2~0.base|))]) [2023-11-30 05:34:50,778 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 05:34:50,778 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-30 05:34:50,778 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:34:50,778 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:34:50,807 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([796] L88-->L91: Formula: (not (= (mod v_~f1_2~0_22 256) 0)) InVars {~f1_2~0=v_~f1_2~0_22} OutVars{~f1_2~0=v_~f1_2~0_22, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][372], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 6#L237-1true, 312#true, 328#true, 62#thread1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 320#true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 175#L91true, 257#L196-6true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:34:50,808 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:34:50,808 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:34:50,808 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:34:50,808 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:34:50,868 INFO L124 PetriNetUnfolderBase]: 38553/75188 cut-off events. [2023-11-30 05:34:50,868 INFO L125 PetriNetUnfolderBase]: For 154153/213684 co-relation queries the response was YES. [2023-11-30 05:34:51,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306351 conditions, 75188 events. 38553/75188 cut-off events. For 154153/213684 co-relation queries the response was YES. Maximal size of possible extension queue 2457. Compared 801836 event pairs, 8119 based on Foata normal form. 1125/68378 useless extension candidates. Maximal degree in co-relation 295811. Up to 44334 conditions per place. [2023-11-30 05:34:52,073 INFO L140 encePairwiseOnDemand]: 300/308 looper letters, 243 selfloop transitions, 13 changer transitions 3/434 dead transitions. [2023-11-30 05:34:52,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 434 transitions, 3428 flow [2023-11-30 05:34:52,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:34:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:34:52,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2023-11-30 05:34:52,075 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.827922077922078 [2023-11-30 05:34:52,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 765 transitions. [2023-11-30 05:34:52,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 765 transitions. [2023-11-30 05:34:52,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:34:52,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 765 transitions. [2023-11-30 05:34:52,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 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 05:34:52,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:34:52,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:34:52,080 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 5 predicate places. [2023-11-30 05:34:52,081 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 434 transitions, 3428 flow [2023-11-30 05:34:52,081 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 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 05:34:52,081 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:34:52,081 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:34:52,081 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 05:34:52,082 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:34:52,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:34:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1546233719, now seen corresponding path program 1 times [2023-11-30 05:34:52,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:34:52,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791290354] [2023-11-30 05:34:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:34:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:34:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:34:52,192 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 05:34:52,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:34:52,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791290354] [2023-11-30 05:34:52,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791290354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:34:52,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:34:52,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:34:52,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918033763] [2023-11-30 05:34:52,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:34:52,193 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:34:52,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:34:52,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:34:52,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:34:52,194 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 308 [2023-11-30 05:34:52,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 434 transitions, 3428 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 05:34:52,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:34:52,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 308 [2023-11-30 05:34:52,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:01,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][343], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 312#true, 320#true, 100#L175true, 328#true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 332#true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 196#L112-6true]) [2023-11-30 05:35:01,643 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 05:35:01,643 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:35:01,643 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:35:01,643 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 05:35:01,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][343], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 312#true, 6#L237-1true, 328#true, 320#true, 100#L175true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 196#L112-6true]) [2023-11-30 05:35:01,974 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 05:35:01,974 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:01,974 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-30 05:35:01,974 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:02,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][343], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 312#true, 328#true, 320#true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, 332#true, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 294#L141true, 76#L189true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 196#L112-6true]) [2023-11-30 05:35:02,160 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:02,160 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:02,160 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:02,160 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:02,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][381], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 312#true, 100#L175true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, thread4Thread1of1ForFork4InUse, 332#true, 294#L141true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 196#L112-6true]) [2023-11-30 05:35:02,337 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 05:35:02,337 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:35:02,337 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 05:35:02,337 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 05:35:02,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][343], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 312#true, 6#L237-1true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 76#L189true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 196#L112-6true]) [2023-11-30 05:35:02,372 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2023-11-30 05:35:02,372 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:02,372 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-30 05:35:02,372 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:02,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][381], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 312#true, 6#L237-1true, 100#L175true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 196#L112-6true]) [2023-11-30 05:35:02,859 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 05:35:02,859 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:02,859 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:02,859 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-30 05:35:02,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][381], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 312#true, 320#true, 328#true, 100#L175true, 56#L155true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, 332#true, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 196#L112-6true]) [2023-11-30 05:35:02,905 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:02,905 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:02,905 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:02,905 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:02,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][381], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 312#true, 6#L237-1true, 56#L155true, 328#true, 100#L175true, 320#true, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 67#thread4Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 196#L112-6true]) [2023-11-30 05:35:02,939 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2023-11-30 05:35:02,939 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-30 05:35:02,939 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:02,939 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:02,947 INFO L124 PetriNetUnfolderBase]: 32994/72392 cut-off events. [2023-11-30 05:35:02,947 INFO L125 PetriNetUnfolderBase]: For 189677/242706 co-relation queries the response was YES. [2023-11-30 05:35:03,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310449 conditions, 72392 events. 32994/72392 cut-off events. For 189677/242706 co-relation queries the response was YES. Maximal size of possible extension queue 2354. Compared 840594 event pairs, 18520 based on Foata normal form. 1444/66073 useless extension candidates. Maximal degree in co-relation 298384. Up to 37837 conditions per place. [2023-11-30 05:35:04,172 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 281 selfloop transitions, 4 changer transitions 3/507 dead transitions. [2023-11-30 05:35:04,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 507 transitions, 4944 flow [2023-11-30 05:35:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2023-11-30 05:35:04,174 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8246753246753247 [2023-11-30 05:35:04,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 762 transitions. [2023-11-30 05:35:04,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 762 transitions. [2023-11-30 05:35:04,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:04,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 762 transitions. [2023-11-30 05:35:04,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 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 05:35:04,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:35:04,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:35:04,180 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 5 predicate places. [2023-11-30 05:35:04,180 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 507 transitions, 4944 flow [2023-11-30 05:35:04,180 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 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 05:35:04,180 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:04,180 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:04,180 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 05:35:04,181 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:35:04,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash 62927420, now seen corresponding path program 1 times [2023-11-30 05:35:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668661016] [2023-11-30 05:35:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:04,268 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 05:35:04,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:04,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668661016] [2023-11-30 05:35:04,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668661016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:04,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:04,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:04,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509573531] [2023-11-30 05:35:04,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:04,272 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:04,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:04,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:04,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:04,274 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 308 [2023-11-30 05:35:04,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 507 transitions, 4944 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 05:35:04,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:04,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 308 [2023-11-30 05:35:04,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:12,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 288#thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 312#true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread4Thread1of1ForFork4InUse, 332#true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:12,640 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2023-11-30 05:35:12,640 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 05:35:12,640 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:12,641 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 05:35:12,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5InUse, 38#L204-3true, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:12,641 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2023-11-30 05:35:12,641 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 05:35:12,641 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 05:35:12,641 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:12,813 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, 182#$Ultimate##0true, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 180#L204-4true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:12,813 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-30 05:35:12,813 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 05:35:12,813 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:12,813 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 05:35:13,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] thread5EXIT-->L205-2: Formula: (and (= (let ((.cse0 (mod |v_thread4Thread1of1ForFork4_#t~mem15_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread5Thread1of1ForFork5_thidvar0_10) (= v_thread5Thread1of1ForFork5_thidvar3_10 0) (= v_thread5Thread1of1ForFork5_thidvar1_10 0) (= v_thread5Thread1of1ForFork5_thidvar2_10 0)) InVars {thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_10, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_10, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_10, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_10, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_8|} OutVars{thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_10, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_10, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_10, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_10, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_8|} AuxVars[] AssignedVars[][508], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 320#true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, 182#$Ultimate##0true, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 297#L205-2true, 332#true, thread4Thread1of1ForFork4InUse, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,117 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 05:35:13,117 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 05:35:13,117 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 05:35:13,117 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 05:35:13,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([906] thread5EXIT-->L205-2: Formula: (and (= v_thread5Thread1of1ForFork5_thidvar3_12 0) (= v_thread5Thread1of1ForFork5_thidvar1_12 0) (= v_thread5Thread1of1ForFork5_thidvar2_12 0) (= (let ((.cse0 (mod |v_thread4Thread1of1ForFork4_#t~mem15_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread5Thread1of1ForFork5_thidvar0_12)) InVars {thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_12, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_12, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_12, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_12, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_10|} OutVars{thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_12, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_12, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_12, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_12, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_10|} AuxVars[] AssignedVars[][509], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 320#true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, 182#$Ultimate##0true, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 297#L205-2true, thread4Thread1of1ForFork4InUse, 332#true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,117 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 05:35:13,117 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 05:35:13,117 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 05:35:13,117 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 05:35:13,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 100#L175true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 180#L204-4true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,128 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 05:35:13,128 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:35:13,128 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:35:13,128 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-30 05:35:13,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][480], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 336#true, 312#true, 100#L175true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, 52#thread4Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 185#L236-4true, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,202 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 05:35:13,202 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:35:13,202 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-30 05:35:13,202 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:35:13,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 328#true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, 52#thread4Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, 182#$Ultimate##0true, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,254 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 05:35:13,254 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:35:13,254 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:13,254 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:35:13,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 328#true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, 182#$Ultimate##0true, 115#L205-1true, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,255 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 05:35:13,255 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:35:13,255 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:13,255 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:35:13,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 100#L175true, 328#true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, 52#thread4Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,274 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 05:35:13,274 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:35:13,274 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:35:13,274 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:13,274 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 100#L175true, 320#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, 115#L205-1true, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 31#$Ultimate##0true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,274 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 05:35:13,274 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:35:13,274 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 05:35:13,274 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:13,937 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 100#L175true, 328#true, 320#true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, 52#thread4Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,938 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:13,938 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:13,938 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:13,938 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:13,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 320#true, 100#L175true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, 115#L205-1true, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,940 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:13,940 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:13,940 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:13,940 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:13,940 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] thread5EXIT-->L205-2: Formula: (and (= (let ((.cse0 (mod |v_thread4Thread1of1ForFork4_#t~mem15_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread5Thread1of1ForFork5_thidvar0_10) (= v_thread5Thread1of1ForFork5_thidvar3_10 0) (= v_thread5Thread1of1ForFork5_thidvar1_10 0) (= v_thread5Thread1of1ForFork5_thidvar2_10 0)) InVars {thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_10, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_10, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_10, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_10, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_8|} OutVars{thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_10, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_10, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_10, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_10, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_8|} AuxVars[] AssignedVars[][508], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 328#true, 100#L175true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 297#L205-2true, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,940 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 05:35:13,940 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:13,940 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:13,940 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-30 05:35:13,941 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([906] thread5EXIT-->L205-2: Formula: (and (= v_thread5Thread1of1ForFork5_thidvar3_12 0) (= v_thread5Thread1of1ForFork5_thidvar1_12 0) (= v_thread5Thread1of1ForFork5_thidvar2_12 0) (= (let ((.cse0 (mod |v_thread4Thread1of1ForFork4_#t~mem15_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread5Thread1of1ForFork5_thidvar0_12)) InVars {thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_12, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_12, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_12, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_12, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_10|} OutVars{thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_12, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_12, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_12, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_12, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_10|} AuxVars[] AssignedVars[][509], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 100#L175true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 297#L205-2true, thread4Thread1of1ForFork4InUse, 332#true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:13,941 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 05:35:13,941 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:13,941 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:13,941 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-30 05:35:14,033 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][480], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 322#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 336#true, 312#true, 328#true, 100#L175true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, 52#thread4Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,033 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,033 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,033 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,033 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 100#L175true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 294#L141true, 180#L204-4true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,376 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 05:35:14,376 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:35:14,377 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:35:14,377 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-30 05:35:14,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 320#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, 52#thread4Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 76#L189true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,474 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2023-11-30 05:35:14,474 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 05:35:14,474 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 05:35:14,474 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2023-11-30 05:35:14,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([849] L138-->L141: Formula: (not (= (mod v_~f2_11~0_20 256) 0)) InVars {~f2_11~0=v_~f2_11~0_20} OutVars{thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1_1|, thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1=|v_thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1_1|, ~f2_11~0=v_~f2_11~0_20} AuxVars[] AssignedVars[thread5Thread1of1ForFork5_assume_abort_if_not_#in~cond#1, thread5Thread1of1ForFork5_assume_abort_if_not_~cond#1][410], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 320#true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, 115#L205-1true, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 76#L189true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,477 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2023-11-30 05:35:14,477 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 05:35:14,477 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2023-11-30 05:35:14,477 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 05:35:14,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([905] thread5EXIT-->L205-2: Formula: (and (= (let ((.cse0 (mod |v_thread4Thread1of1ForFork4_#t~mem15_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread5Thread1of1ForFork5_thidvar0_10) (= v_thread5Thread1of1ForFork5_thidvar3_10 0) (= v_thread5Thread1of1ForFork5_thidvar1_10 0) (= v_thread5Thread1of1ForFork5_thidvar2_10 0)) InVars {thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_10, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_10, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_10, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_10, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_8|} OutVars{thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_10, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_10, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_10, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_10, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_8|} AuxVars[] AssignedVars[][508], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 297#L205-2true, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, thread4Thread1of1ForFork4InUse, 76#L189true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,477 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2023-11-30 05:35:14,477 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:14,477 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-30 05:35:14,477 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:14,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([906] thread5EXIT-->L205-2: Formula: (and (= v_thread5Thread1of1ForFork5_thidvar3_12 0) (= v_thread5Thread1of1ForFork5_thidvar1_12 0) (= v_thread5Thread1of1ForFork5_thidvar2_12 0) (= (let ((.cse0 (mod |v_thread4Thread1of1ForFork4_#t~mem15_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread5Thread1of1ForFork5_thidvar0_12)) InVars {thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_12, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_12, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_12, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_12, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_10|} OutVars{thread5Thread1of1ForFork5_thidvar3=v_thread5Thread1of1ForFork5_thidvar3_12, thread5Thread1of1ForFork5_thidvar2=v_thread5Thread1of1ForFork5_thidvar2_12, thread5Thread1of1ForFork5_thidvar1=v_thread5Thread1of1ForFork5_thidvar1_12, thread5Thread1of1ForFork5_thidvar0=v_thread5Thread1of1ForFork5_thidvar0_12, thread4Thread1of1ForFork4_#t~mem15=|v_thread4Thread1of1ForFork4_#t~mem15_10|} AuxVars[] AssignedVars[][509], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 320#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 297#L205-2true, 332#true, thread4Thread1of1ForFork4InUse, 76#L189true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,478 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2023-11-30 05:35:14,478 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:14,478 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2023-11-30 05:35:14,478 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 05:35:14,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 320#true, 100#L175true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 297#L205-2true, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,547 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2023-11-30 05:35:14,547 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2023-11-30 05:35:14,547 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:14,547 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 05:35:14,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([907] thread6EXIT-->L206-2: Formula: (and (= v_thread6Thread1of1ForFork2_thidvar3_10 0) (= v_thread6Thread1of1ForFork2_thidvar0_10 (let ((.cse0 (mod |v_thread4Thread1of1ForFork4_#t~mem16_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0)))) (= v_thread6Thread1of1ForFork2_thidvar1_10 0) (= v_thread6Thread1of1ForFork2_thidvar2_10 0) (= v_thread6Thread1of1ForFork2_thidvar4_10 0)) InVars {thread6Thread1of1ForFork2_thidvar3=v_thread6Thread1of1ForFork2_thidvar3_10, thread6Thread1of1ForFork2_thidvar4=v_thread6Thread1of1ForFork2_thidvar4_10, thread6Thread1of1ForFork2_thidvar1=v_thread6Thread1of1ForFork2_thidvar1_10, thread6Thread1of1ForFork2_thidvar2=v_thread6Thread1of1ForFork2_thidvar2_10, thread6Thread1of1ForFork2_thidvar0=v_thread6Thread1of1ForFork2_thidvar0_10, thread4Thread1of1ForFork4_#t~mem16=|v_thread4Thread1of1ForFork4_#t~mem16_8|} OutVars{thread6Thread1of1ForFork2_thidvar3=v_thread6Thread1of1ForFork2_thidvar3_10, thread6Thread1of1ForFork2_thidvar4=v_thread6Thread1of1ForFork2_thidvar4_10, thread6Thread1of1ForFork2_thidvar1=v_thread6Thread1of1ForFork2_thidvar1_10, thread6Thread1of1ForFork2_thidvar2=v_thread6Thread1of1ForFork2_thidvar2_10, thread6Thread1of1ForFork2_thidvar0=v_thread6Thread1of1ForFork2_thidvar0_10, thread4Thread1of1ForFork4_#t~mem16=|v_thread4Thread1of1ForFork4_#t~mem16_8|} AuxVars[] AssignedVars[][585], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 83#L206-2true, 312#true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,605 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,605 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,605 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,605 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([908] thread6EXIT-->L206-2: Formula: (and (= v_thread6Thread1of1ForFork2_thidvar4_12 0) (= (let ((.cse0 (mod |v_thread4Thread1of1ForFork4_#t~mem16_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread6Thread1of1ForFork2_thidvar0_12) (= v_thread6Thread1of1ForFork2_thidvar3_12 0) (= v_thread6Thread1of1ForFork2_thidvar1_12 0) (= v_thread6Thread1of1ForFork2_thidvar2_12 0)) InVars {thread6Thread1of1ForFork2_thidvar3=v_thread6Thread1of1ForFork2_thidvar3_12, thread6Thread1of1ForFork2_thidvar4=v_thread6Thread1of1ForFork2_thidvar4_12, thread6Thread1of1ForFork2_thidvar1=v_thread6Thread1of1ForFork2_thidvar1_12, thread6Thread1of1ForFork2_thidvar2=v_thread6Thread1of1ForFork2_thidvar2_12, thread6Thread1of1ForFork2_thidvar0=v_thread6Thread1of1ForFork2_thidvar0_12, thread4Thread1of1ForFork4_#t~mem16=|v_thread4Thread1of1ForFork4_#t~mem16_10|} OutVars{thread6Thread1of1ForFork2_thidvar3=v_thread6Thread1of1ForFork2_thidvar3_12, thread6Thread1of1ForFork2_thidvar4=v_thread6Thread1of1ForFork2_thidvar4_12, thread6Thread1of1ForFork2_thidvar1=v_thread6Thread1of1ForFork2_thidvar1_12, thread6Thread1of1ForFork2_thidvar2=v_thread6Thread1of1ForFork2_thidvar2_12, thread6Thread1of1ForFork2_thidvar0=v_thread6Thread1of1ForFork2_thidvar0_12, thread4Thread1of1ForFork4_#t~mem16=|v_thread4Thread1of1ForFork4_#t~mem16_10|} AuxVars[] AssignedVars[][586], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 83#L206-2true, 312#true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,605 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,605 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,605 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,605 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 100#L175true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, 52#thread4Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,606 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,606 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,606 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,606 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 100#L175true, 320#true, 328#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, 115#L205-1true, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, thread4Thread1of1ForFork4InUse, 294#L141true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,607 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,607 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,607 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:14,607 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:14,638 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 148#thread4Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 328#true, 320#true, 100#L175true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,639 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2023-11-30 05:35:14,639 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 05:35:14,639 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-30 05:35:14,639 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 05:35:14,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 328#true, 100#L175true, 254#L206-1true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5NotInUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,639 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2023-11-30 05:35:14,639 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 05:35:14,639 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-30 05:35:14,639 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 05:35:14,642 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 100#L175true, 328#true, 56#L155true, 320#true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, thread2Thread1of1ForFork3NotInUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 332#true, thread4Thread1of1ForFork4InUse, 180#L204-4true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,643 INFO L294 olderBase$Statistics]: this new event has 177 ancestors and is cut-off event [2023-11-30 05:35:14,643 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 05:35:14,643 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2023-11-30 05:35:14,643 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 05:35:14,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 328#true, 100#L175true, 56#L155true, 320#true, thread3Thread1of1ForFork0NotInUse, 151#thread1FINALtrue, 52#thread4Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, 332#true, thread4Thread1of1ForFork4InUse, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,694 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2023-11-30 05:35:14,694 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2023-11-30 05:35:14,694 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 05:35:14,694 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 05:35:14,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([866] L172-->L175: Formula: (not (= (mod v_~f1_10~0_20 256) 0)) InVars {~f1_10~0=v_~f1_10~0_20} OutVars{~f1_10~0=v_~f1_10~0_20, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread6Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread6Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][469], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 336#true, 312#true, 320#true, 328#true, 56#L155true, 100#L175true, 151#thread1FINALtrue, thread3Thread1of1ForFork0NotInUse, thread5Thread1of1ForFork5InUse, thread1Thread1of1ForFork1InUse, 115#L205-1true, thread6Thread1of1ForFork2InUse, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3NotInUse, thread4Thread1of1ForFork4InUse, 332#true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4))]) [2023-11-30 05:35:14,695 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2023-11-30 05:35:14,695 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 05:35:14,695 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 05:35:14,695 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2023-11-30 05:35:14,702 INFO L124 PetriNetUnfolderBase]: 31364/65989 cut-off events. [2023-11-30 05:35:14,703 INFO L125 PetriNetUnfolderBase]: For 248500/302979 co-relation queries the response was YES. [2023-11-30 05:35:15,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327776 conditions, 65989 events. 31364/65989 cut-off events. For 248500/302979 co-relation queries the response was YES. Maximal size of possible extension queue 2144. Compared 731196 event pairs, 16361 based on Foata normal form. 753/59857 useless extension candidates. Maximal degree in co-relation 314378. Up to 35338 conditions per place. [2023-11-30 05:35:16,390 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 385 selfloop transitions, 6 changer transitions 3/608 dead transitions. [2023-11-30 05:35:16,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 608 transitions, 7203 flow [2023-11-30 05:35:16,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2023-11-30 05:35:16,400 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8225108225108225 [2023-11-30 05:35:16,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2023-11-30 05:35:16,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2023-11-30 05:35:16,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:16,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2023-11-30 05:35:16,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 05:35:16,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:35:16,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:35:16,421 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 5 predicate places. [2023-11-30 05:35:16,421 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 608 transitions, 7203 flow [2023-11-30 05:35:16,421 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 05:35:16,421 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:16,421 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:16,421 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 05:35:16,422 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:35:16,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 62927419, now seen corresponding path program 1 times [2023-11-30 05:35:16,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:16,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714131911] [2023-11-30 05:35:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:16,547 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 05:35:16,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:16,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714131911] [2023-11-30 05:35:16,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714131911] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:16,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:16,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:16,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53128175] [2023-11-30 05:35:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:16,548 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:16,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:16,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:16,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:16,549 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 308 [2023-11-30 05:35:16,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 608 transitions, 7203 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 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 05:35:16,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:16,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 308 [2023-11-30 05:35:16,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:28,239 INFO L124 PetriNetUnfolderBase]: 29495/62089 cut-off events. [2023-11-30 05:35:28,239 INFO L125 PetriNetUnfolderBase]: For 269716/315031 co-relation queries the response was YES. [2023-11-30 05:35:28,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343551 conditions, 62089 events. 29495/62089 cut-off events. For 269716/315031 co-relation queries the response was YES. Maximal size of possible extension queue 2030. Compared 681285 event pairs, 11926 based on Foata normal form. 883/57148 useless extension candidates. Maximal degree in co-relation 328578. Up to 33455 conditions per place. [2023-11-30 05:35:29,679 INFO L140 encePairwiseOnDemand]: 300/308 looper letters, 452 selfloop transitions, 23 changer transitions 3/663 dead transitions. [2023-11-30 05:35:29,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 663 transitions, 8965 flow [2023-11-30 05:35:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:29,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 760 transitions. [2023-11-30 05:35:29,689 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8225108225108225 [2023-11-30 05:35:29,689 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 760 transitions. [2023-11-30 05:35:29,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 760 transitions. [2023-11-30 05:35:29,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:29,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 760 transitions. [2023-11-30 05:35:29,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 0 states have call successors, (0), 0 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 05:35:29,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:35:29,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:35:29,696 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 7 predicate places. [2023-11-30 05:35:29,696 INFO L500 AbstractCegarLoop]: Abstraction has has 263 places, 663 transitions, 8965 flow [2023-11-30 05:35:29,697 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 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 05:35:29,697 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:29,697 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:29,697 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 05:35:29,697 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:35:29,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash 351725636, now seen corresponding path program 1 times [2023-11-30 05:35:29,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:29,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118040189] [2023-11-30 05:35:29,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:29,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:29,781 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 05:35:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:29,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118040189] [2023-11-30 05:35:29,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118040189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:29,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:29,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621715514] [2023-11-30 05:35:29,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:29,782 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:29,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:29,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:29,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:29,783 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 308 [2023-11-30 05:35:29,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 663 transitions, 8965 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 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 05:35:29,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:29,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 308 [2023-11-30 05:35:29,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:39,353 INFO L124 PetriNetUnfolderBase]: 29780/58970 cut-off events. [2023-11-30 05:35:39,353 INFO L125 PetriNetUnfolderBase]: For 424326/545710 co-relation queries the response was YES. [2023-11-30 05:35:39,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380113 conditions, 58970 events. 29780/58970 cut-off events. For 424326/545710 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 616884 event pairs, 4887 based on Foata normal form. 1299/54305 useless extension candidates. Maximal degree in co-relation 352867. Up to 33927 conditions per place. [2023-11-30 05:35:40,457 INFO L140 encePairwiseOnDemand]: 300/308 looper letters, 617 selfloop transitions, 41 changer transitions 11/846 dead transitions. [2023-11-30 05:35:40,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 846 transitions, 13600 flow [2023-11-30 05:35:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:35:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:35:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2023-11-30 05:35:40,459 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8246753246753247 [2023-11-30 05:35:40,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 762 transitions. [2023-11-30 05:35:40,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 762 transitions. [2023-11-30 05:35:40,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:40,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 762 transitions. [2023-11-30 05:35:40,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 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 05:35:40,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:35:40,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:35:40,463 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 9 predicate places. [2023-11-30 05:35:40,464 INFO L500 AbstractCegarLoop]: Abstraction has has 265 places, 846 transitions, 13600 flow [2023-11-30 05:35:40,464 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 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 05:35:40,464 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:40,464 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:40,464 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 05:35:40,464 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:35:40,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:40,465 INFO L85 PathProgramCache]: Analyzing trace with hash 351725637, now seen corresponding path program 1 times [2023-11-30 05:35:40,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:40,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891027852] [2023-11-30 05:35:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:40,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:40,849 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 05:35:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891027852] [2023-11-30 05:35:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891027852] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:40,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:35:40,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778052036] [2023-11-30 05:35:40,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:40,851 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:35:40,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:40,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:35:40,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:35:40,853 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 308 [2023-11-30 05:35:40,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 846 transitions, 13600 flow. Second operand has 4 states, 4 states have (on average 208.25) internal successors, (833), 4 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:40,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:40,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 308 [2023-11-30 05:35:40,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:49,763 INFO L124 PetriNetUnfolderBase]: 24916/49324 cut-off events. [2023-11-30 05:35:49,763 INFO L125 PetriNetUnfolderBase]: For 423276/530325 co-relation queries the response was YES. [2023-11-30 05:35:50,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352504 conditions, 49324 events. 24916/49324 cut-off events. For 423276/530325 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 505784 event pairs, 3314 based on Foata normal form. 1854/46424 useless extension candidates. Maximal degree in co-relation 327468. Up to 28157 conditions per place. [2023-11-30 05:35:51,000 INFO L140 encePairwiseOnDemand]: 299/308 looper letters, 762 selfloop transitions, 42 changer transitions 11/984 dead transitions. [2023-11-30 05:35:51,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 984 transitions, 17974 flow [2023-11-30 05:35:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:35:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:35:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 961 transitions. [2023-11-30 05:35:51,002 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7800324675324676 [2023-11-30 05:35:51,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 961 transitions. [2023-11-30 05:35:51,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 961 transitions. [2023-11-30 05:35:51,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:35:51,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 961 transitions. [2023-11-30 05:35:51,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 240.25) internal successors, (961), 4 states have internal predecessors, (961), 0 states have call successors, (0), 0 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 05:35:51,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 05:35:51,007 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 05:35:51,007 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 10 predicate places. [2023-11-30 05:35:51,007 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 984 transitions, 17974 flow [2023-11-30 05:35:51,008 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 208.25) internal successors, (833), 4 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:35:51,008 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:35:51,008 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:35:51,008 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 05:35:51,008 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread4Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:35:51,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:35:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1680099782, now seen corresponding path program 1 times [2023-11-30 05:35:51,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:35:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947043036] [2023-11-30 05:35:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:35:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:35:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:35:51,095 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 05:35:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:35:51,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947043036] [2023-11-30 05:35:51,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947043036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:35:51,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:35:51,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:35:51,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222399458] [2023-11-30 05:35:51,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:35:51,096 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:35:51,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:35:51,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:35:51,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:35:51,098 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 308 [2023-11-30 05:35:51,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 984 transitions, 17974 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 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 05:35:51,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:35:51,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 308 [2023-11-30 05:35:51,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:35:59,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][693], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 338#(and (<= 4 (select |#length| |thread1Thread1of1ForFork1_~#t3~0.base|)) (= |thread1Thread1of1ForFork1_~#t3~0.offset| 0)), 312#true, 320#true, 328#true, 344#true, thread3Thread1of1ForFork0InUse, 348#true, thread5Thread1of1ForFork5NotInUse, 217#thread4FINALtrue, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 353#true, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 185#L236-4true, thread2Thread1of1ForFork3InUse, 334#(and (= |thread1Thread1of1ForFork1_~#t2~0.offset| 0) (= (select |#length| |thread1Thread1of1ForFork1_~#t2~0.base|) 4)), thread4Thread1of1ForFork4InUse, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 342#(= (select |#valid| |thread1Thread1of1ForFork1_~#t3~0.base|) 1)]) [2023-11-30 05:35:59,146 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 05:35:59,146 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-30 05:35:59,146 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:35:59,146 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 05:35:59,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][693], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 338#(and (<= 4 (select |#length| |thread1Thread1of1ForFork1_~#t3~0.base|)) (= |thread1Thread1of1ForFork1_~#t3~0.offset| 0)), 6#L237-1true, 312#true, 320#true, 328#true, 344#true, thread3Thread1of1ForFork0InUse, 348#true, thread5Thread1of1ForFork5NotInUse, 217#thread4FINALtrue, thread1Thread1of1ForFork1InUse, thread6Thread1of1ForFork2NotInUse, 353#true, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, thread2Thread1of1ForFork3InUse, 334#(and (= |thread1Thread1of1ForFork1_~#t2~0.offset| 0) (= (select |#length| |thread1Thread1of1ForFork1_~#t2~0.base|) 4)), thread4Thread1of1ForFork4InUse, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 342#(= (select |#valid| |thread1Thread1of1ForFork1_~#t3~0.base|) 1)]) [2023-11-30 05:35:59,504 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:59,504 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:59,505 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:59,505 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:59,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([779] L54-->L57: Formula: (not (= (mod v_~f2_3~0_18 256) 0)) InVars {~f2_3~0=v_~f2_3~0_18} OutVars{thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f2_3~0=v_~f2_3~0_18} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][693], [326#(and (= (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|) 4) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 113#L57true, 338#(and (<= 4 (select |#length| |thread1Thread1of1ForFork1_~#t3~0.base|)) (= |thread1Thread1of1ForFork1_~#t3~0.offset| 0)), 312#true, 320#true, 328#true, 344#true, 348#true, thread3Thread1of1ForFork0InUse, thread5Thread1of1ForFork5NotInUse, 217#thread4FINALtrue, thread1Thread1of1ForFork1InUse, 353#true, thread6Thread1of1ForFork2NotInUse, 106#thread1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 140#ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCEtrue, 334#(and (= |thread1Thread1of1ForFork1_~#t2~0.offset| 0) (= (select |#length| |thread1Thread1of1ForFork1_~#t2~0.base|) 4)), thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork4InUse, 175#L91true, 318#(and (= |ULTIMATE.start_main_~#t1~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) 4)), 342#(= (select |#valid| |thread1Thread1of1ForFork1_~#t3~0.base|) 1)]) [2023-11-30 05:35:59,552 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2023-11-30 05:35:59,552 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:59,552 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 05:35:59,552 INFO L297 olderBase$Statistics]: existing Event has 176 ancestors and is cut-off event [2023-11-30 05:35:59,988 INFO L124 PetriNetUnfolderBase]: 23947/47721 cut-off events. [2023-11-30 05:35:59,989 INFO L125 PetriNetUnfolderBase]: For 541162/648962 co-relation queries the response was YES. [2023-11-30 05:36:00,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366346 conditions, 47721 events. 23947/47721 cut-off events. For 541162/648962 co-relation queries the response was YES. Maximal size of possible extension queue 1834. Compared 489619 event pairs, 2618 based on Foata normal form. 1016/44140 useless extension candidates. Maximal degree in co-relation 341711. Up to 26659 conditions per place. [2023-11-30 05:36:01,275 INFO L140 encePairwiseOnDemand]: 304/308 looper letters, 829 selfloop transitions, 23 changer transitions 13/1125 dead transitions. [2023-11-30 05:36:01,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 1125 transitions, 23087 flow [2023-11-30 05:36:01,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:36:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:36:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2023-11-30 05:36:01,277 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8138528138528138 [2023-11-30 05:36:01,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2023-11-30 05:36:01,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2023-11-30 05:36:01,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:01,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2023-11-30 05:36:01,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 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 05:36:01,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:36:01,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:36:01,280 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 10 predicate places. [2023-11-30 05:36:01,280 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 1125 transitions, 23087 flow [2023-11-30 05:36:01,280 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 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 05:36:01,280 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:01,280 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 05:36:01,280 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 05:36:01,280 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread4Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:36:01,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:01,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1680099783, now seen corresponding path program 1 times [2023-11-30 05:36:01,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:01,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412230860] [2023-11-30 05:36:01,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:01,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 05:36:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412230860] [2023-11-30 05:36:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412230860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:01,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:01,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 05:36:01,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849941304] [2023-11-30 05:36:01,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:01,341 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 05:36:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 05:36:01,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 05:36:01,342 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 308 [2023-11-30 05:36:01,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 1125 transitions, 23087 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 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 05:36:01,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:01,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 308 [2023-11-30 05:36:01,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:11,572 INFO L124 PetriNetUnfolderBase]: 24855/50525 cut-off events. [2023-11-30 05:36:11,573 INFO L125 PetriNetUnfolderBase]: For 684861/826196 co-relation queries the response was YES. [2023-11-30 05:36:11,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410391 conditions, 50525 events. 24855/50525 cut-off events. For 684861/826196 co-relation queries the response was YES. Maximal size of possible extension queue 2075. Compared 530532 event pairs, 2753 based on Foata normal form. 1280/46962 useless extension candidates. Maximal degree in co-relation 372209. Up to 27558 conditions per place. [2023-11-30 05:36:12,904 INFO L140 encePairwiseOnDemand]: 300/308 looper letters, 1045 selfloop transitions, 63 changer transitions 36/1313 dead transitions. [2023-11-30 05:36:12,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1313 transitions, 29841 flow [2023-11-30 05:36:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 05:36:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 05:36:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2023-11-30 05:36:12,906 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8192640692640693 [2023-11-30 05:36:12,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 757 transitions. [2023-11-30 05:36:12,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 757 transitions. [2023-11-30 05:36:12,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:12,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 757 transitions. [2023-11-30 05:36:12,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 05:36:12,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:36:12,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 05:36:12,910 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 12 predicate places. [2023-11-30 05:36:12,910 INFO L500 AbstractCegarLoop]: Abstraction has has 268 places, 1313 transitions, 29841 flow [2023-11-30 05:36:12,910 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 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 05:36:12,910 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:12,911 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:12,911 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 05:36:12,911 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:36:12,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash 992024243, now seen corresponding path program 1 times [2023-11-30 05:36:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:12,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251178182] [2023-11-30 05:36:12,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:13,258 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 05:36:13,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251178182] [2023-11-30 05:36:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251178182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:13,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:36:13,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053179527] [2023-11-30 05:36:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:13,259 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:36:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:36:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:36:13,261 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 308 [2023-11-30 05:36:13,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 1313 transitions, 29841 flow. Second operand has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:36:13,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:13,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 308 [2023-11-30 05:36:13,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:25,135 INFO L124 PetriNetUnfolderBase]: 24902/52126 cut-off events. [2023-11-30 05:36:25,136 INFO L125 PetriNetUnfolderBase]: For 804131/987527 co-relation queries the response was YES. [2023-11-30 05:36:25,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444490 conditions, 52126 events. 24902/52126 cut-off events. For 804131/987527 co-relation queries the response was YES. Maximal size of possible extension queue 2139. Compared 562384 event pairs, 2333 based on Foata normal form. 2432/49680 useless extension candidates. Maximal degree in co-relation 403338. Up to 27620 conditions per place. [2023-11-30 05:36:26,174 INFO L140 encePairwiseOnDemand]: 297/308 looper letters, 1235 selfloop transitions, 55 changer transitions 36/1493 dead transitions. [2023-11-30 05:36:26,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 1493 transitions, 36678 flow [2023-11-30 05:36:26,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:36:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:36:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1438 transitions. [2023-11-30 05:36:26,176 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7781385281385281 [2023-11-30 05:36:26,176 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1438 transitions. [2023-11-30 05:36:26,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1438 transitions. [2023-11-30 05:36:26,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:26,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1438 transitions. [2023-11-30 05:36:26,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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 05:36:26,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:36:26,182 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:36:26,182 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 17 predicate places. [2023-11-30 05:36:26,182 INFO L500 AbstractCegarLoop]: Abstraction has has 273 places, 1493 transitions, 36678 flow [2023-11-30 05:36:26,183 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.5) internal successors, (1275), 6 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 05:36:26,183 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:26,183 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:26,183 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-30 05:36:26,183 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:36:26,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash -579701344, now seen corresponding path program 1 times [2023-11-30 05:36:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504948488] [2023-11-30 05:36:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:26,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:26,428 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 05:36:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:26,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504948488] [2023-11-30 05:36:26,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504948488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:26,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:36:26,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987238120] [2023-11-30 05:36:26,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:26,429 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:36:26,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:26,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:36:26,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:36:26,431 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 308 [2023-11-30 05:36:26,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 1493 transitions, 36678 flow. Second operand has 6 states, 6 states have (on average 212.83333333333334) internal successors, (1277), 6 states have internal predecessors, (1277), 0 states have call successors, (0), 0 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 05:36:26,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:26,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 308 [2023-11-30 05:36:26,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:40,433 INFO L124 PetriNetUnfolderBase]: 24310/50879 cut-off events. [2023-11-30 05:36:40,434 INFO L125 PetriNetUnfolderBase]: For 908439/1065610 co-relation queries the response was YES. [2023-11-30 05:36:40,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464331 conditions, 50879 events. 24310/50879 cut-off events. For 908439/1065610 co-relation queries the response was YES. Maximal size of possible extension queue 2106. Compared 547160 event pairs, 2254 based on Foata normal form. 2562/48654 useless extension candidates. Maximal degree in co-relation 433193. Up to 27085 conditions per place. [2023-11-30 05:36:41,507 INFO L140 encePairwiseOnDemand]: 298/308 looper letters, 1284 selfloop transitions, 42 changer transitions 40/1533 dead transitions. [2023-11-30 05:36:41,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 1533 transitions, 40272 flow [2023-11-30 05:36:41,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:36:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:36:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1419 transitions. [2023-11-30 05:36:41,510 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7678571428571429 [2023-11-30 05:36:41,510 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1419 transitions. [2023-11-30 05:36:41,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1419 transitions. [2023-11-30 05:36:41,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:41,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1419 transitions. [2023-11-30 05:36:41,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 236.5) internal successors, (1419), 6 states have internal predecessors, (1419), 0 states have call successors, (0), 0 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 05:36:41,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:36:41,514 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:36:41,514 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 21 predicate places. [2023-11-30 05:36:41,514 INFO L500 AbstractCegarLoop]: Abstraction has has 277 places, 1533 transitions, 40272 flow [2023-11-30 05:36:41,515 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 212.83333333333334) internal successors, (1277), 6 states have internal predecessors, (1277), 0 states have call successors, (0), 0 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 05:36:41,515 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:41,515 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:41,515 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 05:36:41,515 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:36:41,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 58736119, now seen corresponding path program 1 times [2023-11-30 05:36:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080863388] [2023-11-30 05:36:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:41,709 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 05:36:41,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080863388] [2023-11-30 05:36:41,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080863388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 05:36:41,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443006006] [2023-11-30 05:36:41,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:41,710 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 05:36:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 05:36:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-30 05:36:41,712 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 308 [2023-11-30 05:36:41,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 1533 transitions, 40272 flow. Second operand has 5 states, 5 states have (on average 213.6) internal successors, (1068), 5 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 05:36:41,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:41,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 308 [2023-11-30 05:36:41,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:36:54,330 INFO L124 PetriNetUnfolderBase]: 23447/48746 cut-off events. [2023-11-30 05:36:54,330 INFO L125 PetriNetUnfolderBase]: For 998888/1164033 co-relation queries the response was YES. [2023-11-30 05:36:54,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480181 conditions, 48746 events. 23447/48746 cut-off events. For 998888/1164033 co-relation queries the response was YES. Maximal size of possible extension queue 1974. Compared 517118 event pairs, 1944 based on Foata normal form. 2775/46943 useless extension candidates. Maximal degree in co-relation 446974. Up to 26314 conditions per place. [2023-11-30 05:36:55,722 INFO L140 encePairwiseOnDemand]: 297/308 looper letters, 1300 selfloop transitions, 122 changer transitions 40/1629 dead transitions. [2023-11-30 05:36:55,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 1629 transitions, 46063 flow [2023-11-30 05:36:55,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:36:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:36:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 999 transitions. [2023-11-30 05:36:55,724 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8108766233766234 [2023-11-30 05:36:55,724 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 999 transitions. [2023-11-30 05:36:55,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 999 transitions. [2023-11-30 05:36:55,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:36:55,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 999 transitions. [2023-11-30 05:36:55,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 249.75) internal successors, (999), 4 states have internal predecessors, (999), 0 states have call successors, (0), 0 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 05:36:55,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 05:36:55,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 05:36:55,728 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 24 predicate places. [2023-11-30 05:36:55,728 INFO L500 AbstractCegarLoop]: Abstraction has has 280 places, 1629 transitions, 46063 flow [2023-11-30 05:36:55,728 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.6) internal successors, (1068), 5 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 05:36:55,728 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:36:55,729 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:36:55,729 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 05:36:55,729 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:36:55,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:36:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2110429584, now seen corresponding path program 1 times [2023-11-30 05:36:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:36:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167482557] [2023-11-30 05:36:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:36:55,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:36:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:36:55,906 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 05:36:55,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:36:55,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167482557] [2023-11-30 05:36:55,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167482557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:36:55,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:36:55,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 05:36:55,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522363255] [2023-11-30 05:36:55,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:36:55,908 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 05:36:55,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:36:55,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 05:36:55,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 05:36:55,909 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 308 [2023-11-30 05:36:55,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 1629 transitions, 46063 flow. Second operand has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 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 05:36:55,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:36:55,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 308 [2023-11-30 05:36:55,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:37:09,380 INFO L124 PetriNetUnfolderBase]: 23634/50147 cut-off events. [2023-11-30 05:37:09,380 INFO L125 PetriNetUnfolderBase]: For 1110809/1282492 co-relation queries the response was YES. [2023-11-30 05:37:09,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519003 conditions, 50147 events. 23634/50147 cut-off events. For 1110809/1282492 co-relation queries the response was YES. Maximal size of possible extension queue 2047. Compared 541904 event pairs, 2298 based on Foata normal form. 2575/47960 useless extension candidates. Maximal degree in co-relation 482751. Up to 26773 conditions per place. [2023-11-30 05:37:10,829 INFO L140 encePairwiseOnDemand]: 297/308 looper letters, 1512 selfloop transitions, 152 changer transitions 47/1887 dead transitions. [2023-11-30 05:37:10,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1887 transitions, 57661 flow [2023-11-30 05:37:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 05:37:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 05:37:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1010 transitions. [2023-11-30 05:37:10,831 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8198051948051948 [2023-11-30 05:37:10,831 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1010 transitions. [2023-11-30 05:37:10,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1010 transitions. [2023-11-30 05:37:10,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:37:10,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1010 transitions. [2023-11-30 05:37:10,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 252.5) internal successors, (1010), 4 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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 05:37:10,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 05:37:10,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 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 05:37:10,835 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 27 predicate places. [2023-11-30 05:37:10,835 INFO L500 AbstractCegarLoop]: Abstraction has has 283 places, 1887 transitions, 57661 flow [2023-11-30 05:37:10,835 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 217.75) internal successors, (871), 4 states have internal predecessors, (871), 0 states have call successors, (0), 0 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 05:37:10,835 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:37:10,835 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:37:10,835 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-30 05:37:10,836 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:37:10,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:37:10,836 INFO L85 PathProgramCache]: Analyzing trace with hash -603045652, now seen corresponding path program 1 times [2023-11-30 05:37:10,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:37:10,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685278256] [2023-11-30 05:37:10,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:37:10,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:37:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:37:11,010 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 05:37:11,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:37:11,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685278256] [2023-11-30 05:37:11,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685278256] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:37:11,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:37:11,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:37:11,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614349688] [2023-11-30 05:37:11,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:37:11,011 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:37:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:37:11,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:37:11,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:37:11,013 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 308 [2023-11-30 05:37:11,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 1887 transitions, 57661 flow. Second operand has 6 states, 6 states have (on average 213.16666666666666) internal successors, (1279), 6 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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 05:37:11,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:37:11,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 308 [2023-11-30 05:37:11,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:37:26,074 INFO L124 PetriNetUnfolderBase]: 22929/48837 cut-off events. [2023-11-30 05:37:26,074 INFO L125 PetriNetUnfolderBase]: For 1207663/1379973 co-relation queries the response was YES. [2023-11-30 05:37:26,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535306 conditions, 48837 events. 22929/48837 cut-off events. For 1207663/1379973 co-relation queries the response was YES. Maximal size of possible extension queue 1980. Compared 527760 event pairs, 2362 based on Foata normal form. 3074/47214 useless extension candidates. Maximal degree in co-relation 488107. Up to 26011 conditions per place. [2023-11-30 05:37:27,163 INFO L140 encePairwiseOnDemand]: 293/308 looper letters, 1603 selfloop transitions, 144 changer transitions 51/1967 dead transitions. [2023-11-30 05:37:27,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 1967 transitions, 64032 flow [2023-11-30 05:37:27,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:37:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:37:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1464 transitions. [2023-11-30 05:37:27,166 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7922077922077922 [2023-11-30 05:37:27,166 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1464 transitions. [2023-11-30 05:37:27,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1464 transitions. [2023-11-30 05:37:27,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:37:27,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1464 transitions. [2023-11-30 05:37:27,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.0) internal successors, (1464), 6 states have internal predecessors, (1464), 0 states have call successors, (0), 0 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 05:37:27,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:37:27,169 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:37:27,170 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 32 predicate places. [2023-11-30 05:37:27,170 INFO L500 AbstractCegarLoop]: Abstraction has has 288 places, 1967 transitions, 64032 flow [2023-11-30 05:37:27,170 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.16666666666666) internal successors, (1279), 6 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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 05:37:27,170 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:37:27,170 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:37:27,171 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-30 05:37:27,171 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:37:27,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:37:27,171 INFO L85 PathProgramCache]: Analyzing trace with hash -702734865, now seen corresponding path program 1 times [2023-11-30 05:37:27,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:37:27,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153051450] [2023-11-30 05:37:27,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:37:27,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:37:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:37:27,361 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 05:37:27,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:37:27,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153051450] [2023-11-30 05:37:27,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153051450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:37:27,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:37:27,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:37:27,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200967836] [2023-11-30 05:37:27,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:37:27,362 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:37:27,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:37:27,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:37:27,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:37:27,364 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 308 [2023-11-30 05:37:27,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 1967 transitions, 64032 flow. Second operand has 6 states, 6 states have (on average 213.16666666666666) internal successors, (1279), 6 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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 05:37:27,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:37:27,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 308 [2023-11-30 05:37:27,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:37:43,369 INFO L124 PetriNetUnfolderBase]: 23069/50163 cut-off events. [2023-11-30 05:37:43,369 INFO L125 PetriNetUnfolderBase]: For 1363797/1543773 co-relation queries the response was YES. [2023-11-30 05:37:43,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573058 conditions, 50163 events. 23069/50163 cut-off events. For 1363797/1543773 co-relation queries the response was YES. Maximal size of possible extension queue 2061. Compared 552041 event pairs, 2397 based on Foata normal form. 3345/48623 useless extension candidates. Maximal degree in co-relation 515236. Up to 26260 conditions per place. [2023-11-30 05:37:44,923 INFO L140 encePairwiseOnDemand]: 293/308 looper letters, 1751 selfloop transitions, 206 changer transitions 56/2189 dead transitions. [2023-11-30 05:37:44,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 2189 transitions, 75754 flow [2023-11-30 05:37:44,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:37:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:37:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1468 transitions. [2023-11-30 05:37:44,926 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7943722943722944 [2023-11-30 05:37:44,926 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1468 transitions. [2023-11-30 05:37:44,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1468 transitions. [2023-11-30 05:37:44,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:37:44,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1468 transitions. [2023-11-30 05:37:44,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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 05:37:44,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:37:44,930 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:37:44,930 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 37 predicate places. [2023-11-30 05:37:44,930 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 2189 transitions, 75754 flow [2023-11-30 05:37:44,931 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.16666666666666) internal successors, (1279), 6 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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 05:37:44,931 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:37:44,931 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:37:44,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-30 05:37:44,931 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:37:44,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:37:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1910133521, now seen corresponding path program 1 times [2023-11-30 05:37:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:37:44,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373140490] [2023-11-30 05:37:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:37:44,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:37:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:37:45,089 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 05:37:45,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:37:45,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373140490] [2023-11-30 05:37:45,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373140490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:37:45,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:37:45,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 05:37:45,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962432195] [2023-11-30 05:37:45,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:37:45,091 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 05:37:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:37:45,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 05:37:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 05:37:45,093 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 308 [2023-11-30 05:37:45,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 2189 transitions, 75754 flow. Second operand has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 05:37:45,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:37:45,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 308 [2023-11-30 05:37:45,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:38:01,666 INFO L124 PetriNetUnfolderBase]: 22499/49278 cut-off events. [2023-11-30 05:38:01,666 INFO L125 PetriNetUnfolderBase]: For 1425603/1589035 co-relation queries the response was YES. [2023-11-30 05:38:01,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589463 conditions, 49278 events. 22499/49278 cut-off events. For 1425603/1589035 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 543142 event pairs, 2312 based on Foata normal form. 3280/47716 useless extension candidates. Maximal degree in co-relation 528622. Up to 25913 conditions per place. [2023-11-30 05:38:03,247 INFO L140 encePairwiseOnDemand]: 293/308 looper letters, 1811 selfloop transitions, 169 changer transitions 56/2212 dead transitions. [2023-11-30 05:38:03,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 2212 transitions, 80957 flow [2023-11-30 05:38:03,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:38:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:38:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1458 transitions. [2023-11-30 05:38:03,249 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.788961038961039 [2023-11-30 05:38:03,249 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1458 transitions. [2023-11-30 05:38:03,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1458 transitions. [2023-11-30 05:38:03,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:38:03,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1458 transitions. [2023-11-30 05:38:03,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 0 states have call successors, (0), 0 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 05:38:03,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:38:03,253 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:38:03,253 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 42 predicate places. [2023-11-30 05:38:03,253 INFO L500 AbstractCegarLoop]: Abstraction has has 298 places, 2212 transitions, 80957 flow [2023-11-30 05:38:03,254 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 05:38:03,254 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:38:03,254 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:38:03,254 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-30 05:38:03,254 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:38:03,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:38:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash 361246754, now seen corresponding path program 1 times [2023-11-30 05:38:03,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:38:03,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881984663] [2023-11-30 05:38:03,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:38:03,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:38:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:38:03,450 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 05:38:03,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:38:03,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881984663] [2023-11-30 05:38:03,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881984663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:38:03,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:38:03,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:38:03,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749117958] [2023-11-30 05:38:03,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:38:03,451 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:38:03,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:38:03,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:38:03,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:38:03,453 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 308 [2023-11-30 05:38:03,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 2212 transitions, 80957 flow. Second operand has 7 states, 7 states have (on average 214.85714285714286) internal successors, (1504), 7 states have internal predecessors, (1504), 0 states have call successors, (0), 0 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 05:38:03,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:38:03,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 308 [2023-11-30 05:38:03,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:38:37,571 INFO L124 PetriNetUnfolderBase]: 38113/86327 cut-off events. [2023-11-30 05:38:37,572 INFO L125 PetriNetUnfolderBase]: For 2509734/2797104 co-relation queries the response was YES. [2023-11-30 05:38:38,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1042730 conditions, 86327 events. 38113/86327 cut-off events. For 2509734/2797104 co-relation queries the response was YES. Maximal size of possible extension queue 3308. Compared 1051757 event pairs, 7713 based on Foata normal form. 3738/81043 useless extension candidates. Maximal degree in co-relation 961034. Up to 43902 conditions per place. [2023-11-30 05:38:40,689 INFO L140 encePairwiseOnDemand]: 289/308 looper letters, 2549 selfloop transitions, 268 changer transitions 97/3083 dead transitions. [2023-11-30 05:38:40,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 3083 transitions, 121339 flow [2023-11-30 05:38:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-30 05:38:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-30 05:38:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2375 transitions. [2023-11-30 05:38:40,693 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7711038961038961 [2023-11-30 05:38:40,693 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2375 transitions. [2023-11-30 05:38:40,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2375 transitions. [2023-11-30 05:38:40,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:38:40,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2375 transitions. [2023-11-30 05:38:40,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 237.5) internal successors, (2375), 10 states have internal predecessors, (2375), 0 states have call successors, (0), 0 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 05:38:40,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 308.0) internal successors, (3388), 11 states have internal predecessors, (3388), 0 states have call successors, (0), 0 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 05:38:40,699 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 308.0) internal successors, (3388), 11 states have internal predecessors, (3388), 0 states have call successors, (0), 0 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 05:38:40,699 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 51 predicate places. [2023-11-30 05:38:40,699 INFO L500 AbstractCegarLoop]: Abstraction has has 307 places, 3083 transitions, 121339 flow [2023-11-30 05:38:40,699 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 214.85714285714286) internal successors, (1504), 7 states have internal predecessors, (1504), 0 states have call successors, (0), 0 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 05:38:40,699 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:38:40,700 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:38:40,700 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-30 05:38:40,700 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:38:40,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:38:40,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1146775360, now seen corresponding path program 2 times [2023-11-30 05:38:40,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:38:40,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149299212] [2023-11-30 05:38:40,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:38:40,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:38:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:38:40,957 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 05:38:40,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:38:40,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149299212] [2023-11-30 05:38:40,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149299212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:38:40,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:38:40,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-30 05:38:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266068711] [2023-11-30 05:38:40,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:38:40,958 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-30 05:38:40,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:38:40,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-30 05:38:40,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-30 05:38:40,959 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 308 [2023-11-30 05:38:40,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 3083 transitions, 121339 flow. Second operand has 8 states, 8 states have (on average 214.375) internal successors, (1715), 8 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 05:38:40,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:38:40,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 308 [2023-11-30 05:38:40,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:39:25,562 INFO L124 PetriNetUnfolderBase]: 42590/96764 cut-off events. [2023-11-30 05:39:25,563 INFO L125 PetriNetUnfolderBase]: For 3150521/3536988 co-relation queries the response was YES. [2023-11-30 05:39:26,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1221132 conditions, 96764 events. 42590/96764 cut-off events. For 3150521/3536988 co-relation queries the response was YES. Maximal size of possible extension queue 3968. Compared 1202953 event pairs, 8083 based on Foata normal form. 6747/93533 useless extension candidates. Maximal degree in co-relation 1141566. Up to 48929 conditions per place. [2023-11-30 05:39:28,761 INFO L140 encePairwiseOnDemand]: 287/308 looper letters, 3108 selfloop transitions, 451 changer transitions 138/3866 dead transitions. [2023-11-30 05:39:28,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 3866 transitions, 160792 flow [2023-11-30 05:39:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-30 05:39:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-30 05:39:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4008 transitions. [2023-11-30 05:39:28,767 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7654698242933538 [2023-11-30 05:39:28,767 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4008 transitions. [2023-11-30 05:39:28,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4008 transitions. [2023-11-30 05:39:28,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:39:28,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4008 transitions. [2023-11-30 05:39:28,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 235.76470588235293) internal successors, (4008), 17 states have internal predecessors, (4008), 0 states have call successors, (0), 0 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 05:39:28,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 308.0) internal successors, (5544), 18 states have internal predecessors, (5544), 0 states have call successors, (0), 0 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 05:39:28,777 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 308.0) internal successors, (5544), 18 states have internal predecessors, (5544), 0 states have call successors, (0), 0 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 05:39:28,778 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 67 predicate places. [2023-11-30 05:39:28,778 INFO L500 AbstractCegarLoop]: Abstraction has has 323 places, 3866 transitions, 160792 flow [2023-11-30 05:39:28,778 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 214.375) internal successors, (1715), 8 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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 05:39:28,778 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:39:28,778 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:39:28,778 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-30 05:39:28,778 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:39:28,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:39:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1633573180, now seen corresponding path program 1 times [2023-11-30 05:39:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:39:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058657761] [2023-11-30 05:39:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:39:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:39:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:39:29,150 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 05:39:29,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:39:29,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058657761] [2023-11-30 05:39:29,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058657761] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:39:29,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:39:29,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 05:39:29,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918878983] [2023-11-30 05:39:29,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:39:29,151 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 05:39:29,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:39:29,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 05:39:29,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-30 05:39:29,153 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 308 [2023-11-30 05:39:29,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 3866 transitions, 160792 flow. Second operand has 6 states, 6 states have (on average 215.5) internal successors, (1293), 6 states have internal predecessors, (1293), 0 states have call successors, (0), 0 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 05:39:29,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:39:29,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 308 [2023-11-30 05:39:29,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:41:05,820 INFO L124 PetriNetUnfolderBase]: 68100/154474 cut-off events. [2023-11-30 05:41:05,820 INFO L125 PetriNetUnfolderBase]: For 5122144/5639058 co-relation queries the response was YES. [2023-11-30 05:41:07,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022198 conditions, 154474 events. 68100/154474 cut-off events. For 5122144/5639058 co-relation queries the response was YES. Maximal size of possible extension queue 5734. Compared 2026540 event pairs, 17374 based on Foata normal form. 2713/140500 useless extension candidates. Maximal degree in co-relation 1915705. Up to 78878 conditions per place. [2023-11-30 05:41:11,959 INFO L140 encePairwiseOnDemand]: 296/308 looper letters, 4225 selfloop transitions, 170 changer transitions 138/4718 dead transitions. [2023-11-30 05:41:11,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 4718 transitions, 207129 flow [2023-11-30 05:41:11,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 05:41:11,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 05:41:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1468 transitions. [2023-11-30 05:41:11,961 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7943722943722944 [2023-11-30 05:41:11,961 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1468 transitions. [2023-11-30 05:41:11,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1468 transitions. [2023-11-30 05:41:11,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:41:11,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1468 transitions. [2023-11-30 05:41:11,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 0 states have call successors, (0), 0 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 05:41:11,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:41:11,964 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 308.0) internal successors, (2156), 7 states have internal predecessors, (2156), 0 states have call successors, (0), 0 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 05:41:11,964 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 72 predicate places. [2023-11-30 05:41:11,964 INFO L500 AbstractCegarLoop]: Abstraction has has 328 places, 4718 transitions, 207129 flow [2023-11-30 05:41:11,964 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.5) internal successors, (1293), 6 states have internal predecessors, (1293), 0 states have call successors, (0), 0 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 05:41:11,964 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:41:11,964 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:41:11,964 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-30 05:41:11,964 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:41:11,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:41:11,965 INFO L85 PathProgramCache]: Analyzing trace with hash -189566682, now seen corresponding path program 3 times [2023-11-30 05:41:11,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:41:11,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210511355] [2023-11-30 05:41:11,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:41:11,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:41:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:41:12,169 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 05:41:12,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:41:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210511355] [2023-11-30 05:41:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210511355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:41:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:41:12,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:41:12,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670565227] [2023-11-30 05:41:12,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:41:12,172 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:41:12,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:41:12,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:41:12,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:41:12,174 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 308 [2023-11-30 05:41:12,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 4718 transitions, 207129 flow. Second operand has 7 states, 7 states have (on average 214.85714285714286) internal successors, (1504), 7 states have internal predecessors, (1504), 0 states have call successors, (0), 0 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 05:41:12,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:41:12,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 308 [2023-11-30 05:41:12,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 05:43:00,302 INFO L124 PetriNetUnfolderBase]: 67447/152909 cut-off events. [2023-11-30 05:43:00,302 INFO L125 PetriNetUnfolderBase]: For 5615631/6209369 co-relation queries the response was YES. [2023-11-30 05:43:01,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2087447 conditions, 152909 events. 67447/152909 cut-off events. For 5615631/6209369 co-relation queries the response was YES. Maximal size of possible extension queue 5651. Compared 2002952 event pairs, 14040 based on Foata normal form. 4316/140668 useless extension candidates. Maximal degree in co-relation 1984882. Up to 78155 conditions per place. [2023-11-30 05:43:06,493 INFO L140 encePairwiseOnDemand]: 293/308 looper letters, 4002 selfloop transitions, 375 changer transitions 160/4708 dead transitions. [2023-11-30 05:43:06,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 4708 transitions, 215914 flow [2023-11-30 05:43:06,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 05:43:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 05:43:06,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2148 transitions. [2023-11-30 05:43:06,498 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7748917748917749 [2023-11-30 05:43:06,498 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2148 transitions. [2023-11-30 05:43:06,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2148 transitions. [2023-11-30 05:43:06,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 05:43:06,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2148 transitions. [2023-11-30 05:43:06,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 238.66666666666666) internal successors, (2148), 9 states have internal predecessors, (2148), 0 states have call successors, (0), 0 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 05:43:06,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 308.0) internal successors, (3080), 10 states have internal predecessors, (3080), 0 states have call successors, (0), 0 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 05:43:06,502 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 308.0) internal successors, (3080), 10 states have internal predecessors, (3080), 0 states have call successors, (0), 0 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 05:43:06,503 INFO L307 CegarLoopForPetriNet]: 256 programPoint places, 78 predicate places. [2023-11-30 05:43:06,503 INFO L500 AbstractCegarLoop]: Abstraction has has 334 places, 4708 transitions, 215914 flow [2023-11-30 05:43:06,503 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 214.85714285714286) internal successors, (1504), 7 states have internal predecessors, (1504), 0 states have call successors, (0), 0 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 05:43:06,503 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 05:43:06,503 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:43:06,503 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-30 05:43:06,503 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-11-30 05:43:06,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 05:43:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1303928243, now seen corresponding path program 1 times [2023-11-30 05:43:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 05:43:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616874284] [2023-11-30 05:43:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 05:43:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 05:43:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 05:43:06,711 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 05:43:06,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 05:43:06,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616874284] [2023-11-30 05:43:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616874284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 05:43:06,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 05:43:06,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 05:43:06,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890675347] [2023-11-30 05:43:06,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 05:43:06,712 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-30 05:43:06,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 05:43:06,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-30 05:43:06,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-30 05:43:06,714 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 308 [2023-11-30 05:43:06,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 4708 transitions, 215914 flow. Second operand has 7 states, 7 states have (on average 214.85714285714286) internal successors, (1504), 7 states have internal predecessors, (1504), 0 states have call successors, (0), 0 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 05:43:06,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 05:43:06,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 308 [2023-11-30 05:43:06,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand