/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/test-easy10.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:36:13,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:36:13,955 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:36:13,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:36:13,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:36:13,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:36:13,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:36:13,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:36:13,991 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:36:13,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:36:13,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:36:13,995 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:36:13,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:36:13,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:36:13,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:36:13,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:36:13,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:36:13,997 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:36:13,997 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:36:13,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:36:13,998 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:36:13,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:36:13,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:36:13,999 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:36:13,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:36:13,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:36:13,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:36:14,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:36:14,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:36:14,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:36:14,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:36:14,001 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:36:14,001 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:36:14,001 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-12-09 15:36:14,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:36:14,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:36:14,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:36:14,273 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:36:14,274 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:36:14,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy10.wvr.c [2023-12-09 15:36:15,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:36:15,631 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:36:15,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy10.wvr.c [2023-12-09 15:36:15,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1d0819c/023d73fee1d44b1683f94592c67ce59d/FLAGa992bee9a [2023-12-09 15:36:15,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d1d0819c/023d73fee1d44b1683f94592c67ce59d [2023-12-09 15:36:15,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:36:15,659 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:36:15,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:36:15,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:36:15,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:36:15,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674a7397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15, skipping insertion in model container [2023-12-09 15:36:15,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,695 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:36:15,826 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/test-easy10.wvr.c[3959,3972] [2023-12-09 15:36:15,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:36:15,844 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:36:15,866 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/test-easy10.wvr.c[3959,3972] [2023-12-09 15:36:15,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:36:15,876 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:36:15,876 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:36:15,882 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:36:15,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15 WrapperNode [2023-12-09 15:36:15,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:36:15,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:36:15,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:36:15,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:36:15,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,929 INFO L138 Inliner]: procedures = 23, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2023-12-09 15:36:15,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:36:15,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:36:15,931 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:36:15,931 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:36:15,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,961 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,964 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:36:15,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:36:15,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:36:15,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:36:15,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (1/1) ... [2023-12-09 15:36:15,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:36:15,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:36:15,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:36:16,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:36:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:36:16,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:36:16,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:36:16,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:36:16,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:36:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:36:16,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:36:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-12-09 15:36:16,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-12-09 15:36:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:36:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:36:16,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:36:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:36:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:36:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:36:16,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:36:16,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:36:16,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:36:16,042 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:36:16,173 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:36:16,175 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:36:16,487 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:36:16,566 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:36:16,566 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-09 15:36:16,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:36:16 BoogieIcfgContainer [2023-12-09 15:36:16,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:36:16,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:36:16,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:36:16,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:36:16,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:36:15" (1/3) ... [2023-12-09 15:36:16,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60a7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:36:16, skipping insertion in model container [2023-12-09 15:36:16,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:15" (2/3) ... [2023-12-09 15:36:16,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c60a7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:36:16, skipping insertion in model container [2023-12-09 15:36:16,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:36:16" (3/3) ... [2023-12-09 15:36:16,575 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy10.wvr.c [2023-12-09 15:36:16,595 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:36:16,595 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:36:16,596 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:36:16,669 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-09 15:36:16,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 312 flow [2023-12-09 15:36:16,754 INFO L124 PetriNetUnfolderBase]: 2/138 cut-off events. [2023-12-09 15:36:16,754 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-09 15:36:16,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 138 events. 2/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-12-09 15:36:16,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 312 flow [2023-12-09 15:36:16,765 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 274 flow [2023-12-09 15:36:16,786 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:36:16,794 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;@761160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:36:16,794 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 15:36:16,849 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:36:16,850 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-12-09 15:36:16,850 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-12-09 15:36:16,850 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:16,851 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:16,851 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 2 more)] === [2023-12-09 15:36:16,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1486439484, now seen corresponding path program 1 times [2023-12-09 15:36:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:16,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565364139] [2023-12-09 15:36:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:17,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:17,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:17,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565364139] [2023-12-09 15:36:17,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565364139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:17,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:17,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:36:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519901408] [2023-12-09 15:36:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:17,491 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:36:17,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:17,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:36:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:36:17,526 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 142 [2023-12-09 15:36:17,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:17,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:17,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 142 [2023-12-09 15:36:17,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:17,670 INFO L124 PetriNetUnfolderBase]: 51/325 cut-off events. [2023-12-09 15:36:17,670 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-12-09 15:36:17,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 325 events. 51/325 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1123 event pairs, 19 based on Foata normal form. 13/330 useless extension candidates. Maximal degree in co-relation 330. Up to 72 conditions per place. [2023-12-09 15:36:17,678 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 16 selfloop transitions, 2 changer transitions 2/127 dead transitions. [2023-12-09 15:36:17,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 127 transitions, 320 flow [2023-12-09 15:36:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:36:17,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:36:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-12-09 15:36:17,697 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9295774647887324 [2023-12-09 15:36:17,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-12-09 15:36:17,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-12-09 15:36:17,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:17,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-12-09 15:36:17,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:17,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:17,716 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:17,720 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2023-12-09 15:36:17,720 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 320 flow [2023-12-09 15:36:17,721 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:17,721 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:17,721 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:17,722 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:36:17,722 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 2 more)] === [2023-12-09 15:36:17,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1638622048, now seen corresponding path program 2 times [2023-12-09 15:36:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288115] [2023-12-09 15:36:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:20,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288115] [2023-12-09 15:36:20,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:20,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:20,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:36:20,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052759679] [2023-12-09 15:36:20,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:20,657 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:36:20,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:20,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:36:20,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:36:20,661 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:36:20,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 320 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:20,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:20,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:36:20,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:24,106 INFO L124 PetriNetUnfolderBase]: 5910/11931 cut-off events. [2023-12-09 15:36:24,106 INFO L125 PetriNetUnfolderBase]: For 5986/6075 co-relation queries the response was YES. [2023-12-09 15:36:24,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24865 conditions, 11931 events. 5910/11931 cut-off events. For 5986/6075 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 104274 event pairs, 1677 based on Foata normal form. 3/11861 useless extension candidates. Maximal degree in co-relation 24015. Up to 2840 conditions per place. [2023-12-09 15:36:24,201 INFO L140 encePairwiseOnDemand]: 120/142 looper letters, 251 selfloop transitions, 20 changer transitions 22/362 dead transitions. [2023-12-09 15:36:24,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 362 transitions, 1738 flow [2023-12-09 15:36:24,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-09 15:36:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-12-09 15:36:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2393 transitions. [2023-12-09 15:36:24,248 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6740845070422535 [2023-12-09 15:36:24,248 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2393 transitions. [2023-12-09 15:36:24,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2393 transitions. [2023-12-09 15:36:24,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:24,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2393 transitions. [2023-12-09 15:36:24,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 95.72) internal successors, (2393), 25 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:24,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 142.0) internal successors, (3692), 26 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:24,268 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 142.0) internal successors, (3692), 26 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:24,268 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 26 predicate places. [2023-12-09 15:36:24,269 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 362 transitions, 1738 flow [2023-12-09 15:36:24,269 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:24,270 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:24,270 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:24,270 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:36:24,270 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 2 more)] === [2023-12-09 15:36:24,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:24,271 INFO L85 PathProgramCache]: Analyzing trace with hash -745528944, now seen corresponding path program 3 times [2023-12-09 15:36:24,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:24,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147782044] [2023-12-09 15:36:24,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:24,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:24,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:24,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147782044] [2023-12-09 15:36:24,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147782044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:24,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:24,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:36:24,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436504235] [2023-12-09 15:36:24,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:24,450 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:36:24,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:36:24,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:36:24,459 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 142 [2023-12-09 15:36:24,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 362 transitions, 1738 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:24,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:24,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 142 [2023-12-09 15:36:24,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:25,660 INFO L124 PetriNetUnfolderBase]: 5345/10980 cut-off events. [2023-12-09 15:36:25,661 INFO L125 PetriNetUnfolderBase]: For 11522/11703 co-relation queries the response was YES. [2023-12-09 15:36:25,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25686 conditions, 10980 events. 5345/10980 cut-off events. For 11522/11703 co-relation queries the response was YES. Maximal size of possible extension queue 480. Compared 94648 event pairs, 1190 based on Foata normal form. 257/11182 useless extension candidates. Maximal degree in co-relation 24809. Up to 2684 conditions per place. [2023-12-09 15:36:25,738 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 114 selfloop transitions, 2 changer transitions 22/372 dead transitions. [2023-12-09 15:36:25,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 372 transitions, 2065 flow [2023-12-09 15:36:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:36:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:36:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-12-09 15:36:25,740 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9248826291079812 [2023-12-09 15:36:25,740 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-12-09 15:36:25,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-12-09 15:36:25,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:25,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-12-09 15:36:25,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:25,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:25,742 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:25,743 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 28 predicate places. [2023-12-09 15:36:25,743 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 372 transitions, 2065 flow [2023-12-09 15:36:25,743 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:25,743 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:25,743 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:25,744 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:36:25,744 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 2 more)] === [2023-12-09 15:36:25,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1673141144, now seen corresponding path program 4 times [2023-12-09 15:36:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:25,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185008961] [2023-12-09 15:36:25,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:25,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:25,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:25,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185008961] [2023-12-09 15:36:25,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185008961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:25,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:25,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:36:25,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440599809] [2023-12-09 15:36:25,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:25,869 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:36:25,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:25,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:36:25,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:36:25,870 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 142 [2023-12-09 15:36:25,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 372 transitions, 2065 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:25,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:25,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 142 [2023-12-09 15:36:25,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:26,962 INFO L124 PetriNetUnfolderBase]: 4726/9827 cut-off events. [2023-12-09 15:36:26,963 INFO L125 PetriNetUnfolderBase]: For 19704/20103 co-relation queries the response was YES. [2023-12-09 15:36:26,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26062 conditions, 9827 events. 4726/9827 cut-off events. For 19704/20103 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 83581 event pairs, 1019 based on Foata normal form. 285/10033 useless extension candidates. Maximal degree in co-relation 23825. Up to 2476 conditions per place. [2023-12-09 15:36:27,049 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 137 selfloop transitions, 2 changer transitions 22/391 dead transitions. [2023-12-09 15:36:27,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 391 transitions, 2560 flow [2023-12-09 15:36:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:36:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:36:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-12-09 15:36:27,051 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9272300469483568 [2023-12-09 15:36:27,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-12-09 15:36:27,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-12-09 15:36:27,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:27,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-12-09 15:36:27,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:27,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:27,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:27,056 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 30 predicate places. [2023-12-09 15:36:27,056 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 391 transitions, 2560 flow [2023-12-09 15:36:27,057 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:27,057 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:27,057 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:27,057 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:36:27,057 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 2 more)] === [2023-12-09 15:36:27,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:27,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1968707610, now seen corresponding path program 5 times [2023-12-09 15:36:27,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:27,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056006574] [2023-12-09 15:36:27,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:27,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056006574] [2023-12-09 15:36:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056006574] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:27,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:27,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:36:27,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217714003] [2023-12-09 15:36:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:27,218 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:36:27,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:36:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:36:27,220 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 142 [2023-12-09 15:36:27,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 391 transitions, 2560 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:27,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:27,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 142 [2023-12-09 15:36:27,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:28,319 INFO L124 PetriNetUnfolderBase]: 4615/9586 cut-off events. [2023-12-09 15:36:28,319 INFO L125 PetriNetUnfolderBase]: For 31835/32226 co-relation queries the response was YES. [2023-12-09 15:36:28,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28920 conditions, 9586 events. 4615/9586 cut-off events. For 31835/32226 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 80793 event pairs, 1057 based on Foata normal form. 250/9761 useless extension candidates. Maximal degree in co-relation 26373. Up to 2595 conditions per place. [2023-12-09 15:36:28,394 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 188 selfloop transitions, 2 changer transitions 22/424 dead transitions. [2023-12-09 15:36:28,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 424 transitions, 3514 flow [2023-12-09 15:36:28,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:36:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:36:28,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-12-09 15:36:28,396 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9272300469483568 [2023-12-09 15:36:28,396 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-12-09 15:36:28,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-12-09 15:36:28,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:28,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-12-09 15:36:28,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:28,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:28,399 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:28,401 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 31 predicate places. [2023-12-09 15:36:28,401 INFO L500 AbstractCegarLoop]: Abstraction has has 167 places, 424 transitions, 3514 flow [2023-12-09 15:36:28,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:28,401 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:28,401 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:28,402 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:36:28,402 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 2 more)] === [2023-12-09 15:36:28,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1564407608, now seen corresponding path program 6 times [2023-12-09 15:36:28,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:28,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36809304] [2023-12-09 15:36:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:28,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:30,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:30,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36809304] [2023-12-09 15:36:30,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36809304] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:30,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:30,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:36:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809212253] [2023-12-09 15:36:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:30,356 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:36:30,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:36:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:36:30,358 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:36:30,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 424 transitions, 3514 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:30,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:30,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:36:30,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:31,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][179], [20#L96true, 83#$Ultimate##0true, 44#L50true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,099 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,099 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,099 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,099 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,099 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][180], [20#L96true, 83#$Ultimate##0true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,099 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,100 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,100 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,100 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][193], [83#$Ultimate##0true, 20#L96true, 44#L50true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,108 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,108 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,108 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,108 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][194], [83#$Ultimate##0true, 20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 104#L53true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,108 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,108 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,109 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,109 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,227 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][203], [83#$Ultimate##0true, 20#L96true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 104#L53true, 117#L146-4true, 109#L73true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,227 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,227 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,227 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,227 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:31,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][182], [20#L96true, 83#$Ultimate##0true, 44#L50true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,278 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,278 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,278 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,278 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][183], [20#L96true, 83#$Ultimate##0true, 104#L53true, 109#L73true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,279 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,279 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,279 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,279 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][197], [83#$Ultimate##0true, 20#L96true, 44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,299 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,299 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,299 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,299 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:31,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][179], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 110#L113true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,318 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,319 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,319 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,319 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][180], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 110#L113true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 104#L53true, 109#L73true, 117#L146-4true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,319 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,319 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,319 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,319 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][193], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 110#L113true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,330 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,331 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,331 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,331 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][194], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 110#L113true, 104#L53true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,331 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,331 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,331 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,331 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][203], [20#L96true, 110#L113true, 104#L53true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,365 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,365 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,365 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,365 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:31,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][179], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,381 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,381 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,381 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,381 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][180], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 104#L53true, 109#L73true, 117#L146-4true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,381 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,381 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,381 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,381 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][193], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,391 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,391 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,391 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,391 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,391 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][194], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 104#L53true, 117#L146-4true, 109#L73true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,391 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,391 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,391 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,391 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][182], [20#L96true, 44#L50true, 110#L113true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,410 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,410 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,410 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,410 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,410 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][183], [20#L96true, 110#L113true, 104#L53true, 117#L146-4true, 109#L73true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,410 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,410 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,410 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,410 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,433 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][197], [20#L96true, 44#L50true, 110#L113true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,433 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,434 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,434 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,434 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:31,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][203], [20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,437 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,437 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,437 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,437 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:31,462 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][360], [20#L96true, 44#L50true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,462 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,462 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,462 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,462 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,463 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][358], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,463 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,463 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,463 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,463 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,466 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][359], [20#L96true, 44#L50true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 41#L122true, 109#L73true, 117#L146-4true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,466 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,466 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,466 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,466 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][376], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,480 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,480 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,480 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,480 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,481 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][373], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 104#L53true, 109#L73true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,481 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,481 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,481 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,481 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,520 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][182], [20#L96true, 44#L50true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,520 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,520 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,520 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,520 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][183], [20#L96true, 104#L53true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,521 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,521 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,521 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,521 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][368], [20#L96true, 44#L50true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 4#L76true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,524 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,524 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,524 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,524 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][371], [20#L96true, 104#L53true, 109#L73true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,525 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,525 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,525 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,525 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][370], [20#L96true, 44#L50true, 41#L122true, 109#L73true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,529 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,529 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,530 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,530 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,530 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][369], [44#L50true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:31,530 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,530 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,530 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,531 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,549 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][197], [20#L96true, 44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,550 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,550 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,550 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,550 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:31,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][392], [20#L96true, 44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,552 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,552 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,552 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,553 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][385], [44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,560 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,560 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,560 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,560 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][389], [20#L96true, 44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 41#L122true, 109#L73true, 117#L146-4true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,561 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,561 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,561 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,561 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:31,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][361], [44#L50true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,580 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,580 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,580 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,580 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,614 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][374], [20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 41#L122true, 109#L73true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,614 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,615 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,615 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,615 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][378], [162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 109#L73true, 117#L146-4true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,615 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,615 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,615 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,615 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][390], [20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:31,652 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,652 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,652 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:31,652 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:32,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][535], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 34#L59true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:32,304 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:32,304 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:32,305 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:32,305 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:32,305 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][536], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 41#L122true, 117#L146-4true, 219#true, 34#L59true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:32,305 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:32,305 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:32,305 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:32,305 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:33,347 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][578], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 219#true, 87#L147-2true, 227#true, thread1Thread1of1ForFork1NotInUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:33,347 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is not cut-off event [2023-12-09 15:36:33,347 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:36:33,347 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:36:33,347 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:36:34,642 INFO L124 PetriNetUnfolderBase]: 8324/18406 cut-off events. [2023-12-09 15:36:34,644 INFO L125 PetriNetUnfolderBase]: For 84840/86324 co-relation queries the response was YES. [2023-12-09 15:36:34,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69507 conditions, 18406 events. 8324/18406 cut-off events. For 84840/86324 co-relation queries the response was YES. Maximal size of possible extension queue 1012. Compared 186459 event pairs, 1168 based on Foata normal form. 121/18443 useless extension candidates. Maximal degree in co-relation 66320. Up to 5355 conditions per place. [2023-12-09 15:36:34,829 INFO L140 encePairwiseOnDemand]: 122/142 looper letters, 887 selfloop transitions, 35 changer transitions 51/1042 dead transitions. [2023-12-09 15:36:34,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 1042 transitions, 11270 flow [2023-12-09 15:36:34,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-09 15:36:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-12-09 15:36:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2378 transitions. [2023-12-09 15:36:34,836 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6698591549295775 [2023-12-09 15:36:34,836 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2378 transitions. [2023-12-09 15:36:34,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2378 transitions. [2023-12-09 15:36:34,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:34,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2378 transitions. [2023-12-09 15:36:34,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 95.12) internal successors, (2378), 25 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:34,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 142.0) internal successors, (3692), 26 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:34,851 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 142.0) internal successors, (3692), 26 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:34,852 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 55 predicate places. [2023-12-09 15:36:34,852 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 1042 transitions, 11270 flow [2023-12-09 15:36:34,853 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:34,853 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:34,856 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:34,856 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:36:34,856 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 2 more)] === [2023-12-09 15:36:34,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:34,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1113020440, now seen corresponding path program 7 times [2023-12-09 15:36:34,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:34,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549414676] [2023-12-09 15:36:34,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:34,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:36,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:36,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549414676] [2023-12-09 15:36:36,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549414676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:36,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:36:36,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971758186] [2023-12-09 15:36:36,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:36,764 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:36:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:36,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:36:36,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:36:36,766 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:36:36,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 1042 transitions, 11270 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:36,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:36,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:36:36,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:39,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][462], [104#L53true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 109#L73true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, thread4Thread1of1ForFork2InUse, 144#L125true, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:39,171 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,171 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,171 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,171 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][463], [44#L50true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, thread4Thread1of1ForFork2InUse, 144#L125true, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:39,172 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,172 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,172 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,172 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][598], [44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, thread4Thread1of1ForFork2InUse, 144#L125true, 223#true]) [2023-12-09 15:36:39,301 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,301 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,301 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,301 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][601], [233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 104#L53true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, thread4Thread1of1ForFork2InUse, 144#L125true, 223#true]) [2023-12-09 15:36:39,301 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,301 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,301 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,301 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:39,341 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][686], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:39,342 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2023-12-09 15:36:39,342 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:39,342 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:39,342 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:39,342 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][689], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 41#L122true, 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:39,342 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2023-12-09 15:36:39,342 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:39,342 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:39,342 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:39,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][988], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:39,401 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,401 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,401 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,401 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][989], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 41#L122true, 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:39,401 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,401 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,401 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,401 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][462], [104#L53true, 117#L146-4true, 109#L73true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, thread4Thread1of1ForFork2InUse, 13#L128true, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:39,460 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,460 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][463], [44#L50true, 234#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, thread4Thread1of1ForFork2InUse, 13#L128true, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:39,460 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,460 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][598], [44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, 13#L128true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:39,767 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,767 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,767 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,767 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][601], [164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 104#L53true, 109#L73true, 117#L146-4true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, 13#L128true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:39,767 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,767 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,767 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:39,767 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:41,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][973], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 87#L147-2true, thread1Thread1of1ForFork1NotInUse, 227#true, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:41,421 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is not cut-off event [2023-12-09 15:36:41,421 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2023-12-09 15:36:41,421 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2023-12-09 15:36:41,421 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2023-12-09 15:36:41,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][1216], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 87#L147-2true, thread1Thread1of1ForFork1NotInUse, 227#true, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:41,421 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-12-09 15:36:41,421 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:36:41,421 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:36:41,422 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:36:44,830 INFO L124 PetriNetUnfolderBase]: 17751/40269 cut-off events. [2023-12-09 15:36:44,830 INFO L125 PetriNetUnfolderBase]: For 216841/229328 co-relation queries the response was YES. [2023-12-09 15:36:44,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179883 conditions, 40269 events. 17751/40269 cut-off events. For 216841/229328 co-relation queries the response was YES. Maximal size of possible extension queue 2664. Compared 468281 event pairs, 2292 based on Foata normal form. 336/40429 useless extension candidates. Maximal degree in co-relation 149182. Up to 11999 conditions per place. [2023-12-09 15:36:45,207 INFO L140 encePairwiseOnDemand]: 122/142 looper letters, 2363 selfloop transitions, 115 changer transitions 105/2652 dead transitions. [2023-12-09 15:36:45,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 2652 transitions, 34478 flow [2023-12-09 15:36:45,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-09 15:36:45,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-12-09 15:36:45,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2554 transitions. [2023-12-09 15:36:45,213 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6661450182576943 [2023-12-09 15:36:45,213 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2554 transitions. [2023-12-09 15:36:45,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2554 transitions. [2023-12-09 15:36:45,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:45,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2554 transitions. [2023-12-09 15:36:45,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 94.5925925925926) internal successors, (2554), 27 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:45,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 142.0) internal successors, (3976), 28 states have internal predecessors, (3976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:45,226 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 142.0) internal successors, (3976), 28 states have internal predecessors, (3976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:45,226 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 81 predicate places. [2023-12-09 15:36:45,226 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 2652 transitions, 34478 flow [2023-12-09 15:36:45,227 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:45,227 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:45,227 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:45,227 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:36:45,228 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 2 more)] === [2023-12-09 15:36:45,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:45,228 INFO L85 PathProgramCache]: Analyzing trace with hash 236568664, now seen corresponding path program 8 times [2023-12-09 15:36:45,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:45,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085002231] [2023-12-09 15:36:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:45,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:46,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:46,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:46,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085002231] [2023-12-09 15:36:46,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085002231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:46,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:46,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:36:46,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142715649] [2023-12-09 15:36:46,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:46,901 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:36:46,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:46,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:36:46,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:36:46,903 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:36:46,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 2652 transitions, 34478 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:46,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:46,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:36:46,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:47,683 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][193], [83#$Ultimate##0true, 20#L96true, 104#L53true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 109#L73true, 117#L146-4true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:47,683 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:36:47,683 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:47,683 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:47,684 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:36:47,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][192], [83#$Ultimate##0true, 20#L96true, 44#L50true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:47,879 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is not cut-off event [2023-12-09 15:36:47,879 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:47,879 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:47,879 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is not cut-off event [2023-12-09 15:36:48,026 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][193], [20#L96true, 110#L113true, 104#L53true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 109#L73true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:48,026 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 15:36:48,026 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:48,026 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:48,026 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:36:48,234 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][192], [20#L96true, 44#L50true, 110#L113true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:48,235 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is not cut-off event [2023-12-09 15:36:48,235 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:48,235 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:48,235 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is not cut-off event [2023-12-09 15:36:48,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][450], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 20#L96true, 44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:48,238 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2023-12-09 15:36:48,238 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:48,238 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:48,238 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is cut-off event [2023-12-09 15:36:48,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][449], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 109#L73true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:48,537 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is not cut-off event [2023-12-09 15:36:48,537 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:48,537 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:48,537 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:36:48,543 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][598], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 20#L96true, 104#L53true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:48,543 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,543 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,543 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,543 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][603], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 20#L96true, 44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:48,544 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,544 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,544 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,544 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][597], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 20#L96true, 44#L50true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 41#L122true, 117#L146-4true, 109#L73true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:48,561 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,561 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,562 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,562 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:36:48,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][596], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 109#L73true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:48,962 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is not cut-off event [2023-12-09 15:36:48,962 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:48,962 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:48,962 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:36:51,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][598], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 104#L53true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 109#L73true, 117#L146-4true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, thread4Thread1of1ForFork2InUse, 223#true, 144#L125true]) [2023-12-09 15:36:51,441 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:36:51,441 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:51,441 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:51,441 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:51,442 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][603], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 44#L50true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, thread4Thread1of1ForFork2InUse, 223#true, 144#L125true]) [2023-12-09 15:36:51,442 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:36:51,442 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:51,442 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:51,442 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:36:51,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][820], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:51,861 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2023-12-09 15:36:51,861 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:51,862 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:51,862 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:51,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][821], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 41#L122true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:51,863 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is not cut-off event [2023-12-09 15:36:51,863 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:51,863 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:51,864 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is not cut-off event [2023-12-09 15:36:51,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][1581], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 41#L122true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:51,936 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:51,936 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:51,936 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:51,936 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:51,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][1582], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:51,937 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:51,937 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:51,937 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:51,937 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:52,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][598], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 117#L146-4true, 109#L73true, 219#true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, 13#L128true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:52,311 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:52,311 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:52,311 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:52,311 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:52,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][603], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 44#L50true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 123#L105true, 13#L128true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:36:52,311 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:36:52,311 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:52,311 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:52,311 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:36:56,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][1344], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 87#L147-2true, 219#true, 227#true, thread1Thread1of1ForFork1NotInUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:36:56,024 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-12-09 15:36:56,024 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:36:56,025 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:36:56,025 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:36:56,799 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][1841], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 87#L147-2true, 227#true, thread1Thread1of1ForFork1NotInUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:36:56,799 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-12-09 15:36:56,799 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:36:56,799 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:36:56,799 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:37:04,303 INFO L124 PetriNetUnfolderBase]: 25191/62117 cut-off events. [2023-12-09 15:37:04,303 INFO L125 PetriNetUnfolderBase]: For 408885/433558 co-relation queries the response was YES. [2023-12-09 15:37:04,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310659 conditions, 62117 events. 25191/62117 cut-off events. For 408885/433558 co-relation queries the response was YES. Maximal size of possible extension queue 4383. Compared 812257 event pairs, 3183 based on Foata normal form. 1130/62972 useless extension candidates. Maximal degree in co-relation 153954. Up to 18086 conditions per place. [2023-12-09 15:37:04,939 INFO L140 encePairwiseOnDemand]: 122/142 looper letters, 4456 selfloop transitions, 190 changer transitions 202/4917 dead transitions. [2023-12-09 15:37:04,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 4917 transitions, 73067 flow [2023-12-09 15:37:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-09 15:37:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-12-09 15:37:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2459 transitions. [2023-12-09 15:37:04,944 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6660346695557963 [2023-12-09 15:37:04,944 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2459 transitions. [2023-12-09 15:37:04,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2459 transitions. [2023-12-09 15:37:04,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:37:04,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2459 transitions. [2023-12-09 15:37:04,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 94.57692307692308) internal successors, (2459), 26 states have internal predecessors, (2459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:04,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 142.0) internal successors, (3834), 27 states have internal predecessors, (3834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:04,957 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 142.0) internal successors, (3834), 27 states have internal predecessors, (3834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:04,957 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 106 predicate places. [2023-12-09 15:37:04,957 INFO L500 AbstractCegarLoop]: Abstraction has has 242 places, 4917 transitions, 73067 flow [2023-12-09 15:37:04,958 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:04,958 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:37:04,958 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:37:04,958 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:37:04,959 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 2 more)] === [2023-12-09 15:37:04,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:37:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1446328198, now seen corresponding path program 9 times [2023-12-09 15:37:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:37:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953466918] [2023-12-09 15:37:04,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:37:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:37:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:37:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:37:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:37:06,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953466918] [2023-12-09 15:37:06,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953466918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:37:06,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:37:06,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:37:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226774034] [2023-12-09 15:37:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:37:06,593 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:37:06,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:37:06,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:37:06,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:37:06,595 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:37:06,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 4917 transitions, 73067 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:06,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:37:06,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:37:06,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:37:07,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][216], [406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 83#$Ultimate##0true, 20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:07,945 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:37:07,945 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:37:07,945 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:37:07,945 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:37:07,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][219], [406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 83#$Ultimate##0true, 20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 104#L53true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 109#L73true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:07,945 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2023-12-09 15:37:07,945 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:37:07,945 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:37:07,945 INFO L297 olderBase$Statistics]: existing Event has 77 ancestors and is cut-off event [2023-12-09 15:37:08,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][216], [406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 110#L113true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:08,354 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 15:37:08,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:37:08,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:37:08,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:37:08,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][219], [406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 110#L113true, 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 109#L73true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:08,354 INFO L294 olderBase$Statistics]: this new event has 79 ancestors and is cut-off event [2023-12-09 15:37:08,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:37:08,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:37:08,354 INFO L297 olderBase$Statistics]: existing Event has 79 ancestors and is cut-off event [2023-12-09 15:37:09,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][523], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 109#L73true, 219#true, 158#(= ~f22~0 0), 227#true, thread1Thread1of1ForFork1InUse, 61#L116true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:09,153 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is not cut-off event [2023-12-09 15:37:09,153 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:37:09,153 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:37:09,153 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:37:09,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][525], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 44#L50true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 158#(= ~f22~0 0), 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 61#L116true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:09,154 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is not cut-off event [2023-12-09 15:37:09,154 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:37:09,154 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:37:09,154 INFO L297 olderBase$Statistics]: existing Event has 80 ancestors and is not cut-off event [2023-12-09 15:37:09,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([371] L73-->L76: Formula: (not (= (ite (and (not (= (mod v_~f21~0_15 256) 0)) (not (= (mod v_~f11~0_15 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_15, ~f11~0=v_~f11~0_15} OutVars{~f21~0=v_~f21~0_15, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~f11~0=v_~f11~0_15} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][675], [406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 44#L50true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 219#true, 4#L76true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:09,155 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([362] L50-->L53: Formula: (not (= (ite (and (not (= (mod v_~f11~0_19 256) 0)) (not (= (mod v_~f21~0_19 256) 0))) 1 0) 0)) InVars {~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19} OutVars{~f21~0=v_~f21~0_19, ~f11~0=v_~f11~0_19, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][680], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 104#L53true, 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 109#L73true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:09,155 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,155 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][676], [406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 44#L50true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 109#L73true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:09,254 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,254 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,254 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,254 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is cut-off event [2023-12-09 15:37:09,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][681], [350#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= 0 ~x1~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), 406#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 44#L50true, 162#(and (<= (div (+ ~x2~0 1) 4294967296) 0) (<= 0 ~x2~0)), 233#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 41#L122true, 117#L146-4true, 109#L73true, 219#true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 291#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~y2~0) (<= (div (+ ~y2~0 1) 4294967296) 0)), thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 223#true]) [2023-12-09 15:37:09,808 INFO L294 olderBase$Statistics]: this new event has 81 ancestors and is not cut-off event [2023-12-09 15:37:09,808 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:37:09,808 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:37:09,808 INFO L297 olderBase$Statistics]: existing Event has 81 ancestors and is not cut-off event [2023-12-09 15:37:13,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][1632], [111#L79true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 252#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 0 ~x1~0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:37:13,406 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:37:13,406 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:37:13,406 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:37:13,406 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:37:13,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][1633], [111#L79true, 20#L96true, 41#L122true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 252#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 0 ~x1~0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:37:13,406 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:37:13,406 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:37:13,406 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:37:13,406 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:37:14,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][1946], [164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 254#(and (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:37:14,723 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:37:14,723 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:37:14,723 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:37:14,723 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:37:14,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][1947], [20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 41#L122true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 254#(and (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:37:14,723 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:37:14,723 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:37:14,723 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:37:14,723 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:37:23,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][2333], [111#L79true, 20#L96true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 252#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 0 ~x1~0)), 87#L147-2true, 219#true, 227#true, thread1Thread1of1ForFork1NotInUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:37:23,649 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is not cut-off event [2023-12-09 15:37:23,649 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2023-12-09 15:37:23,649 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2023-12-09 15:37:23,649 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is not cut-off event [2023-12-09 15:37:23,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][2331], [20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 254#(and (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 87#L147-2true, 219#true, 227#true, thread1Thread1of1ForFork1NotInUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 129#L82true, 223#true]) [2023-12-09 15:37:23,651 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-12-09 15:37:23,651 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:37:23,651 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:37:23,651 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-12-09 15:37:37,829 INFO L124 PetriNetUnfolderBase]: 26943/67523 cut-off events. [2023-12-09 15:37:37,829 INFO L125 PetriNetUnfolderBase]: For 528949/565938 co-relation queries the response was YES. [2023-12-09 15:37:38,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381282 conditions, 67523 events. 26943/67523 cut-off events. For 528949/565938 co-relation queries the response was YES. Maximal size of possible extension queue 4864. Compared 905242 event pairs, 3303 based on Foata normal form. 1974/69213 useless extension candidates. Maximal degree in co-relation 209518. Up to 19692 conditions per place. [2023-12-09 15:37:38,516 INFO L140 encePairwiseOnDemand]: 122/142 looper letters, 5535 selfloop transitions, 215 changer transitions 243/6062 dead transitions. [2023-12-09 15:37:38,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 6062 transitions, 102473 flow [2023-12-09 15:37:38,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-09 15:37:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-12-09 15:37:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2377 transitions. [2023-12-09 15:37:38,519 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6695774647887324 [2023-12-09 15:37:38,519 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2377 transitions. [2023-12-09 15:37:38,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2377 transitions. [2023-12-09 15:37:38,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:37:38,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2377 transitions. [2023-12-09 15:37:38,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 95.08) internal successors, (2377), 25 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:38,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 142.0) internal successors, (3692), 26 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:38,528 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 142.0) internal successors, (3692), 26 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:38,528 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 130 predicate places. [2023-12-09 15:37:38,528 INFO L500 AbstractCegarLoop]: Abstraction has has 266 places, 6062 transitions, 102473 flow [2023-12-09 15:37:38,529 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:38,529 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:37:38,529 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:37:38,529 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:37:38,529 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 2 more)] === [2023-12-09 15:37:38,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:37:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash 663151700, now seen corresponding path program 10 times [2023-12-09 15:37:38,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:37:38,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037609307] [2023-12-09 15:37:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:37:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:37:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:37:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:37:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:37:40,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037609307] [2023-12-09 15:37:40,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037609307] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:37:40,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:37:40,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:37:40,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807354955] [2023-12-09 15:37:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:37:40,103 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:37:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:37:40,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:37:40,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:37:40,105 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:37:40,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 6062 transitions, 102473 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:40,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:37:40,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:37:40,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:21,874 INFO L124 PetriNetUnfolderBase]: 27058/67667 cut-off events. [2023-12-09 15:38:21,874 INFO L125 PetriNetUnfolderBase]: For 619104/665027 co-relation queries the response was YES. [2023-12-09 15:38:22,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427444 conditions, 67667 events. 27058/67667 cut-off events. For 619104/665027 co-relation queries the response was YES. Maximal size of possible extension queue 4867. Compared 906197 event pairs, 3304 based on Foata normal form. 2940/70323 useless extension candidates. Maximal degree in co-relation 206925. Up to 19796 conditions per place. [2023-12-09 15:38:22,652 INFO L140 encePairwiseOnDemand]: 122/142 looper letters, 5556 selfloop transitions, 213 changer transitions 265/6103 dead transitions. [2023-12-09 15:38:22,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 6103 transitions, 115291 flow [2023-12-09 15:38:22,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-09 15:38:22,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-12-09 15:38:22,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2190 transitions. [2023-12-09 15:38:22,655 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.670545009185548 [2023-12-09 15:38:22,656 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2190 transitions. [2023-12-09 15:38:22,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2190 transitions. [2023-12-09 15:38:22,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:22,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2190 transitions. [2023-12-09 15:38:22,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 95.21739130434783) internal successors, (2190), 23 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:22,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 142.0) internal successors, (3408), 24 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:22,664 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 142.0) internal successors, (3408), 24 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:22,664 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 152 predicate places. [2023-12-09 15:38:22,664 INFO L500 AbstractCegarLoop]: Abstraction has has 288 places, 6103 transitions, 115291 flow [2023-12-09 15:38:22,665 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:22,665 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:22,665 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:22,665 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:38:22,665 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 2 more)] === [2023-12-09 15:38:22,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:22,665 INFO L85 PathProgramCache]: Analyzing trace with hash 872523748, now seen corresponding path program 11 times [2023-12-09 15:38:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:22,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057941575] [2023-12-09 15:38:22,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:22,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:24,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057941575] [2023-12-09 15:38:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057941575] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:38:24,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:38:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:38:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138891109] [2023-12-09 15:38:24,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:38:24,334 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:38:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:24,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:38:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:38:24,335 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:38:24,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 6103 transitions, 115291 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:24,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:24,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:38:24,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:38:33,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][1635], [111#L79true, 20#L96true, 478#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 41#L122true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 252#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 0 ~x1~0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 223#true, 531#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:38:33,786 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,786 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,786 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,786 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][1636], [111#L79true, 478#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 252#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 0 ~x1~0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 223#true, 531#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:38:33,787 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,787 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,787 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,787 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][1630], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 478#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 41#L122true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 219#true, 34#L59true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 223#true, 531#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:38:33,885 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,885 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,885 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,885 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][1631], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 478#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 31#L99true, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 223#true, 531#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:38:33,886 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,886 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,886 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:33,886 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-12-09 15:38:35,935 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][1967], [20#L96true, 533#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 41#L122true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 254#(and (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, thread3Thread1of1ForFork0InUse, 480#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (= ~x1~0 1)), thread2Thread1of1ForFork3InUse, thread4Thread1of1ForFork2InUse, 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 129#L82true, 223#true]) [2023-12-09 15:38:35,935 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:38:35,935 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:35,935 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:35,935 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:35,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][1968], [533#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 254#(and (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 219#true, 34#L59true, 227#true, 156#true, thread1Thread1of1ForFork1InUse, 90#L119true, thread3Thread1of1ForFork0InUse, 480#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (= ~x1~0 1)), thread2Thread1of1ForFork3InUse, 31#L99true, 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:38:35,936 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:38:35,936 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:35,936 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:35,936 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:36,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([380] L96-->L99: Formula: (not (= (ite (and (not (= (mod v_~f12~0_15 256) 0)) (not (= (mod v_~f22~0_15 256) 0))) 1 0) 0)) InVars {~f12~0=v_~f12~0_15, ~f22~0=v_~f22~0_15} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~f12~0=v_~f12~0_15, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, ~f22~0=v_~f22~0_15} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1][1954], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 533#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 117#L146-4true, 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, 480#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (= ~x1~0 1)), thread2Thread1of1ForFork3InUse, 31#L99true, thread4Thread1of1ForFork2InUse, 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 129#L82true, 223#true]) [2023-12-09 15:38:36,027 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:38:36,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:36,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:36,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:36,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L119-->L122: Formula: (not (= (ite (and (not (= (mod v_~f22~0_19 256) 0)) (not (= 0 (mod v_~f12~0_19 256)))) 1 0) 0)) InVars {~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} OutVars{thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~f12~0=v_~f12~0_19, ~f22~0=v_~f22~0_19} AuxVars[] AssignedVars[thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1][1955], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 533#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 20#L96true, 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 41#L122true, 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 117#L146-4true, 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 34#L59true, 227#true, thread1Thread1of1ForFork1InUse, 156#true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 480#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (= ~x1~0 1)), 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:38:36,027 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-12-09 15:38:36,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:36,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:36,027 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-12-09 15:38:48,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][2355], [111#L79true, 248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 478#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 87#L147-2true, thread1Thread1of1ForFork1NotInUse, 227#true, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 531#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:38:48,222 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-12-09 15:38:48,222 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:38:48,222 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:38:48,222 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:38:48,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][2369], [111#L79true, 20#L96true, 478#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 252#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 0 ~x1~0)), 87#L147-2true, 219#true, 227#true, thread1Thread1of1ForFork1NotInUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 421#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), thread4Thread1of1ForFork2InUse, 531#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 223#true, 163#(and (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0))]) [2023-12-09 15:38:48,275 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-12-09 15:38:48,275 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:38:48,276 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:38:48,276 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-12-09 15:38:52,191 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][2356], [248#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (= ~t11~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 20#L96true, 533#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 219#true, 87#L147-2true, 227#true, thread1Thread1of1ForFork1NotInUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork3InUse, 480#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (= ~x1~0 1)), 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:38:52,191 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is not cut-off event [2023-12-09 15:38:52,192 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:38:52,192 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:38:52,192 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:38:52,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([402] thread1EXIT-->L147-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][2368], [20#L96true, 533#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 164#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~y1~0) (<= (div (+ ~x2~0 1) 4294967296) 0) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 0 ~x2~0) (<= 0 ~x1~0)), 349#(and (<= (div (+ ~x1~0 1) 4294967296) 0) (<= 0 ~x1~0)), 254#(and (<= 0 (div (+ (* (- 1) ~y1~0) 1) 256)) (= ~t21~0 1) (= ~t11~0 1) (<= 1 ~y1~0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), 290#(and (<= 0 ~y1~0) (<= (div (+ ~y1~0 1) 4294967296) 0)), 87#L147-2true, 219#true, 227#true, thread1Thread1of1ForFork1NotInUse, 156#true, 90#L119true, thread3Thread1of1ForFork0InUse, 480#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (= ~x1~0 1)), thread2Thread1of1ForFork3InUse, 423#(and (<= 0 ~y1~0) (= ~t21~0 1) (<= (div (+ ~y1~0 1) 4294967296) 0) (<= 1 ~x1~0) (<= 0 (div (+ (* (- 1) ~x1~0) 1) 256))), thread4Thread1of1ForFork2InUse, 129#L82true, 223#true]) [2023-12-09 15:38:52,226 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is not cut-off event [2023-12-09 15:38:52,226 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:38:52,226 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:38:52,226 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is not cut-off event [2023-12-09 15:39:09,671 INFO L124 PetriNetUnfolderBase]: 27117/67817 cut-off events. [2023-12-09 15:39:09,671 INFO L125 PetriNetUnfolderBase]: For 733765/778456 co-relation queries the response was YES. [2023-12-09 15:39:09,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473103 conditions, 67817 events. 27117/67817 cut-off events. For 733765/778456 co-relation queries the response was YES. Maximal size of possible extension queue 4863. Compared 907767 event pairs, 3351 based on Foata normal form. 3043/70568 useless extension candidates. Maximal degree in co-relation 230280. Up to 19868 conditions per place. [2023-12-09 15:39:10,423 INFO L140 encePairwiseOnDemand]: 122/142 looper letters, 5558 selfloop transitions, 213 changer transitions 277/6117 dead transitions. [2023-12-09 15:39:10,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 6117 transitions, 127682 flow [2023-12-09 15:39:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-09 15:39:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-12-09 15:39:10,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2283 transitions. [2023-12-09 15:39:10,426 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6698943661971831 [2023-12-09 15:39:10,426 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2283 transitions. [2023-12-09 15:39:10,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2283 transitions. [2023-12-09 15:39:10,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:10,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2283 transitions. [2023-12-09 15:39:10,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 95.125) internal successors, (2283), 24 states have internal predecessors, (2283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:10,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 142.0) internal successors, (3550), 25 states have internal predecessors, (3550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:10,433 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 142.0) internal successors, (3550), 25 states have internal predecessors, (3550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:10,434 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 175 predicate places. [2023-12-09 15:39:10,434 INFO L500 AbstractCegarLoop]: Abstraction has has 311 places, 6117 transitions, 127682 flow [2023-12-09 15:39:10,434 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:10,434 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:10,435 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:39:10,435 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 15:39:10,435 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 2 more)] === [2023-12-09 15:39:10,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:10,435 INFO L85 PathProgramCache]: Analyzing trace with hash -930946830, now seen corresponding path program 12 times [2023-12-09 15:39:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:10,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905986163] [2023-12-09 15:39:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:10,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:39:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905986163] [2023-12-09 15:39:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905986163] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:11,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:39:11,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120756600] [2023-12-09 15:39:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:11,936 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:39:11,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:11,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:39:11,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:39:11,939 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:39:11,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 6117 transitions, 127682 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:11,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:11,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:39:11,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:58,366 INFO L124 PetriNetUnfolderBase]: 27090/67608 cut-off events. [2023-12-09 15:39:58,366 INFO L125 PetriNetUnfolderBase]: For 837203/898658 co-relation queries the response was YES. [2023-12-09 15:39:58,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517093 conditions, 67608 events. 27090/67608 cut-off events. For 837203/898658 co-relation queries the response was YES. Maximal size of possible extension queue 4865. Compared 903938 event pairs, 3370 based on Foata normal form. 2965/70298 useless extension candidates. Maximal degree in co-relation 284270. Up to 19825 conditions per place. [2023-12-09 15:39:59,405 INFO L140 encePairwiseOnDemand]: 122/142 looper letters, 5539 selfloop transitions, 210 changer transitions 296/6114 dead transitions. [2023-12-09 15:39:59,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 6114 transitions, 139724 flow [2023-12-09 15:39:59,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-09 15:39:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-12-09 15:39:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2370 transitions. [2023-12-09 15:39:59,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6676056338028169 [2023-12-09 15:39:59,409 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 2370 transitions. [2023-12-09 15:39:59,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 2370 transitions. [2023-12-09 15:39:59,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:59,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 2370 transitions. [2023-12-09 15:39:59,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 94.8) internal successors, (2370), 25 states have internal predecessors, (2370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:59,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 142.0) internal successors, (3692), 26 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:59,416 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 142.0) internal successors, (3692), 26 states have internal predecessors, (3692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:59,417 INFO L308 CegarLoopForPetriNet]: 136 programPoint places, 199 predicate places. [2023-12-09 15:39:59,417 INFO L500 AbstractCegarLoop]: Abstraction has has 335 places, 6114 transitions, 139724 flow [2023-12-09 15:39:59,417 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:59,417 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:59,418 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:39:59,418 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-09 15:39:59,418 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 2 more)] === [2023-12-09 15:39:59,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash 846412258, now seen corresponding path program 13 times [2023-12-09 15:39:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:59,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620219643] [2023-12-09 15:39:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:59,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:00,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:00,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620219643] [2023-12-09 15:40:00,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620219643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:00,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:00,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:40:00,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008997374] [2023-12-09 15:40:00,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:00,740 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:40:00,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:00,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:40:00,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:40:00,742 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-12-09 15:40:00,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 6114 transitions, 139724 flow. Second operand has 16 states, 16 states have (on average 88.25) internal successors, (1412), 16 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:40:00,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:00,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-12-09 15:40:00,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:40:04,795 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:40:04,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:40:04,810 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-12-09 15:40:04,810 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 15:40:04,810 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 85/142 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 53585 conditions, 5644 events (2861/5643 cut-off events. For 108596/142925 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 54630 event pairs, 312 based on Foata normal form. 400/7084 useless extension candidates. Maximal degree in co-relation 53239. Up to 2692 conditions per place.). [2023-12-09 15:40:04,812 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-12-09 15:40:04,812 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-12-09 15:40:04,812 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-12-09 15:40:04,812 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-12-09 15:40:04,813 INFO L457 BasicCegarLoop]: Path program histogram: [13] [2023-12-09 15:40:04,816 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:40:04,816 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:40:04,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:40:04 BasicIcfg [2023-12-09 15:40:04,821 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:40:04,821 INFO L158 Benchmark]: Toolchain (without parser) took 229162.16ms. Allocated memory was 280.0MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 227.2MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2023-12-09 15:40:04,821 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 190.8MB. Free memory was 142.1MB in the beginning and 141.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:40:04,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.36ms. Allocated memory is still 280.0MB. Free memory was 226.9MB in the beginning and 214.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-09 15:40:04,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.13ms. Allocated memory is still 280.0MB. Free memory was 214.7MB in the beginning and 212.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:40:04,822 INFO L158 Benchmark]: Boogie Preprocessor took 33.15ms. Allocated memory is still 280.0MB. Free memory was 212.6MB in the beginning and 210.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:40:04,823 INFO L158 Benchmark]: RCFGBuilder took 603.21ms. Allocated memory is still 280.0MB. Free memory was 210.9MB in the beginning and 245.5MB in the end (delta: -34.6MB). Peak memory consumption was 27.7MB. Max. memory is 8.0GB. [2023-12-09 15:40:04,823 INFO L158 Benchmark]: TraceAbstraction took 228251.00ms. Allocated memory was 280.0MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 245.0MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2023-12-09 15:40:04,824 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 190.8MB. Free memory was 142.1MB in the beginning and 141.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.36ms. Allocated memory is still 280.0MB. Free memory was 226.9MB in the beginning and 214.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.13ms. Allocated memory is still 280.0MB. Free memory was 214.7MB in the beginning and 212.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.15ms. Allocated memory is still 280.0MB. Free memory was 212.6MB in the beginning and 210.9MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 603.21ms. Allocated memory is still 280.0MB. Free memory was 210.9MB in the beginning and 245.5MB in the end (delta: -34.6MB). Peak memory consumption was 27.7MB. Max. memory is 8.0GB. * TraceAbstraction took 228251.00ms. Allocated memory was 280.0MB in the beginning and 6.1GB in the end (delta: 5.8GB). Free memory was 245.0MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 153]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 85/142 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 53585 conditions, 5644 events (2861/5643 cut-off events. For 108596/142925 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 54630 event pairs, 312 based on Foata normal form. 400/7084 useless extension candidates. Maximal degree in co-relation 53239. Up to 2692 conditions per place.). - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 85/142 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 53585 conditions, 5644 events (2861/5643 cut-off events. For 108596/142925 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 54630 event pairs, 312 based on Foata normal form. 400/7084 useless extension candidates. Maximal degree in co-relation 53239. Up to 2692 conditions per place.). - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 85/142 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 53585 conditions, 5644 events (2861/5643 cut-off events. For 108596/142925 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 54630 event pairs, 312 based on Foata normal form. 400/7084 useless extension candidates. Maximal degree in co-relation 53239. Up to 2692 conditions per place.). - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 85/142 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 53585 conditions, 5644 events (2861/5643 cut-off events. For 108596/142925 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 54630 event pairs, 312 based on Foata normal form. 400/7084 useless extension candidates. Maximal degree in co-relation 53239. Up to 2692 conditions per place.). - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (16states, 85/142 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 53585 conditions, 5644 events (2861/5643 cut-off events. For 108596/142925 co-relation queries the response was YES. Maximal size of possible extension queue 1095. Compared 54630 event pairs, 312 based on Foata normal form. 400/7084 useless extension candidates. Maximal degree in co-relation 53239. Up to 2692 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 228.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 210.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2561 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2561 mSDsluCounter, 5879 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4894 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9908 IncrementalHoareTripleChecker+Invalid, 10093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 985 mSDtfsCounter, 9908 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1134 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139724occurred in iteration=12, 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.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1573 NumberOfCodeBlocks, 1573 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1560 ConstructedInterpolants, 0 QuantifiedInterpolants, 16989 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown