/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 -i ../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 21:37:13,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 21:37:13,297 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-29 21:37:13,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 21:37:13,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 21:37:13,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 21:37:13,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 21:37:13,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 21:37:13,327 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 21:37:13,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 21:37:13,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 21:37:13,330 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 21:37:13,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 21:37:13,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 21:37:13,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 21:37:13,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 21:37:13,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 21:37:13,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 21:37:13,333 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 21:37:13,333 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 21:37:13,333 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 21:37:13,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 21:37:13,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 21:37:13,334 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 21:37:13,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 21:37:13,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:37:13,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 21:37:13,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 21:37:13,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 21:37:13,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 21:37:13,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 21:37:13,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 21:37:13,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 21:37:13,336 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 [2023-11-29 21:37:13,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 21:37:13,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 21:37:13,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 21:37:13,549 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 21:37:13,549 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 21:37:13,550 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2023-11-29 21:37:14,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 21:37:14,719 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 21:37:14,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2023-11-29 21:37:14,725 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b73d1c16/53e8ee581e824f5db11d839bf6fc544f/FLAG07c5e94ab [2023-11-29 21:37:14,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b73d1c16/53e8ee581e824f5db11d839bf6fc544f [2023-11-29 21:37:14,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 21:37:14,738 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 21:37:14,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 21:37:14,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 21:37:14,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 21:37:14,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41731536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14, skipping insertion in model container [2023-11-29 21:37:14,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,764 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 21:37:14,893 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c[2989,3002] [2023-11-29 21:37:14,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:37:14,905 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 21:37:14,923 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c[2989,3002] [2023-11-29 21:37:14,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:37:14,930 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 21:37:14,930 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 21:37:14,936 INFO L206 MainTranslator]: Completed translation [2023-11-29 21:37:14,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14 WrapperNode [2023-11-29 21:37:14,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 21:37:14,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 21:37:14,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 21:37:14,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 21:37:14,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,965 INFO L138 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74 [2023-11-29 21:37:14,966 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 21:37:14,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 21:37:14,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 21:37:14,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 21:37:14,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,981 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,992 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:14,993 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:15,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:15,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 21:37:15,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 21:37:15,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 21:37:15,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 21:37:15,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (1/1) ... [2023-11-29 21:37:15,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:37:15,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:37:15,033 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-29 21:37:15,052 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-29 21:37:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 21:37:15,070 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 21:37:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 21:37:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 21:37:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 21:37:15,071 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 21:37:15,071 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 21:37:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 21:37:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 21:37:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 21:37:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 21:37:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 21:37:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 21:37:15,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 21:37:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 21:37:15,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 21:37:15,073 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 21:37:15,183 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 21:37:15,185 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 21:37:15,364 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 21:37:15,383 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 21:37:15,383 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 21:37:15,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:37:15 BoogieIcfgContainer [2023-11-29 21:37:15,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 21:37:15,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 21:37:15,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 21:37:15,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 21:37:15,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 09:37:14" (1/3) ... [2023-11-29 21:37:15,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54224e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:37:15, skipping insertion in model container [2023-11-29 21:37:15,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:37:14" (2/3) ... [2023-11-29 21:37:15,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54224e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:37:15, skipping insertion in model container [2023-11-29 21:37:15,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:37:15" (3/3) ... [2023-11-29 21:37:15,395 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2023-11-29 21:37:15,410 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 21:37:15,410 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 21:37:15,410 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 21:37:15,471 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 21:37:15,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 108 transitions, 237 flow [2023-11-29 21:37:15,543 INFO L124 PetriNetUnfolderBase]: 7/105 cut-off events. [2023-11-29 21:37:15,544 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 21:37:15,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 105 events. 7/105 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-11-29 21:37:15,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 108 transitions, 237 flow [2023-11-29 21:37:15,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 94 transitions, 206 flow [2023-11-29 21:37:15,565 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 21:37:15,571 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;@66d253c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 21:37:15,571 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 21:37:15,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 21:37:15,613 INFO L124 PetriNetUnfolderBase]: 7/93 cut-off events. [2023-11-29 21:37:15,613 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 21:37:15,613 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:15,614 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] [2023-11-29 21:37:15,620 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:15,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:15,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1920082472, now seen corresponding path program 1 times [2023-11-29 21:37:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889683376] [2023-11-29 21:37:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:15,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:16,438 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-29 21:37:16,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889683376] [2023-11-29 21:37:16,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889683376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:16,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:16,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:37:16,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740419313] [2023-11-29 21:37:16,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:16,448 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:37:16,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:16,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:37:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:37:16,483 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2023-11-29 21:37:16,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 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-29 21:37:16,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:16,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2023-11-29 21:37:16,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:16,892 INFO L124 PetriNetUnfolderBase]: 299/822 cut-off events. [2023-11-29 21:37:16,892 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 21:37:16,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 822 events. 299/822 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4820 event pairs, 78 based on Foata normal form. 44/769 useless extension candidates. Maximal degree in co-relation 1063. Up to 193 conditions per place. [2023-11-29 21:37:16,903 INFO L140 encePairwiseOnDemand]: 94/108 looper letters, 48 selfloop transitions, 9 changer transitions 30/150 dead transitions. [2023-11-29 21:37:16,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 150 transitions, 528 flow [2023-11-29 21:37:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:37:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:37:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 786 transitions. [2023-11-29 21:37:16,920 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2023-11-29 21:37:16,920 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 786 transitions. [2023-11-29 21:37:16,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 786 transitions. [2023-11-29 21:37:16,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:16,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 786 transitions. [2023-11-29 21:37:16,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 87.33333333333333) internal successors, (786), 9 states have internal predecessors, (786), 0 states have call successors, (0), 0 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-29 21:37:16,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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-29 21:37:16,937 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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-29 21:37:16,942 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 8 predicate places. [2023-11-29 21:37:16,943 INFO L500 AbstractCegarLoop]: Abstraction has has 105 places, 150 transitions, 528 flow [2023-11-29 21:37:16,943 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 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-29 21:37:16,943 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:16,944 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] [2023-11-29 21:37:16,944 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 21:37:16,944 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:16,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:16,945 INFO L85 PathProgramCache]: Analyzing trace with hash 438828278, now seen corresponding path program 2 times [2023-11-29 21:37:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117022078] [2023-11-29 21:37:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:16,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:17,209 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-29 21:37:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117022078] [2023-11-29 21:37:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117022078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 21:37:17,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146139182] [2023-11-29 21:37:17,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:17,212 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 21:37:17,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 21:37:17,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 21:37:17,214 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2023-11-29 21:37:17,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 150 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 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-29 21:37:17,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:17,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2023-11-29 21:37:17,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:17,399 INFO L124 PetriNetUnfolderBase]: 336/940 cut-off events. [2023-11-29 21:37:17,399 INFO L125 PetriNetUnfolderBase]: For 482/554 co-relation queries the response was YES. [2023-11-29 21:37:17,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 940 events. 336/940 cut-off events. For 482/554 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5781 event pairs, 66 based on Foata normal form. 1/819 useless extension candidates. Maximal degree in co-relation 1701. Up to 228 conditions per place. [2023-11-29 21:37:17,409 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 51 selfloop transitions, 9 changer transitions 29/163 dead transitions. [2023-11-29 21:37:17,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 163 transitions, 737 flow [2023-11-29 21:37:17,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 21:37:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 21:37:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 517 transitions. [2023-11-29 21:37:17,411 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7978395061728395 [2023-11-29 21:37:17,412 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 517 transitions. [2023-11-29 21:37:17,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 517 transitions. [2023-11-29 21:37:17,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:17,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 517 transitions. [2023-11-29 21:37:17,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 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-29 21:37:17,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:17,415 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:17,416 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 13 predicate places. [2023-11-29 21:37:17,417 INFO L500 AbstractCegarLoop]: Abstraction has has 110 places, 163 transitions, 737 flow [2023-11-29 21:37:17,417 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.0) internal successors, (498), 6 states have internal predecessors, (498), 0 states have call successors, (0), 0 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-29 21:37:17,417 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:17,417 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] [2023-11-29 21:37:17,418 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 21:37:17,418 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:17,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1552210506, now seen corresponding path program 3 times [2023-11-29 21:37:17,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909160784] [2023-11-29 21:37:17,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:17,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:17,707 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-29 21:37:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909160784] [2023-11-29 21:37:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909160784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:17,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:17,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:37:17,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052620655] [2023-11-29 21:37:17,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:17,710 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:37:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:17,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:37:17,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:37:17,716 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 108 [2023-11-29 21:37:17,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 163 transitions, 737 flow. Second operand has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:17,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:17,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 108 [2023-11-29 21:37:17,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:17,920 INFO L124 PetriNetUnfolderBase]: 356/941 cut-off events. [2023-11-29 21:37:17,920 INFO L125 PetriNetUnfolderBase]: For 1039/1331 co-relation queries the response was YES. [2023-11-29 21:37:17,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2483 conditions, 941 events. 356/941 cut-off events. For 1039/1331 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5733 event pairs, 20 based on Foata normal form. 7/830 useless extension candidates. Maximal degree in co-relation 2274. Up to 251 conditions per place. [2023-11-29 21:37:17,927 INFO L140 encePairwiseOnDemand]: 100/108 looper letters, 50 selfloop transitions, 13 changer transitions 35/172 dead transitions. [2023-11-29 21:37:17,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 172 transitions, 963 flow [2023-11-29 21:37:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 21:37:17,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 21:37:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 600 transitions. [2023-11-29 21:37:17,929 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7936507936507936 [2023-11-29 21:37:17,929 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 600 transitions. [2023-11-29 21:37:17,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 600 transitions. [2023-11-29 21:37:17,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:17,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 600 transitions. [2023-11-29 21:37:17,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 85.71428571428571) internal successors, (600), 7 states have internal predecessors, (600), 0 states have call successors, (0), 0 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-29 21:37:17,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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-29 21:37:17,933 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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-29 21:37:17,934 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 19 predicate places. [2023-11-29 21:37:17,934 INFO L500 AbstractCegarLoop]: Abstraction has has 116 places, 172 transitions, 963 flow [2023-11-29 21:37:17,935 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.57142857142857) internal successors, (578), 7 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:17,935 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:17,935 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] [2023-11-29 21:37:17,935 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 21:37:17,935 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:17,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1314969152, now seen corresponding path program 4 times [2023-11-29 21:37:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:17,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921157102] [2023-11-29 21:37:17,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:17,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:18,130 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-29 21:37:18,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:18,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921157102] [2023-11-29 21:37:18,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921157102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:18,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:18,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 21:37:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121213339] [2023-11-29 21:37:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:18,132 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 21:37:18,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:18,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 21:37:18,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 21:37:18,134 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2023-11-29 21:37:18,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 172 transitions, 963 flow. Second operand has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 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-29 21:37:18,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:18,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2023-11-29 21:37:18,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:18,419 INFO L124 PetriNetUnfolderBase]: 389/944 cut-off events. [2023-11-29 21:37:18,419 INFO L125 PetriNetUnfolderBase]: For 1664/2066 co-relation queries the response was YES. [2023-11-29 21:37:18,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3069 conditions, 944 events. 389/944 cut-off events. For 1664/2066 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5635 event pairs, 23 based on Foata normal form. 7/838 useless extension candidates. Maximal degree in co-relation 2900. Up to 262 conditions per place. [2023-11-29 21:37:18,425 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 48 selfloop transitions, 7 changer transitions 80/200 dead transitions. [2023-11-29 21:37:18,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 200 transitions, 1379 flow [2023-11-29 21:37:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 21:37:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 21:37:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 760 transitions. [2023-11-29 21:37:18,427 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7818930041152263 [2023-11-29 21:37:18,428 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 760 transitions. [2023-11-29 21:37:18,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 760 transitions. [2023-11-29 21:37:18,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:18,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 760 transitions. [2023-11-29 21:37:18,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 84.44444444444444) internal successors, (760), 9 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-29 21:37:18,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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-29 21:37:18,432 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 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-29 21:37:18,432 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 27 predicate places. [2023-11-29 21:37:18,432 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 200 transitions, 1379 flow [2023-11-29 21:37:18,433 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 78.85714285714286) internal successors, (552), 7 states have internal predecessors, (552), 0 states have call successors, (0), 0 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-29 21:37:18,433 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:18,433 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] [2023-11-29 21:37:18,433 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 21:37:18,433 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:18,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1721964404, now seen corresponding path program 1 times [2023-11-29 21:37:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77315107] [2023-11-29 21:37:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:18,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77315107] [2023-11-29 21:37:18,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77315107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:18,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:18,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 21:37:18,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101483172] [2023-11-29 21:37:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:18,591 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:37:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:37:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 21:37:18,592 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-11-29 21:37:18,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 200 transitions, 1379 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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-29 21:37:18,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:18,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-11-29 21:37:18,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:18,845 INFO L124 PetriNetUnfolderBase]: 676/1672 cut-off events. [2023-11-29 21:37:18,845 INFO L125 PetriNetUnfolderBase]: For 4198/5325 co-relation queries the response was YES. [2023-11-29 21:37:18,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6123 conditions, 1672 events. 676/1672 cut-off events. For 4198/5325 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 11803 event pairs, 35 based on Foata normal form. 14/1518 useless extension candidates. Maximal degree in co-relation 5870. Up to 446 conditions per place. [2023-11-29 21:37:18,860 INFO L140 encePairwiseOnDemand]: 100/108 looper letters, 98 selfloop transitions, 31 changer transitions 120/321 dead transitions. [2023-11-29 21:37:18,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 321 transitions, 2937 flow [2023-11-29 21:37:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 21:37:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 21:37:18,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 657 transitions. [2023-11-29 21:37:18,862 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8690476190476191 [2023-11-29 21:37:18,862 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 657 transitions. [2023-11-29 21:37:18,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 657 transitions. [2023-11-29 21:37:18,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:18,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 657 transitions. [2023-11-29 21:37:18,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 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-29 21:37:18,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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-29 21:37:18,867 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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-29 21:37:18,869 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 33 predicate places. [2023-11-29 21:37:18,870 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 321 transitions, 2937 flow [2023-11-29 21:37:18,870 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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-29 21:37:18,870 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:18,870 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] [2023-11-29 21:37:18,870 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 21:37:18,871 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:18,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash -427814, now seen corresponding path program 2 times [2023-11-29 21:37:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:18,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239647567] [2023-11-29 21:37:18,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:19,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:19,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239647567] [2023-11-29 21:37:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239647567] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 21:37:19,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680317041] [2023-11-29 21:37:19,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:19,041 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:37:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:19,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:37:19,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 21:37:19,042 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-11-29 21:37:19,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 321 transitions, 2937 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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-29 21:37:19,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:19,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-11-29 21:37:19,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:19,399 INFO L124 PetriNetUnfolderBase]: 922/2219 cut-off events. [2023-11-29 21:37:19,399 INFO L125 PetriNetUnfolderBase]: For 7921/10163 co-relation queries the response was YES. [2023-11-29 21:37:19,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9465 conditions, 2219 events. 922/2219 cut-off events. For 7921/10163 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 16712 event pairs, 24 based on Foata normal form. 64/2073 useless extension candidates. Maximal degree in co-relation 9169. Up to 611 conditions per place. [2023-11-29 21:37:19,510 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 146 selfloop transitions, 68 changer transitions 265/551 dead transitions. [2023-11-29 21:37:19,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 551 transitions, 6285 flow [2023-11-29 21:37:19,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 21:37:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 21:37:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2023-11-29 21:37:19,512 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8637566137566137 [2023-11-29 21:37:19,512 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 653 transitions. [2023-11-29 21:37:19,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 653 transitions. [2023-11-29 21:37:19,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:19,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 653 transitions. [2023-11-29 21:37:19,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 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-29 21:37:19,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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-29 21:37:19,516 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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-29 21:37:19,516 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 39 predicate places. [2023-11-29 21:37:19,516 INFO L500 AbstractCegarLoop]: Abstraction has has 136 places, 551 transitions, 6285 flow [2023-11-29 21:37:19,517 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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-29 21:37:19,517 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:19,517 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] [2023-11-29 21:37:19,517 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 21:37:19,517 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:19,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1288679036, now seen corresponding path program 3 times [2023-11-29 21:37:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894973379] [2023-11-29 21:37:19,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894973379] [2023-11-29 21:37:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894973379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 21:37:19,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046608186] [2023-11-29 21:37:19,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:19,625 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:37:19,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:19,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:37:19,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 21:37:19,627 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-11-29 21:37:19,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 551 transitions, 6285 flow. Second operand has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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-29 21:37:19,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:19,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-11-29 21:37:19,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:20,104 INFO L124 PetriNetUnfolderBase]: 1387/3379 cut-off events. [2023-11-29 21:37:20,104 INFO L125 PetriNetUnfolderBase]: For 14026/15485 co-relation queries the response was YES. [2023-11-29 21:37:20,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14976 conditions, 3379 events. 1387/3379 cut-off events. For 14026/15485 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 28360 event pairs, 64 based on Foata normal form. 53/3111 useless extension candidates. Maximal degree in co-relation 14481. Up to 993 conditions per place. [2023-11-29 21:37:20,140 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 115 selfloop transitions, 5 changer transitions 212/571 dead transitions. [2023-11-29 21:37:20,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 571 transitions, 6965 flow [2023-11-29 21:37:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 21:37:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 21:37:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 448 transitions. [2023-11-29 21:37:20,143 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8296296296296296 [2023-11-29 21:37:20,143 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 448 transitions. [2023-11-29 21:37:20,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 448 transitions. [2023-11-29 21:37:20,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:20,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 448 transitions. [2023-11-29 21:37:20,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.6) internal successors, (448), 5 states have internal predecessors, (448), 0 states have call successors, (0), 0 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-29 21:37:20,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-29 21:37:20,146 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-29 21:37:20,147 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 43 predicate places. [2023-11-29 21:37:20,147 INFO L500 AbstractCegarLoop]: Abstraction has has 140 places, 571 transitions, 6965 flow [2023-11-29 21:37:20,147 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.4) internal successors, (437), 5 states have internal predecessors, (437), 0 states have call successors, (0), 0 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-29 21:37:20,147 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:20,148 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] [2023-11-29 21:37:20,148 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 21:37:20,148 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:20,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash -654128161, now seen corresponding path program 1 times [2023-11-29 21:37:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:20,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780967597] [2023-11-29 21:37:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:20,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:20,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780967597] [2023-11-29 21:37:20,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780967597] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:37:20,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353600840] [2023-11-29 21:37:20,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:20,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:37:20,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:37:20,316 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:37:20,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 21:37:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:20,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 21:37:20,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:37:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:20,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:37:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:20,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353600840] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:37:20,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:37:20,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2023-11-29 21:37:20,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369357380] [2023-11-29 21:37:20,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:37:20,624 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 21:37:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:20,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 21:37:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 21:37:20,625 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 108 [2023-11-29 21:37:20,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 571 transitions, 6965 flow. Second operand has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-29 21:37:20,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:20,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 108 [2023-11-29 21:37:20,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:21,463 INFO L124 PetriNetUnfolderBase]: 1720/4119 cut-off events. [2023-11-29 21:37:21,463 INFO L125 PetriNetUnfolderBase]: For 20581/24364 co-relation queries the response was YES. [2023-11-29 21:37:21,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20761 conditions, 4119 events. 1720/4119 cut-off events. For 20581/24364 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 35595 event pairs, 27 based on Foata normal form. 75/3875 useless extension candidates. Maximal degree in co-relation 20271. Up to 1165 conditions per place. [2023-11-29 21:37:21,515 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 227 selfloop transitions, 64 changer transitions 377/785 dead transitions. [2023-11-29 21:37:21,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 785 transitions, 11156 flow [2023-11-29 21:37:21,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 21:37:21,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 21:37:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 569 transitions. [2023-11-29 21:37:21,517 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8780864197530864 [2023-11-29 21:37:21,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 569 transitions. [2023-11-29 21:37:21,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 569 transitions. [2023-11-29 21:37:21,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:21,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 569 transitions. [2023-11-29 21:37:21,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 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-29 21:37:21,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:21,521 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:21,521 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 48 predicate places. [2023-11-29 21:37:21,522 INFO L500 AbstractCegarLoop]: Abstraction has has 145 places, 785 transitions, 11156 flow [2023-11-29 21:37:21,522 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 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-29 21:37:21,522 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:21,522 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] [2023-11-29 21:37:21,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 21:37:21,728 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:37:21,728 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:21,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:21,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1010557215, now seen corresponding path program 2 times [2023-11-29 21:37:21,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:21,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17018945] [2023-11-29 21:37:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:21,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:21,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:21,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17018945] [2023-11-29 21:37:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17018945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 21:37:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122957402] [2023-11-29 21:37:21,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:21,858 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:37:21,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:21,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:37:21,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 21:37:21,859 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-11-29 21:37:21,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 785 transitions, 11156 flow. Second operand has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 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-29 21:37:21,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:21,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-11-29 21:37:21,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:22,873 INFO L124 PetriNetUnfolderBase]: 2577/5851 cut-off events. [2023-11-29 21:37:22,873 INFO L125 PetriNetUnfolderBase]: For 50636/52965 co-relation queries the response was YES. [2023-11-29 21:37:22,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32506 conditions, 5851 events. 2577/5851 cut-off events. For 50636/52965 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 52520 event pairs, 90 based on Foata normal form. 15/5353 useless extension candidates. Maximal degree in co-relation 31951. Up to 1726 conditions per place. [2023-11-29 21:37:22,935 INFO L140 encePairwiseOnDemand]: 102/108 looper letters, 233 selfloop transitions, 5 changer transitions 278/878 dead transitions. [2023-11-29 21:37:22,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 878 transitions, 13591 flow [2023-11-29 21:37:22,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 21:37:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 21:37:22,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2023-11-29 21:37:22,937 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8314814814814815 [2023-11-29 21:37:22,937 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 449 transitions. [2023-11-29 21:37:22,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 449 transitions. [2023-11-29 21:37:22,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:22,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 449 transitions. [2023-11-29 21:37:22,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 89.8) internal successors, (449), 5 states have internal predecessors, (449), 0 states have call successors, (0), 0 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-29 21:37:22,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-29 21:37:22,940 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 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-29 21:37:22,941 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 52 predicate places. [2023-11-29 21:37:22,941 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 878 transitions, 13591 flow [2023-11-29 21:37:22,941 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.2) internal successors, (436), 5 states have internal predecessors, (436), 0 states have call successors, (0), 0 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-29 21:37:22,941 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:22,941 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:37:22,942 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 21:37:22,942 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:22,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1881511676, now seen corresponding path program 1 times [2023-11-29 21:37:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:22,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090474449] [2023-11-29 21:37:22,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:22,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:22,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:23,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:23,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090474449] [2023-11-29 21:37:23,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090474449] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:37:23,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670265589] [2023-11-29 21:37:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:23,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:37:23,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:37:23,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:37:23,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 21:37:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:23,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 21:37:23,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:37:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:23,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:37:23,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:23,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670265589] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:37:23,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:37:23,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2023-11-29 21:37:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218760711] [2023-11-29 21:37:23,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:37:23,494 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 21:37:23,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:23,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 21:37:23,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-29 21:37:23,497 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2023-11-29 21:37:23,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 878 transitions, 13591 flow. Second operand has 14 states, 14 states have (on average 78.92857142857143) internal successors, (1105), 14 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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-29 21:37:23,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:23,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2023-11-29 21:37:23,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:25,646 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][1264], [130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 692#true, 36#L81true, 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 194#true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:25,646 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-29 21:37:25,646 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:25,647 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-29 21:37:25,647 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:25,791 INFO L124 PetriNetUnfolderBase]: 4831/10841 cut-off events. [2023-11-29 21:37:25,791 INFO L125 PetriNetUnfolderBase]: For 116002/119471 co-relation queries the response was YES. [2023-11-29 21:37:25,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67344 conditions, 10841 events. 4831/10841 cut-off events. For 116002/119471 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 105540 event pairs, 196 based on Foata normal form. 95/9935 useless extension candidates. Maximal degree in co-relation 64765. Up to 4094 conditions per place. [2023-11-29 21:37:25,923 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 765 selfloop transitions, 451 changer transitions 525/1870 dead transitions. [2023-11-29 21:37:25,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 1870 transitions, 33817 flow [2023-11-29 21:37:25,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 21:37:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-29 21:37:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2076 transitions. [2023-11-29 21:37:25,928 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7688888888888888 [2023-11-29 21:37:25,928 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2076 transitions. [2023-11-29 21:37:25,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2076 transitions. [2023-11-29 21:37:25,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:25,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2076 transitions. [2023-11-29 21:37:25,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 83.04) internal successors, (2076), 25 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-29 21:37:25,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 108.0) internal successors, (2808), 26 states have internal predecessors, (2808), 0 states have call successors, (0), 0 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-29 21:37:25,938 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 108.0) internal successors, (2808), 26 states have internal predecessors, (2808), 0 states have call successors, (0), 0 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-29 21:37:25,939 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 76 predicate places. [2023-11-29 21:37:25,939 INFO L500 AbstractCegarLoop]: Abstraction has has 173 places, 1870 transitions, 33817 flow [2023-11-29 21:37:25,940 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.92857142857143) internal successors, (1105), 14 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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-29 21:37:25,940 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:25,940 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:37:25,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 21:37:26,145 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 21:37:26,146 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:26,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:26,146 INFO L85 PathProgramCache]: Analyzing trace with hash 881720162, now seen corresponding path program 2 times [2023-11-29 21:37:26,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:26,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742562675] [2023-11-29 21:37:26,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:26,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 21:37:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742562675] [2023-11-29 21:37:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742562675] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:26,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:26,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 21:37:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777434285] [2023-11-29 21:37:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:26,468 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:37:26,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:26,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:37:26,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 21:37:26,469 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-11-29 21:37:26,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 1870 transitions, 33817 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-29 21:37:26,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:26,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-11-29 21:37:26,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:27,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][567], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:27,502 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2023-11-29 21:37:27,502 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:27,502 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:27,502 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:27,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][568], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:27,725 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-11-29 21:37:27,726 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 21:37:27,726 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 21:37:27,726 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:28,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1272], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:28,708 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:28,708 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:28,708 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:28,708 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:29,083 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][1488], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 194#true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:29,083 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-29 21:37:29,083 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:29,083 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:29,083 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:29,605 INFO L124 PetriNetUnfolderBase]: 6077/13636 cut-off events. [2023-11-29 21:37:29,606 INFO L125 PetriNetUnfolderBase]: For 181746/185337 co-relation queries the response was YES. [2023-11-29 21:37:29,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92566 conditions, 13636 events. 6077/13636 cut-off events. For 181746/185337 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 138740 event pairs, 323 based on Foata normal form. 126/12487 useless extension candidates. Maximal degree in co-relation 88876. Up to 5186 conditions per place. [2023-11-29 21:37:29,780 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 1233 selfloop transitions, 233 changer transitions 660/2243 dead transitions. [2023-11-29 21:37:29,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 2243 transitions, 45515 flow [2023-11-29 21:37:29,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 21:37:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 21:37:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions. [2023-11-29 21:37:29,783 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8672839506172839 [2023-11-29 21:37:29,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 562 transitions. [2023-11-29 21:37:29,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions. [2023-11-29 21:37:29,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:29,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions. [2023-11-29 21:37:29,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 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-29 21:37:29,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:29,786 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:29,786 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 81 predicate places. [2023-11-29 21:37:29,786 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 2243 transitions, 45515 flow [2023-11-29 21:37:29,787 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-29 21:37:29,787 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:29,787 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:37:29,787 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 21:37:29,787 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:29,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -822317636, now seen corresponding path program 3 times [2023-11-29 21:37:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864878454] [2023-11-29 21:37:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:29,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864878454] [2023-11-29 21:37:29,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864878454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:37:29,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206455687] [2023-11-29 21:37:29,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 21:37:29,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:37:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:37:29,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:37:30,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 21:37:30,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 21:37:30,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:37:30,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 21:37:30,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:37:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:30,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:37:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:30,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206455687] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 21:37:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 21:37:30,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2023-11-29 21:37:30,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452590269] [2023-11-29 21:37:30,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:30,289 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:37:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:37:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 21:37:30,290 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-11-29 21:37:30,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 2243 transitions, 45515 flow. Second operand has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:30,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:30,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-11-29 21:37:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:31,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][593], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:31,707 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:37:31,707 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:31,707 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:31,707 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:32,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1510], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:32,699 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:32,699 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:32,699 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:32,699 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:32,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1123], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:32,773 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:32,774 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:32,774 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:32,774 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:33,099 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1510], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:33,100 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:33,100 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:33,100 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:33,100 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:33,100 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:33,764 INFO L124 PetriNetUnfolderBase]: 6902/15403 cut-off events. [2023-11-29 21:37:33,765 INFO L125 PetriNetUnfolderBase]: For 240554/247086 co-relation queries the response was YES. [2023-11-29 21:37:33,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114466 conditions, 15403 events. 6902/15403 cut-off events. For 240554/247086 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 158730 event pairs, 278 based on Foata normal form. 242/14274 useless extension candidates. Maximal degree in co-relation 113185. Up to 5910 conditions per place. [2023-11-29 21:37:33,954 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 1376 selfloop transitions, 567 changer transitions 831/2891 dead transitions. [2023-11-29 21:37:33,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 2891 transitions, 64043 flow [2023-11-29 21:37:33,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 21:37:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 21:37:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 654 transitions. [2023-11-29 21:37:33,956 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2023-11-29 21:37:33,956 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 654 transitions. [2023-11-29 21:37:33,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 654 transitions. [2023-11-29 21:37:33,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:33,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 654 transitions. [2023-11-29 21:37:33,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 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-29 21:37:33,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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-29 21:37:33,959 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 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-29 21:37:33,960 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 87 predicate places. [2023-11-29 21:37:33,960 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 2891 transitions, 64043 flow [2023-11-29 21:37:33,960 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:33,960 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:33,960 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:37:33,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 21:37:34,165 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:37:34,166 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:34,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1749036126, now seen corresponding path program 4 times [2023-11-29 21:37:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116011495] [2023-11-29 21:37:34,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:34,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 21:37:34,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:34,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116011495] [2023-11-29 21:37:34,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116011495] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:34,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:34,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 21:37:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054301078] [2023-11-29 21:37:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:34,302 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 21:37:34,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 21:37:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 21:37:34,303 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-11-29 21:37:34,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 2891 transitions, 64043 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-29 21:37:34,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:34,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-11-29 21:37:34,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:35,610 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][599], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:35,610 INFO L294 olderBase$Statistics]: this new event has 66 ancestors and is cut-off event [2023-11-29 21:37:35,610 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:35,610 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:35,610 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:35,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][598], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:35,848 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-11-29 21:37:35,848 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 21:37:35,848 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 21:37:35,848 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:37,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1528], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:37,531 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:37,531 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:37,531 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:37,531 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:38,085 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1528], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:38,086 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:38,086 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:38,086 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:38,086 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:38,086 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:38,916 INFO L124 PetriNetUnfolderBase]: 6830/15284 cut-off events. [2023-11-29 21:37:38,916 INFO L125 PetriNetUnfolderBase]: For 281783/286727 co-relation queries the response was YES. [2023-11-29 21:37:38,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122588 conditions, 15284 events. 6830/15284 cut-off events. For 281783/286727 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 157411 event pairs, 269 based on Foata normal form. 173/14114 useless extension candidates. Maximal degree in co-relation 117814. Up to 5954 conditions per place. [2023-11-29 21:37:39,076 INFO L140 encePairwiseOnDemand]: 99/108 looper letters, 1789 selfloop transitions, 169 changer transitions 852/2927 dead transitions. [2023-11-29 21:37:39,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 2927 transitions, 70588 flow [2023-11-29 21:37:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 21:37:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 21:37:39,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 554 transitions. [2023-11-29 21:37:39,078 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8549382716049383 [2023-11-29 21:37:39,078 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 554 transitions. [2023-11-29 21:37:39,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 554 transitions. [2023-11-29 21:37:39,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:39,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 554 transitions. [2023-11-29 21:37:39,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 92.33333333333333) internal successors, (554), 6 states have internal predecessors, (554), 0 states have call successors, (0), 0 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-29 21:37:39,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:39,081 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:39,082 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 92 predicate places. [2023-11-29 21:37:39,082 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 2927 transitions, 70588 flow [2023-11-29 21:37:39,082 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 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-29 21:37:39,082 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:39,082 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:37:39,082 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 21:37:39,082 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:39,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1997579234, now seen corresponding path program 5 times [2023-11-29 21:37:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:39,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532663443] [2023-11-29 21:37:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:39,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:39,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532663443] [2023-11-29 21:37:39,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532663443] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:37:39,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680814149] [2023-11-29 21:37:39,238 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 21:37:39,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:37:39,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:37:39,239 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:37:39,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 21:37:39,321 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 21:37:39,321 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:37:39,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 21:37:39,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:37:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:39,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:37:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:39,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680814149] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:37:39,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:37:39,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2023-11-29 21:37:39,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502430] [2023-11-29 21:37:39,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:37:39,434 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 21:37:39,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:39,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 21:37:39,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 21:37:39,436 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 108 [2023-11-29 21:37:39,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 2927 transitions, 70588 flow. Second operand has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:39,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:39,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 108 [2023-11-29 21:37:39,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:40,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][596], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:40,889 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-11-29 21:37:40,889 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 21:37:40,889 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:40,889 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 21:37:42,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1574], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:42,797 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:42,797 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:42,797 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:42,797 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:43,534 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1574], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:43,534 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:43,534 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:43,534 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:43,534 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:43,534 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:44,395 INFO L124 PetriNetUnfolderBase]: 6826/15196 cut-off events. [2023-11-29 21:37:44,395 INFO L125 PetriNetUnfolderBase]: For 325713/331642 co-relation queries the response was YES. [2023-11-29 21:37:44,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131442 conditions, 15196 events. 6826/15196 cut-off events. For 325713/331642 co-relation queries the response was YES. Maximal size of possible extension queue 895. Compared 155957 event pairs, 261 based on Foata normal form. 203/14157 useless extension candidates. Maximal degree in co-relation 126436. Up to 6014 conditions per place. [2023-11-29 21:37:44,726 INFO L140 encePairwiseOnDemand]: 97/108 looper letters, 1650 selfloop transitions, 420 changer transitions 886/3073 dead transitions. [2023-11-29 21:37:44,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 3073 transitions, 79368 flow [2023-11-29 21:37:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 21:37:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 21:37:44,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1095 transitions. [2023-11-29 21:37:44,728 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2023-11-29 21:37:44,728 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1095 transitions. [2023-11-29 21:37:44,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1095 transitions. [2023-11-29 21:37:44,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:44,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1095 transitions. [2023-11-29 21:37:44,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.25) internal successors, (1095), 12 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-29 21:37:44,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 108.0) internal successors, (1404), 13 states have internal predecessors, (1404), 0 states have call successors, (0), 0 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-29 21:37:44,733 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 108.0) internal successors, (1404), 13 states have internal predecessors, (1404), 0 states have call successors, (0), 0 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-29 21:37:44,733 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 103 predicate places. [2023-11-29 21:37:44,734 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 3073 transitions, 79368 flow [2023-11-29 21:37:44,734 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.66666666666667) internal successors, (789), 9 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:37:44,734 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:44,734 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:37:44,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 21:37:44,939 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:37:44,939 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:44,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash -67874304, now seen corresponding path program 1 times [2023-11-29 21:37:44,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:44,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415346459] [2023-11-29 21:37:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:44,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:45,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415346459] [2023-11-29 21:37:45,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415346459] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:37:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321581712] [2023-11-29 21:37:45,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:45,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:37:45,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:37:45,148 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:37:45,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 21:37:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:45,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 21:37:45,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:37:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:45,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:37:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:37:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321581712] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:37:45,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:37:45,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2023-11-29 21:37:45,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60874251] [2023-11-29 21:37:45,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:37:45,408 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 21:37:45,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:45,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 21:37:45,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-11-29 21:37:45,409 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 108 [2023-11-29 21:37:45,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 3073 transitions, 79368 flow. Second operand has 14 states, 14 states have (on average 78.92857142857143) internal successors, (1105), 14 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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-29 21:37:45,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:45,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 108 [2023-11-29 21:37:45,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:47,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][692], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:47,295 INFO L294 olderBase$Statistics]: this new event has 68 ancestors and is cut-off event [2023-11-29 21:37:47,296 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:47,296 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 21:37:47,296 INFO L297 olderBase$Statistics]: existing Event has 63 ancestors and is cut-off event [2023-11-29 21:37:47,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][692], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:47,845 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:37:47,845 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:47,846 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:47,846 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:47,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][694], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2023-11-29 21:37:47,846 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:37:47,846 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:47,846 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:47,846 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:48,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1525], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:48,515 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2023-11-29 21:37:48,515 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:48,515 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:48,515 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:50,285 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1525], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:50,286 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:50,286 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:50,286 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:50,286 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:50,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2199], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:50,286 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:37:50,286 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:50,286 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:50,286 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:51,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2751], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:51,305 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-29 21:37:51,305 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:51,305 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:51,305 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:52,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][3022], [130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 1789#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0)))), 114#true, 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 190#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1806#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 169#true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 1261#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 45#L54true]) [2023-11-29 21:37:52,765 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-29 21:37:52,765 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-29 21:37:52,765 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-29 21:37:52,765 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:53,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2751], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:53,021 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:37:53,021 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,021 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,021 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2748], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:53,330 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:37:53,330 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,330 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,330 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2749], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:53,330 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:37:53,330 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,330 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,330 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][426], [139#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 1793#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), 114#true, 1789#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0)))), 2321#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1262#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 2860#(and (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 692#true, 190#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 151#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 36#L81true, 43#$Ultimate##0true, thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 689#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 175#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:53,583 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:37:53,583 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:37:53,583 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:53,583 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:53,958 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2751], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:53,958 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:37:53,958 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,958 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,958 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:37:53,958 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 21:37:54,040 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1525], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true]) [2023-11-29 21:37:54,040 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-29 21:37:54,040 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:54,040 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:54,040 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:54,040 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:37:54,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][2654], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 2882#(and (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 194#true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:37:54,041 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-29 21:37:54,041 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:54,041 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:54,041 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:37:54,760 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2202], [130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 1793#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), 114#true, 1789#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (or (= (mod thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (not (= (* 256 (div ~v_assert~0 256)) ~v_assert~0)))), 2321#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 692#true, 2874#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (= thread1Thread1of1ForFork1_~lv_assert~0 1)), 190#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 689#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 175#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1261#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0)]) [2023-11-29 21:37:54,760 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-29 21:37:54,760 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-29 21:37:54,760 INFO L297 olderBase$Statistics]: existing Event has 83 ancestors and is cut-off event [2023-11-29 21:37:54,760 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-29 21:37:55,721 INFO L124 PetriNetUnfolderBase]: 13069/28136 cut-off events. [2023-11-29 21:37:55,721 INFO L125 PetriNetUnfolderBase]: For 719693/726018 co-relation queries the response was YES. [2023-11-29 21:37:55,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261758 conditions, 28136 events. 13069/28136 cut-off events. For 719693/726018 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 300588 event pairs, 349 based on Foata normal form. 161/25943 useless extension candidates. Maximal degree in co-relation 260302. Up to 12630 conditions per place. [2023-11-29 21:37:56,031 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 1358 selfloop transitions, 698 changer transitions 3324/5725 dead transitions. [2023-11-29 21:37:56,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 5725 transitions, 159799 flow [2023-11-29 21:37:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 21:37:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-29 21:37:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2055 transitions. [2023-11-29 21:37:56,035 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7611111111111111 [2023-11-29 21:37:56,035 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2055 transitions. [2023-11-29 21:37:56,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2055 transitions. [2023-11-29 21:37:56,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:37:56,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2055 transitions. [2023-11-29 21:37:56,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 82.2) internal successors, (2055), 25 states have internal predecessors, (2055), 0 states have call successors, (0), 0 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-29 21:37:56,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 108.0) internal successors, (2808), 26 states have internal predecessors, (2808), 0 states have call successors, (0), 0 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-29 21:37:56,044 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 108.0) internal successors, (2808), 26 states have internal predecessors, (2808), 0 states have call successors, (0), 0 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-29 21:37:56,044 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 127 predicate places. [2023-11-29 21:37:56,044 INFO L500 AbstractCegarLoop]: Abstraction has has 224 places, 5725 transitions, 159799 flow [2023-11-29 21:37:56,044 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.92857142857143) internal successors, (1105), 14 states have internal predecessors, (1105), 0 states have call successors, (0), 0 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-29 21:37:56,045 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:37:56,045 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:37:56,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 21:37:56,249 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 21:37:56,250 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:37:56,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:37:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash -233875890, now seen corresponding path program 6 times [2023-11-29 21:37:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:37:56,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183641762] [2023-11-29 21:37:56,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:37:56,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:37:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:37:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:37:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:37:56,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183641762] [2023-11-29 21:37:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183641762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:37:56,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:37:56,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 21:37:56,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671959115] [2023-11-29 21:37:56,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:37:56,361 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 21:37:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:37:56,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 21:37:56,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 21:37:56,362 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 108 [2023-11-29 21:37:56,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 5725 transitions, 159799 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-29 21:37:56,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:37:56,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 108 [2023-11-29 21:37:56,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:37:59,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][720], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 2886#true]) [2023-11-29 21:37:59,819 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:37:59,819 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:59,819 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:59,819 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:59,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][722], [1259#true, 130#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 2886#true]) [2023-11-29 21:37:59,820 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:37:59,820 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:59,820 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:37:59,820 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:38:01,085 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1493], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 36#L81true, thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-11-29 21:38:01,085 INFO L294 olderBase$Statistics]: this new event has 73 ancestors and is cut-off event [2023-11-29 21:38:01,085 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:38:01,085 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:38:01,085 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2023-11-29 21:38:03,601 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2151], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-11-29 21:38:03,601 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:38:03,602 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:03,602 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:03,602 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:03,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1493], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 64#L76true, 45#L54true, 2886#true]) [2023-11-29 21:38:03,602 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:38:03,602 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:03,602 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:03,602 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:05,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2622], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 36#L81true, 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-11-29 21:38:05,446 INFO L294 olderBase$Statistics]: this new event has 78 ancestors and is cut-off event [2023-11-29 21:38:05,446 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:38:05,446 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:38:05,446 INFO L297 olderBase$Statistics]: existing Event has 73 ancestors and is cut-off event [2023-11-29 21:38:08,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2618], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 2886#true]) [2023-11-29 21:38:08,803 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:38:08,803 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,803 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,803 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2620], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 2886#true]) [2023-11-29 21:38:08,804 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:38:08,804 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,804 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,804 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][3368], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-11-29 21:38:08,820 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:38:08,820 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,820 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,820 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,821 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2622], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 45#L54true, 2886#true]) [2023-11-29 21:38:08,821 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:38:08,821 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,821 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:08,821 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:10,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][3735], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 692#true, 2888#(= (* 256 (div ~d1~0 256)) ~d1~0), 36#L81true, 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 194#true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:38:10,455 INFO L294 olderBase$Statistics]: this new event has 83 ancestors and is cut-off event [2023-11-29 21:38:10,455 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-29 21:38:10,455 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-29 21:38:10,455 INFO L297 olderBase$Statistics]: existing Event has 78 ancestors and is cut-off event [2023-11-29 21:38:13,428 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][3735], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 2888#(= (* 256 (div ~d1~0 256)) ~d1~0), thread1Thread1of1ForFork1InUse, 153#true, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 194#true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:38:13,429 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-29 21:38:13,429 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 21:38:13,429 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 21:38:13,429 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 21:38:13,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([259] L52-->L54: Formula: (= (+ v_~pos~0_25 1) v_~pos~0_26) InVars {~pos~0=v_~pos~0_26} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_25} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][4332], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2654#(< 0 (mod thread1Thread1of1ForFork1_~lv_assert~0 256)), 2888#(= (* 256 (div ~d1~0 256)) ~d1~0), 153#true, thread1Thread1of1ForFork1InUse, 1791#true, thread2Thread1of1ForFork2InUse, thread3Thread1of1ForFork0InUse, 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 194#true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true]) [2023-11-29 21:38:13,429 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-29 21:38:13,429 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 21:38:13,429 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 21:38:13,429 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-11-29 21:38:18,961 INFO L124 PetriNetUnfolderBase]: 14757/32992 cut-off events. [2023-11-29 21:38:18,961 INFO L125 PetriNetUnfolderBase]: For 857179/869224 co-relation queries the response was YES. [2023-11-29 21:38:19,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311273 conditions, 32992 events. 14757/32992 cut-off events. For 857179/869224 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 365204 event pairs, 446 based on Foata normal form. 635/31725 useless extension candidates. Maximal degree in co-relation 304088. Up to 15294 conditions per place. [2023-11-29 21:38:19,471 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 1421 selfloop transitions, 5 changer transitions 2576/5507 dead transitions. [2023-11-29 21:38:19,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 5507 transitions, 160468 flow [2023-11-29 21:38:19,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 21:38:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 21:38:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 391 transitions. [2023-11-29 21:38:19,473 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9050925925925926 [2023-11-29 21:38:19,473 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 391 transitions. [2023-11-29 21:38:19,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 391 transitions. [2023-11-29 21:38:19,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:38:19,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 391 transitions. [2023-11-29 21:38:19,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 0 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-29 21:38:19,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-29 21:38:19,475 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-29 21:38:19,475 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 129 predicate places. [2023-11-29 21:38:19,475 INFO L500 AbstractCegarLoop]: Abstraction has has 226 places, 5507 transitions, 160468 flow [2023-11-29 21:38:19,475 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 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-29 21:38:19,475 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:38:19,476 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:38:19,476 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 21:38:19,476 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:38:19,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:38:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1774881479, now seen corresponding path program 2 times [2023-11-29 21:38:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:38:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413007292] [2023-11-29 21:38:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:38:19,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:38:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:38:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:38:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:38:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413007292] [2023-11-29 21:38:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413007292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:38:19,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:38:19,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 21:38:19,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115191001] [2023-11-29 21:38:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:38:19,578 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 21:38:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:38:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 21:38:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 21:38:19,579 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 108 [2023-11-29 21:38:19,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 5507 transitions, 160468 flow. Second operand has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 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-29 21:38:19,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:38:19,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 108 [2023-11-29 21:38:19,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:38:23,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][1188], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, 2893#(= (* (div ~d2~0 256) 256) ~d2~0), thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 64#L76true, 45#L54true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 2886#true]) [2023-11-29 21:38:23,268 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:38:23,268 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:38:23,268 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:38:23,268 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:38:23,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][752], [130#true, 1259#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 27#L92true, 4#L111-4true, 124#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 15#L71true, 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2891#true, 1245#(and (<= 1 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 163#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), 2886#true]) [2023-11-29 21:38:23,268 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2023-11-29 21:38:23,268 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:38:23,268 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:38:23,268 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2023-11-29 21:38:26,508 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2169], [130#true, 1259#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2894#(and (<= (div ~d2~0 256) 0) (<= 1 ~d2~0)), 2870#(and (= ~v_assert~0 1) (<= 0 ~pos~0) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), thread1Thread1of1ForFork1InUse, 153#true, thread2Thread1of1ForFork2InUse, 1791#true, thread3Thread1of1ForFork0InUse, 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 15#L71true, 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 696#(<= (+ (* (div ~d2~0 256) 256) 1) ~d2~0), 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-11-29 21:38:26,509 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2023-11-29 21:38:26,509 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:26,509 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:26,509 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2023-11-29 21:38:31,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([258] L47-->L54: Formula: (= (+ v_~pos~0_18 1) v_~pos~0_17) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][2604], [1259#true, 130#true, 1027#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 114#true, 172#(< (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1 1)), 1272#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 692#true, 153#true, thread1Thread1of1ForFork1InUse, thread2Thread1of1ForFork2InUse, 1791#true, 2893#(= (* (div ~d2~0 256) 256) ~d2~0), thread3Thread1of1ForFork0InUse, 2880#(and (<= 2 ~pos~0) (= ~v_assert~0 1) (<= 1 (mod thread1Thread1of1ForFork1_~lv_assert~0 256))), 4#L111-4true, 27#L92true, 147#(< (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread1Thread1of1ForFork1_~lv_assert~0), 185#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 2323#(and (not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))) (= thread1Thread1of1ForFork1_~lv_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 64#L76true, 198#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 206#(not (= thread2Thread1of1ForFork2_~lv_assert~1 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)))), 45#L54true, 2886#true]) [2023-11-29 21:38:31,099 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-11-29 21:38:31,099 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:31,100 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:31,100 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2023-11-29 21:38:43,502 INFO L124 PetriNetUnfolderBase]: 13871/31891 cut-off events. [2023-11-29 21:38:43,502 INFO L125 PetriNetUnfolderBase]: For 879692/890353 co-relation queries the response was YES. [2023-11-29 21:38:43,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318951 conditions, 31891 events. 13871/31891 cut-off events. For 879692/890353 co-relation queries the response was YES. Maximal size of possible extension queue 1277. Compared 353514 event pairs, 259 based on Foata normal form. 322/31186 useless extension candidates. Maximal degree in co-relation 311665. Up to 15130 conditions per place. [2023-11-29 21:38:43,809 INFO L140 encePairwiseOnDemand]: 103/108 looper letters, 1344 selfloop transitions, 5 changer transitions 3676/5882 dead transitions. [2023-11-29 21:38:43,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 5882 transitions, 180346 flow [2023-11-29 21:38:43,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 21:38:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 21:38:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 390 transitions. [2023-11-29 21:38:43,810 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2023-11-29 21:38:43,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 390 transitions. [2023-11-29 21:38:43,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 390 transitions. [2023-11-29 21:38:43,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:38:43,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 390 transitions. [2023-11-29 21:38:43,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 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-29 21:38:43,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-29 21:38:43,812 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-29 21:38:43,813 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 132 predicate places. [2023-11-29 21:38:43,813 INFO L500 AbstractCegarLoop]: Abstraction has has 229 places, 5882 transitions, 180346 flow [2023-11-29 21:38:43,813 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.75) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 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-29 21:38:43,813 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:38:43,813 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:38:43,813 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 21:38:43,814 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:38:43,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:38:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1162604154, now seen corresponding path program 1 times [2023-11-29 21:38:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:38:43,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915965723] [2023-11-29 21:38:43,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:38:43,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:38:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:38:44,087 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:38:44,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:38:44,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915965723] [2023-11-29 21:38:44,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915965723] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:38:44,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793732137] [2023-11-29 21:38:44,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:38:44,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:38:44,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:38:44,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:38:44,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 21:38:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:38:44,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 21:38:44,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:38:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:38:44,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:38:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:38:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793732137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:38:44,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:38:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2023-11-29 21:38:44,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629568632] [2023-11-29 21:38:44,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:38:44,474 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 21:38:44,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:38:44,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 21:38:44,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-29 21:38:44,476 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 108 [2023-11-29 21:38:44,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 5882 transitions, 180346 flow. Second operand has 18 states, 18 states have (on average 69.83333333333333) internal successors, (1257), 18 states have internal predecessors, (1257), 0 states have call successors, (0), 0 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-29 21:38:44,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:38:44,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 108 [2023-11-29 21:38:44,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:39:51,564 INFO L124 PetriNetUnfolderBase]: 32431/65663 cut-off events. [2023-11-29 21:39:51,564 INFO L125 PetriNetUnfolderBase]: For 1612764/1622651 co-relation queries the response was YES. [2023-11-29 21:39:51,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634175 conditions, 65663 events. 32431/65663 cut-off events. For 1612764/1622651 co-relation queries the response was YES. Maximal size of possible extension queue 1979. Compared 697542 event pairs, 2212 based on Foata normal form. 381/64294 useless extension candidates. Maximal degree in co-relation 619263. Up to 28229 conditions per place. [2023-11-29 21:39:52,285 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 2000 selfloop transitions, 396 changer transitions 7318/9851 dead transitions. [2023-11-29 21:39:52,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 9851 transitions, 317803 flow [2023-11-29 21:39:52,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 21:39:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-29 21:39:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2347 transitions. [2023-11-29 21:39:52,289 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.701015531660693 [2023-11-29 21:39:52,289 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2347 transitions. [2023-11-29 21:39:52,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2347 transitions. [2023-11-29 21:39:52,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:39:52,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2347 transitions. [2023-11-29 21:39:52,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 75.70967741935483) internal successors, (2347), 31 states have internal predecessors, (2347), 0 states have call successors, (0), 0 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-29 21:39:52,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 108.0) internal successors, (3456), 32 states have internal predecessors, (3456), 0 states have call successors, (0), 0 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-29 21:39:52,298 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 108.0) internal successors, (3456), 32 states have internal predecessors, (3456), 0 states have call successors, (0), 0 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-29 21:39:52,298 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 161 predicate places. [2023-11-29 21:39:52,298 INFO L500 AbstractCegarLoop]: Abstraction has has 258 places, 9851 transitions, 317803 flow [2023-11-29 21:39:52,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 69.83333333333333) internal successors, (1257), 18 states have internal predecessors, (1257), 0 states have call successors, (0), 0 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-29 21:39:52,299 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:39:52,299 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:39:52,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 21:39:52,503 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 21:39:52,504 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:39:52,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:39:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash -143284028, now seen corresponding path program 2 times [2023-11-29 21:39:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:39:52,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865263949] [2023-11-29 21:39:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:39:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:39:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:39:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:39:52,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:39:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865263949] [2023-11-29 21:39:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865263949] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:39:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973580620] [2023-11-29 21:39:52,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 21:39:52,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:39:52,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:39:52,807 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:39:52,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 21:39:52,912 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 21:39:52,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:39:52,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 21:39:52,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:39:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:39:53,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:39:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:39:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973580620] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:39:53,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:39:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 18 [2023-11-29 21:39:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419744207] [2023-11-29 21:39:53,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:39:53,175 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 21:39:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:39:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 21:39:53,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-29 21:39:53,177 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 108 [2023-11-29 21:39:53,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 9851 transitions, 317803 flow. Second operand has 18 states, 18 states have (on average 70.0) internal successors, (1260), 18 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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-29 21:39:53,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:39:53,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 108 [2023-11-29 21:39:53,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:44:20,763 INFO L124 PetriNetUnfolderBase]: 66592/130117 cut-off events. [2023-11-29 21:44:20,764 INFO L125 PetriNetUnfolderBase]: For 3242727/3247552 co-relation queries the response was YES. [2023-11-29 21:44:21,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1358408 conditions, 130117 events. 66592/130117 cut-off events. For 3242727/3247552 co-relation queries the response was YES. Maximal size of possible extension queue 3593. Compared 1440629 event pairs, 3257 based on Foata normal form. 172/127654 useless extension candidates. Maximal degree in co-relation 1356204. Up to 58812 conditions per place. [2023-11-29 21:44:22,400 INFO L140 encePairwiseOnDemand]: 92/108 looper letters, 3663 selfloop transitions, 453 changer transitions 14746/19044 dead transitions. [2023-11-29 21:44:22,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 19044 transitions, 638405 flow [2023-11-29 21:44:22,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-29 21:44:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-29 21:44:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2337 transitions. [2023-11-29 21:44:22,404 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6980286738351255 [2023-11-29 21:44:22,404 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2337 transitions. [2023-11-29 21:44:22,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2337 transitions. [2023-11-29 21:44:22,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:44:22,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2337 transitions. [2023-11-29 21:44:22,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 75.38709677419355) internal successors, (2337), 31 states have internal predecessors, (2337), 0 states have call successors, (0), 0 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-29 21:44:22,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 108.0) internal successors, (3456), 32 states have internal predecessors, (3456), 0 states have call successors, (0), 0 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-29 21:44:22,414 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 108.0) internal successors, (3456), 32 states have internal predecessors, (3456), 0 states have call successors, (0), 0 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-29 21:44:22,414 INFO L307 CegarLoopForPetriNet]: 97 programPoint places, 190 predicate places. [2023-11-29 21:44:22,414 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 19044 transitions, 638405 flow [2023-11-29 21:44:22,415 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 70.0) internal successors, (1260), 18 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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-29 21:44:22,415 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:44:22,415 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 21:44:22,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 21:44:22,621 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:44:22,621 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 21:44:22,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:44:22,621 INFO L85 PathProgramCache]: Analyzing trace with hash -693565786, now seen corresponding path program 3 times [2023-11-29 21:44:22,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:44:22,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105854254] [2023-11-29 21:44:22,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:44:22,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:44:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:44:22,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:44:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:44:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105854254] [2023-11-29 21:44:22,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105854254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:44:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601793623] [2023-11-29 21:44:22,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 21:44:22,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:44:22,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:44:22,902 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:44:22,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 21:44:23,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 21:44:23,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:44:23,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 21:44:23,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:44:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:44:23,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:44:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:44:23,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601793623] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:44:23,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:44:23,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 19 [2023-11-29 21:44:23,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855657460] [2023-11-29 21:44:23,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:44:23,269 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 21:44:23,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:44:23,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 21:44:23,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-11-29 21:44:23,271 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 108 [2023-11-29 21:44:23,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 19044 transitions, 638405 flow. Second operand has 19 states, 19 states have (on average 69.84210526315789) internal successors, (1327), 19 states have internal predecessors, (1327), 0 states have call successors, (0), 0 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-29 21:44:23,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:44:23,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 108 [2023-11-29 21:44:23,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-29 21:50:35,617 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 21:50:35,617 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 21:50:36,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-11-29 21:50:36,063 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-29 21:50:36,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 21:50:36,269 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:50:36,269 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 66/108 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 758976 conditions, 66851 events (34684/66850 cut-off events. For 1835256/1887567 co-relation queries the response was YES. Maximal size of possible extension queue 4108. Compared 766629 event pairs, 957 based on Foata normal form. 511/69051 useless extension candidates. Maximal degree in co-relation 758739. Up to 27442 conditions per place.). [2023-11-29 21:50:36,271 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-29 21:50:36,271 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-29 21:50:36,271 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-29 21:50:36,272 INFO L457 BasicCegarLoop]: Path program histogram: [6, 4, 3, 3, 2, 2] [2023-11-29 21:50:36,275 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 21:50:36,276 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 21:50:36,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:50:36 BasicIcfg [2023-11-29 21:50:36,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 21:50:36,280 INFO L158 Benchmark]: Toolchain (without parser) took 801541.83ms. Allocated memory was 360.7MB in the beginning and 7.9GB in the end (delta: 7.6GB). Free memory was 311.6MB in the beginning and 4.4GB in the end (delta: -4.1GB). Peak memory consumption was 5.1GB. Max. memory is 16.0GB. [2023-11-29 21:50:36,280 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 306.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 21:50:36,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.13ms. Allocated memory is still 360.7MB. Free memory was 311.5MB in the beginning and 299.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 21:50:36,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.61ms. Allocated memory is still 360.7MB. Free memory was 299.9MB in the beginning and 298.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:50:36,280 INFO L158 Benchmark]: Boogie Preprocessor took 36.25ms. Allocated memory is still 360.7MB. Free memory was 298.2MB in the beginning and 296.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 21:50:36,281 INFO L158 Benchmark]: RCFGBuilder took 384.34ms. Allocated memory is still 360.7MB. Free memory was 296.8MB in the beginning and 281.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-11-29 21:50:36,281 INFO L158 Benchmark]: TraceAbstraction took 800889.58ms. Allocated memory was 360.7MB in the beginning and 7.9GB in the end (delta: 7.6GB). Free memory was 280.7MB in the beginning and 4.4GB in the end (delta: -4.1GB). Peak memory consumption was 5.1GB. Max. memory is 16.0GB. [2023-11-29 21:50:36,282 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 306.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 198.13ms. Allocated memory is still 360.7MB. Free memory was 311.5MB in the beginning and 299.9MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 28.61ms. Allocated memory is still 360.7MB. Free memory was 299.9MB in the beginning and 298.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.25ms. Allocated memory is still 360.7MB. Free memory was 298.2MB in the beginning and 296.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 384.34ms. Allocated memory is still 360.7MB. Free memory was 296.8MB in the beginning and 281.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 800889.58ms. Allocated memory was 360.7MB in the beginning and 7.9GB in the end (delta: 7.6GB). Free memory was 280.7MB in the beginning and 4.4GB in the end (delta: -4.1GB). Peak memory consumption was 5.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 66/108 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 758976 conditions, 66851 events (34684/66850 cut-off events. For 1835256/1887567 co-relation queries the response was YES. Maximal size of possible extension queue 4108. Compared 766629 event pairs, 957 based on Foata normal form. 511/69051 useless extension candidates. Maximal degree in co-relation 758739. Up to 27442 conditions per place.). - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 66/108 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 758976 conditions, 66851 events (34684/66850 cut-off events. For 1835256/1887567 co-relation queries the response was YES. Maximal size of possible extension queue 4108. Compared 766629 event pairs, 957 based on Foata normal form. 511/69051 useless extension candidates. Maximal degree in co-relation 758739. Up to 27442 conditions per place.). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 66/108 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 758976 conditions, 66851 events (34684/66850 cut-off events. For 1835256/1887567 co-relation queries the response was YES. Maximal size of possible extension queue 4108. Compared 766629 event pairs, 957 based on Foata normal form. 511/69051 useless extension candidates. Maximal degree in co-relation 758739. Up to 27442 conditions per place.). - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 66/108 universal loopers) in iteration 20,while PetriNetUnfolder was constructing finite prefix that currently has 758976 conditions, 66851 events (34684/66850 cut-off events. For 1835256/1887567 co-relation queries the response was YES. Maximal size of possible extension queue 4108. Compared 766629 event pairs, 957 based on Foata normal form. 511/69051 useless extension candidates. Maximal degree in co-relation 758739. Up to 27442 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 132 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 800.8s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 791.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1704 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1704 mSDsluCounter, 1785 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1391 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5319 IncrementalHoareTripleChecker+Invalid, 5494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 394 mSDtfsCounter, 5319 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1696 GetRequests, 1395 SyntacticMatches, 29 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=638405occurred in iteration=19, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2408 NumberOfCodeBlocks, 2408 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3085 ConstructedInterpolants, 0 QuantifiedInterpolants, 9190 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1891 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 36 InterpolantComputations, 13 PerfectInterpolantSequences, 153/231 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown