/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_unroll-3.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 21:11:26,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 21:11:26,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 21:11:26,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 21:11:26,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 21:11:26,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 21:11:26,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 21:11:26,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 21:11:26,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 21:11:26,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 21:11:26,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 21:11:26,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 21:11:26,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 21:11:26,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 21:11:26,681 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 21:11:26,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 21:11:26,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 21:11:26,681 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 21:11:26,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 21:11:26,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 21:11:26,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 21:11:26,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 21:11:26,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 21:11:26,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 21:11:26,684 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 21:11:26,684 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 21:11:26,684 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 21:11:26,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 21:11:26,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 21:11:26,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 21:11:26,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:11:26,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 21:11:26,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 21:11:26,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 21:11:26,687 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 21:11:26,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 21:11:26,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 21:11:26,688 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 21:11:26,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 21:11:26,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 21:11:26,689 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 21:11:26,697 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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: Order of the error locations to be checked -> TOGETHER [2023-08-03 21:11:26,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 21:11:26,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 21:11:26,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 21:11:26,902 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 21:11:26,902 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 21:11:26,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_unroll-3.wvr_bound2.c [2023-08-03 21:11:28,089 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 21:11:28,263 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 21:11:28,264 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_unroll-3.wvr_bound2.c [2023-08-03 21:11:28,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90bcabb8a/aaadcf888f514c7c92fa6b913a9d51c6/FLAG0a9526a4d [2023-08-03 21:11:28,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90bcabb8a/aaadcf888f514c7c92fa6b913a9d51c6 [2023-08-03 21:11:28,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 21:11:28,290 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 21:11:28,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 21:11:28,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 21:11:28,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 21:11:28,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3e8a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28, skipping insertion in model container [2023-08-03 21:11:28,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,313 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 21:11:28,455 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_unroll-3.wvr_bound2.c[2662,2675] [2023-08-03 21:11:28,459 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:11:28,466 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 21:11:28,484 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_unroll-3.wvr_bound2.c[2662,2675] [2023-08-03 21:11:28,486 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 21:11:28,498 INFO L206 MainTranslator]: Completed translation [2023-08-03 21:11:28,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28 WrapperNode [2023-08-03 21:11:28,498 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 21:11:28,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 21:11:28,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 21:11:28,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 21:11:28,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,534 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 179 [2023-08-03 21:11:28,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 21:11:28,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 21:11:28,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 21:11:28,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 21:11:28,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,546 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,555 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,556 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,557 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 21:11:28,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 21:11:28,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 21:11:28,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 21:11:28,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (1/1) ... [2023-08-03 21:11:28,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 21:11:28,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:11:28,592 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-08-03 21:11:28,604 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-08-03 21:11:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 21:11:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-03 21:11:28,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-03 21:11:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-03 21:11:28,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-03 21:11:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 21:11:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 21:11:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 21:11:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-03 21:11:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 21:11:28,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 21:11:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 21:11:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 21:11:28,632 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 21:11:28,705 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 21:11:28,706 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 21:11:28,925 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 21:11:28,933 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 21:11:28,933 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-03 21:11:28,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:11:28 BoogieIcfgContainer [2023-08-03 21:11:28,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 21:11:28,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 21:11:28,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 21:11:28,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 21:11:28,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 09:11:28" (1/3) ... [2023-08-03 21:11:28,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4227eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:11:28, skipping insertion in model container [2023-08-03 21:11:28,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 09:11:28" (2/3) ... [2023-08-03 21:11:28,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4227eea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 09:11:28, skipping insertion in model container [2023-08-03 21:11:28,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 09:11:28" (3/3) ... [2023-08-03 21:11:28,943 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_unroll-3.wvr_bound2.c [2023-08-03 21:11:28,949 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 21:11:28,958 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 21:11:28,958 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 21:11:28,958 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 21:11:29,090 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-03 21:11:29,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 200 transitions, 422 flow [2023-08-03 21:11:29,260 INFO L124 PetriNetUnfolderBase]: 45/375 cut-off events. [2023-08-03 21:11:29,261 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 21:11:29,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 375 events. 45/375 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1275 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 201. Up to 8 conditions per place. [2023-08-03 21:11:29,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 200 transitions, 422 flow [2023-08-03 21:11:29,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 200 transitions, 422 flow [2023-08-03 21:11:29,283 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:11:29,291 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 200 transitions, 422 flow [2023-08-03 21:11:29,293 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 200 transitions, 422 flow [2023-08-03 21:11:29,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 200 transitions, 422 flow [2023-08-03 21:11:29,376 INFO L124 PetriNetUnfolderBase]: 45/375 cut-off events. [2023-08-03 21:11:29,376 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 21:11:29,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 375 events. 45/375 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1275 event pairs, 0 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 201. Up to 8 conditions per place. [2023-08-03 21:11:29,386 INFO L119 LiptonReduction]: Number of co-enabled transitions 8386 [2023-08-03 21:11:33,801 INFO L134 LiptonReduction]: Checked pairs total: 11483 [2023-08-03 21:11:33,801 INFO L136 LiptonReduction]: Total number of compositions: 208 [2023-08-03 21:11:33,814 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:11:33,820 INFO L357 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=LoopsAndPotentialCycles, 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;@39c9a96d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:11:33,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:11:33,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:11:33,824 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 21:11:33,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:11:33,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:33,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 21:11:33,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:11:33,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:33,830 INFO L85 PathProgramCache]: Analyzing trace with hash -2038358687, now seen corresponding path program 1 times [2023-08-03 21:11:33,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:33,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173550704] [2023-08-03 21:11:33,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:33,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:11:34,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:34,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173550704] [2023-08-03 21:11:34,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173550704] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:11:34,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:11:34,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:11:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690235911] [2023-08-03 21:11:34,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:11:34,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:11:34,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:34,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:11:34,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:11:34,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 408 [2023-08-03 21:11:34,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 41 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:34,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 408 [2023-08-03 21:11:34,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:34,257 INFO L124 PetriNetUnfolderBase]: 705/1105 cut-off events. [2023-08-03 21:11:34,257 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-08-03 21:11:34,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 1105 events. 705/1105 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4909 event pairs, 460 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 1909. Up to 1065 conditions per place. [2023-08-03 21:11:34,269 INFO L140 encePairwiseOnDemand]: 401/408 looper letters, 33 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-08-03 21:11:34,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 174 flow [2023-08-03 21:11:34,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:11:34,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:11:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2023-08-03 21:11:34,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45669934640522875 [2023-08-03 21:11:34,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2023-08-03 21:11:34,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2023-08-03 21:11:34,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:34,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2023-08-03 21:11:34,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 408.0) internal successors, (1632), 4 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 408.0) internal successors, (1632), 4 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,308 INFO L175 Difference]: Start difference. First operand has 36 places, 41 transitions, 104 flow. Second operand 3 states and 559 transitions. [2023-08-03 21:11:34,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 174 flow [2023-08-03 21:11:34,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:11:34,314 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 104 flow [2023-08-03 21:11:34,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=408, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2023-08-03 21:11:34,319 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 2 predicate places. [2023-08-03 21:11:34,319 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 104 flow [2023-08-03 21:11:34,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:34,320 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-03 21:11:34,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 21:11:34,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:11:34,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:34,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1309343435, now seen corresponding path program 1 times [2023-08-03 21:11:34,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:34,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387915348] [2023-08-03 21:11:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:34,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:34,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:11:34,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:34,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387915348] [2023-08-03 21:11:34,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387915348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:11:34,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:11:34,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:11:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368216618] [2023-08-03 21:11:34,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:11:34,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:11:34,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:34,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:11:34,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:11:34,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 408 [2023-08-03 21:11:34,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:34,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 408 [2023-08-03 21:11:34,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:34,647 INFO L124 PetriNetUnfolderBase]: 705/1108 cut-off events. [2023-08-03 21:11:34,648 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-08-03 21:11:34,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2249 conditions, 1108 events. 705/1108 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4930 event pairs, 462 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 1919. Up to 1071 conditions per place. [2023-08-03 21:11:34,655 INFO L140 encePairwiseOnDemand]: 405/408 looper letters, 30 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-03 21:11:34,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 170 flow [2023-08-03 21:11:34,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:11:34,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:11:34,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2023-08-03 21:11:34,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2023-08-03 21:11:34,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 552 transitions. [2023-08-03 21:11:34,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 552 transitions. [2023-08-03 21:11:34,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:34,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 552 transitions. [2023-08-03 21:11:34,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 408.0) internal successors, (1632), 4 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 408.0) internal successors, (1632), 4 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,664 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 104 flow. Second operand 3 states and 552 transitions. [2023-08-03 21:11:34,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 170 flow [2023-08-03 21:11:34,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 21:11:34,668 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 112 flow [2023-08-03 21:11:34,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=408, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2023-08-03 21:11:34,670 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-03 21:11:34,671 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 112 flow [2023-08-03 21:11:34,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:34,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:34,676 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:34,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 21:11:34,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:11:34,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:34,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2006255006, now seen corresponding path program 1 times [2023-08-03 21:11:34,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:34,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829383884] [2023-08-03 21:11:34,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:34,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:11:34,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 21:11:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 21:11:34,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 21:11:34,816 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 21:11:34,816 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-03 21:11:34,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-03 21:11:34,819 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-03 21:11:34,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 21:11:34,819 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-03 21:11:34,821 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 21:11:34,822 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 21:11:34,870 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-03 21:11:34,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 270 transitions, 588 flow [2023-08-03 21:11:35,015 INFO L124 PetriNetUnfolderBase]: 159/1099 cut-off events. [2023-08-03 21:11:35,016 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 21:11:35,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 1099 events. 159/1099 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6256 event pairs, 1 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 662. Up to 32 conditions per place. [2023-08-03 21:11:35,028 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 270 transitions, 588 flow [2023-08-03 21:11:35,036 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 270 transitions, 588 flow [2023-08-03 21:11:35,036 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 21:11:35,036 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 270 transitions, 588 flow [2023-08-03 21:11:35,036 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 244 places, 270 transitions, 588 flow [2023-08-03 21:11:35,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 270 transitions, 588 flow [2023-08-03 21:11:35,173 INFO L124 PetriNetUnfolderBase]: 159/1099 cut-off events. [2023-08-03 21:11:35,173 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-03 21:11:35,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 1099 events. 159/1099 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6256 event pairs, 1 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 662. Up to 32 conditions per place. [2023-08-03 21:11:35,224 INFO L119 LiptonReduction]: Number of co-enabled transitions 26192 [2023-08-03 21:11:39,847 INFO L134 LiptonReduction]: Checked pairs total: 49982 [2023-08-03 21:11:39,848 INFO L136 LiptonReduction]: Total number of compositions: 257 [2023-08-03 21:11:39,850 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 21:11:39,850 INFO L357 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=LoopsAndPotentialCycles, 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;@39c9a96d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 21:11:39,850 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-03 21:11:39,853 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 21:11:39,853 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2023-08-03 21:11:39,853 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 21:11:39,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:39,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 21:11:39,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:11:39,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1611272967, now seen corresponding path program 1 times [2023-08-03 21:11:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715995640] [2023-08-03 21:11:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:11:39,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:39,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715995640] [2023-08-03 21:11:39,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715995640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:11:39,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:11:39,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 21:11:39,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389220186] [2023-08-03 21:11:39,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:11:39,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:11:39,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:39,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:11:39,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:11:39,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 527 [2023-08-03 21:11:39,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:39,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:39,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 527 [2023-08-03 21:11:39,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:11:57,419 INFO L124 PetriNetUnfolderBase]: 223255/278475 cut-off events. [2023-08-03 21:11:57,419 INFO L125 PetriNetUnfolderBase]: For 17765/17765 co-relation queries the response was YES. [2023-08-03 21:11:57,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562651 conditions, 278475 events. 223255/278475 cut-off events. For 17765/17765 co-relation queries the response was YES. Maximal size of possible extension queue 6534. Compared 1583534 event pairs, 130160 based on Foata normal form. 11485/198990 useless extension candidates. Maximal degree in co-relation 185076. Up to 276303 conditions per place. [2023-08-03 21:11:58,937 INFO L140 encePairwiseOnDemand]: 519/527 looper letters, 61 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-03 21:11:58,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 320 flow [2023-08-03 21:11:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:11:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:11:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 763 transitions. [2023-08-03 21:11:58,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48260594560404807 [2023-08-03 21:11:58,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 763 transitions. [2023-08-03 21:11:58,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 763 transitions. [2023-08-03 21:11:58,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:11:58,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 763 transitions. [2023-08-03 21:11:58,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:58,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:58,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:58,945 INFO L175 Difference]: Start difference. First operand has 65 places, 73 transitions, 194 flow. Second operand 3 states and 763 transitions. [2023-08-03 21:11:58,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 320 flow [2023-08-03 21:11:58,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 320 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:11:58,953 INFO L231 Difference]: Finished difference. Result has 66 places, 68 transitions, 194 flow [2023-08-03 21:11:58,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=66, PETRI_TRANSITIONS=68} [2023-08-03 21:11:58,956 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 1 predicate places. [2023-08-03 21:11:58,957 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 68 transitions, 194 flow [2023-08-03 21:11:58,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:58,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:11:58,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:11:58,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-03 21:11:58,958 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:11:58,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:11:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash -183198435, now seen corresponding path program 1 times [2023-08-03 21:11:58,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:11:58,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535577825] [2023-08-03 21:11:58,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:58,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:11:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 21:11:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:11:59,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535577825] [2023-08-03 21:11:59,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535577825] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:11:59,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059442050] [2023-08-03 21:11:59,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:11:59,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:11:59,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:11:59,041 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:11:59,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 21:11:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:11:59,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:11:59,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:11:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:11:59,148 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:11:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059442050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:11:59,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:11:59,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 21:11:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002987584] [2023-08-03 21:11:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:11:59,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:11:59,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:11:59,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:11:59,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:11:59,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 527 [2023-08-03 21:11:59,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 68 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:11:59,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:11:59,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 527 [2023-08-03 21:11:59,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:12:14,665 INFO L124 PetriNetUnfolderBase]: 221955/278677 cut-off events. [2023-08-03 21:12:14,665 INFO L125 PetriNetUnfolderBase]: For 15573/15573 co-relation queries the response was YES. [2023-08-03 21:12:15,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 561808 conditions, 278677 events. 221955/278677 cut-off events. For 15573/15573 co-relation queries the response was YES. Maximal size of possible extension queue 6615. Compared 1630156 event pairs, 115340 based on Foata normal form. 0/188095 useless extension candidates. Maximal degree in co-relation 561762. Up to 273217 conditions per place. [2023-08-03 21:12:16,496 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 78 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2023-08-03 21:12:16,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 90 transitions, 398 flow [2023-08-03 21:12:16,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:12:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:12:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2023-08-03 21:12:16,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48893105629348516 [2023-08-03 21:12:16,499 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 773 transitions. [2023-08-03 21:12:16,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 773 transitions. [2023-08-03 21:12:16,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:12:16,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 773 transitions. [2023-08-03 21:12:16,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:16,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:16,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:16,505 INFO L175 Difference]: Start difference. First operand has 66 places, 68 transitions, 194 flow. Second operand 3 states and 773 transitions. [2023-08-03 21:12:16,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 90 transitions, 398 flow [2023-08-03 21:12:16,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:12:16,515 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 204 flow [2023-08-03 21:12:16,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2023-08-03 21:12:16,516 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 3 predicate places. [2023-08-03 21:12:16,516 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 204 flow [2023-08-03 21:12:16,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:16,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:12:16,517 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-03 21:12:16,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 21:12:16,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:12:16,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:12:16,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:12:16,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1285151851, now seen corresponding path program 1 times [2023-08-03 21:12:16,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:12:16,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398436513] [2023-08-03 21:12:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:12:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:12:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:12:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:12:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:12:16,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398436513] [2023-08-03 21:12:16,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398436513] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:12:16,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:12:16,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 21:12:16,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954155008] [2023-08-03 21:12:16,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:12:16,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:12:16,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:12:16,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:12:16,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:12:16,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 527 [2023-08-03 21:12:16,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:16,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:12:16,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 527 [2023-08-03 21:12:16,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:12:31,854 INFO L124 PetriNetUnfolderBase]: 223207/279560 cut-off events. [2023-08-03 21:12:31,854 INFO L125 PetriNetUnfolderBase]: For 27172/27172 co-relation queries the response was YES. [2023-08-03 21:12:32,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574096 conditions, 279560 events. 223207/279560 cut-off events. For 27172/27172 co-relation queries the response was YES. Maximal size of possible extension queue 6633. Compared 1614793 event pairs, 157402 based on Foata normal form. 1/193556 useless extension candidates. Maximal degree in co-relation 188861. Up to 276260 conditions per place. [2023-08-03 21:12:33,524 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 58 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-03 21:12:33,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 326 flow [2023-08-03 21:12:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:12:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:12:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2023-08-03 21:12:33,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756483238456673 [2023-08-03 21:12:33,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2023-08-03 21:12:33,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2023-08-03 21:12:33,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:12:33,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2023-08-03 21:12:33,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:33,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:33,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:33,533 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 204 flow. Second operand 3 states and 752 transitions. [2023-08-03 21:12:33,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 326 flow [2023-08-03 21:12:33,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 70 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:12:33,549 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 214 flow [2023-08-03 21:12:33,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2023-08-03 21:12:33,550 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 5 predicate places. [2023-08-03 21:12:33,550 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 214 flow [2023-08-03 21:12:33,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:33,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:12:33,551 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-03 21:12:33,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 21:12:33,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:12:33,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:12:33,552 INFO L85 PathProgramCache]: Analyzing trace with hash -788532999, now seen corresponding path program 1 times [2023-08-03 21:12:33,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:12:33,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520914964] [2023-08-03 21:12:33,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:12:33,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:12:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:12:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:12:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:12:33,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520914964] [2023-08-03 21:12:33,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520914964] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:12:33,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138234827] [2023-08-03 21:12:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:12:33,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:12:33,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:12:33,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:12:33,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 21:12:33,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:12:33,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:12:33,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:12:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 21:12:33,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:12:33,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138234827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:12:33,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:12:33,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:12:33,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812179704] [2023-08-03 21:12:33,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:12:33,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:12:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:12:33,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:12:33,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:12:33,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 527 [2023-08-03 21:12:33,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 214 flow. Second operand has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:33,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:12:33,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 527 [2023-08-03 21:12:33,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:12:48,558 INFO L124 PetriNetUnfolderBase]: 223169/279469 cut-off events. [2023-08-03 21:12:48,558 INFO L125 PetriNetUnfolderBase]: For 26941/26941 co-relation queries the response was YES. [2023-08-03 21:12:49,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573483 conditions, 279469 events. 223169/279469 cut-off events. For 26941/26941 co-relation queries the response was YES. Maximal size of possible extension queue 6641. Compared 1610784 event pairs, 90308 based on Foata normal form. 30/193491 useless extension candidates. Maximal degree in co-relation 573466. Up to 276095 conditions per place. [2023-08-03 21:12:49,980 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 71 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2023-08-03 21:12:49,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 392 flow [2023-08-03 21:12:49,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:12:49,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:12:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1224 transitions. [2023-08-03 21:12:49,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645161290322581 [2023-08-03 21:12:49,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1224 transitions. [2023-08-03 21:12:49,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1224 transitions. [2023-08-03 21:12:49,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:12:49,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1224 transitions. [2023-08-03 21:12:49,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 244.8) internal successors, (1224), 5 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:49,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 527.0) internal successors, (3162), 6 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:49,991 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 527.0) internal successors, (3162), 6 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:49,991 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 214 flow. Second operand 5 states and 1224 transitions. [2023-08-03 21:12:49,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 392 flow [2023-08-03 21:12:50,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 84 transitions, 382 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 21:12:50,003 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 221 flow [2023-08-03 21:12:50,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2023-08-03 21:12:50,003 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 7 predicate places. [2023-08-03 21:12:50,004 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 221 flow [2023-08-03 21:12:50,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:50,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:12:50,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:12:50,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 21:12:50,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-03 21:12:50,209 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:12:50,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:12:50,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2059885664, now seen corresponding path program 1 times [2023-08-03 21:12:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:12:50,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483767498] [2023-08-03 21:12:50,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:12:50,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:12:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:12:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 21:12:50,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:12:50,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483767498] [2023-08-03 21:12:50,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483767498] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:12:50,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404611009] [2023-08-03 21:12:50,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:12:50,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:12:50,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:12:50,268 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:12:50,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 21:12:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:12:50,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:12:50,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:12:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-03 21:12:50,355 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:12:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404611009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:12:50,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:12:50,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-03 21:12:50,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260243938] [2023-08-03 21:12:50,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:12:50,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:12:50,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:12:50,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:12:50,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:12:50,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 527 [2023-08-03 21:12:50,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:12:50,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:12:50,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 527 [2023-08-03 21:12:50,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:13:02,516 INFO L124 PetriNetUnfolderBase]: 164051/209535 cut-off events. [2023-08-03 21:13:02,516 INFO L125 PetriNetUnfolderBase]: For 15409/15409 co-relation queries the response was YES. [2023-08-03 21:13:03,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430056 conditions, 209535 events. 164051/209535 cut-off events. For 15409/15409 co-relation queries the response was YES. Maximal size of possible extension queue 5195. Compared 1271972 event pairs, 77555 based on Foata normal form. 0/150383 useless extension candidates. Maximal degree in co-relation 430032. Up to 138964 conditions per place. [2023-08-03 21:13:03,919 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 95 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2023-08-03 21:13:03,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 497 flow [2023-08-03 21:13:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:13:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:13:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2023-08-03 21:13:03,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49778621125869704 [2023-08-03 21:13:03,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 787 transitions. [2023-08-03 21:13:03,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 787 transitions. [2023-08-03 21:13:03,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:13:03,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 787 transitions. [2023-08-03 21:13:03,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:03,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:03,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:03,927 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 221 flow. Second operand 3 states and 787 transitions. [2023-08-03 21:13:03,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 497 flow [2023-08-03 21:13:03,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 106 transitions, 490 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 21:13:03,939 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 226 flow [2023-08-03 21:13:03,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2023-08-03 21:13:03,941 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 8 predicate places. [2023-08-03 21:13:03,941 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 226 flow [2023-08-03 21:13:03,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:03,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:13:03,941 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:13:03,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 21:13:04,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:04,146 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:13:04,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:13:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1626820924, now seen corresponding path program 1 times [2023-08-03 21:13:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:13:04,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477437626] [2023-08-03 21:13:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:13:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 21:13:04,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:13:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477437626] [2023-08-03 21:13:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477437626] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:13:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508581918] [2023-08-03 21:13:04,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:04,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:04,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:13:04,250 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:13:04,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 21:13:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:04,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:13:04,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:13:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 21:13:04,422 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:13:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 21:13:04,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508581918] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:13:04,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:13:04,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:13:04,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384941842] [2023-08-03 21:13:04,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:13:04,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:13:04,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:13:04,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:13:04,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:13:04,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 527 [2023-08-03 21:13:04,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:04,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:13:04,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 527 [2023-08-03 21:13:04,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:13:15,187 INFO L124 PetriNetUnfolderBase]: 151958/191734 cut-off events. [2023-08-03 21:13:15,187 INFO L125 PetriNetUnfolderBase]: For 42077/42077 co-relation queries the response was YES. [2023-08-03 21:13:15,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406376 conditions, 191734 events. 151958/191734 cut-off events. For 42077/42077 co-relation queries the response was YES. Maximal size of possible extension queue 4859. Compared 1090456 event pairs, 61690 based on Foata normal form. 5/138326 useless extension candidates. Maximal degree in co-relation 406352. Up to 189588 conditions per place. [2023-08-03 21:13:16,167 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 72 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2023-08-03 21:13:16,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 398 flow [2023-08-03 21:13:16,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:13:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:13:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 993 transitions. [2023-08-03 21:13:16,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47106261859582543 [2023-08-03 21:13:16,169 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 993 transitions. [2023-08-03 21:13:16,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 993 transitions. [2023-08-03 21:13:16,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:13:16,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 993 transitions. [2023-08-03 21:13:16,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 248.25) internal successors, (993), 4 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:16,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:16,176 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:16,176 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 226 flow. Second operand 4 states and 993 transitions. [2023-08-03 21:13:16,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 398 flow [2023-08-03 21:13:16,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 84 transitions, 396 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:13:16,547 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 222 flow [2023-08-03 21:13:16,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-08-03 21:13:16,548 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2023-08-03 21:13:16,548 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 222 flow [2023-08-03 21:13:16,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:16,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:13:16,549 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:13:16,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 21:13:16,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:16,753 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:13:16,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:13:16,753 INFO L85 PathProgramCache]: Analyzing trace with hash 140450751, now seen corresponding path program 1 times [2023-08-03 21:13:16,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:13:16,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604353403] [2023-08-03 21:13:16,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:13:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:16,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 21:13:16,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:13:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604353403] [2023-08-03 21:13:16,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604353403] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:13:16,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689070121] [2023-08-03 21:13:16,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:16,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:16,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:13:16,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:13:16,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 21:13:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:16,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 21:13:16,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:13:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-03 21:13:16,939 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:13:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689070121] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:13:16,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:13:16,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 21:13:16,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416812201] [2023-08-03 21:13:16,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:13:16,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:13:16,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:13:16,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:13:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 21:13:16,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 527 [2023-08-03 21:13:16,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:16,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:13:16,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 527 [2023-08-03 21:13:16,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:13:25,886 INFO L124 PetriNetUnfolderBase]: 131962/169277 cut-off events. [2023-08-03 21:13:25,887 INFO L125 PetriNetUnfolderBase]: For 12044/12044 co-relation queries the response was YES. [2023-08-03 21:13:26,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357022 conditions, 169277 events. 131962/169277 cut-off events. For 12044/12044 co-relation queries the response was YES. Maximal size of possible extension queue 4317. Compared 1024881 event pairs, 2591 based on Foata normal form. 3960/126682 useless extension candidates. Maximal degree in co-relation 356997. Up to 143074 conditions per place. [2023-08-03 21:13:26,770 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 118 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2023-08-03 21:13:26,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 130 transitions, 586 flow [2023-08-03 21:13:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 21:13:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 21:13:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1270 transitions. [2023-08-03 21:13:26,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819734345351044 [2023-08-03 21:13:26,949 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1270 transitions. [2023-08-03 21:13:26,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1270 transitions. [2023-08-03 21:13:26,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:13:26,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1270 transitions. [2023-08-03 21:13:26,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:26,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 527.0) internal successors, (3162), 6 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:26,956 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 527.0) internal successors, (3162), 6 states have internal predecessors, (3162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:26,956 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 222 flow. Second operand 5 states and 1270 transitions. [2023-08-03 21:13:26,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 130 transitions, 586 flow [2023-08-03 21:13:30,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 130 transitions, 574 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-03 21:13:30,042 INFO L231 Difference]: Finished difference. Result has 75 places, 70 transitions, 227 flow [2023-08-03 21:13:30,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=75, PETRI_TRANSITIONS=70} [2023-08-03 21:13:30,043 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2023-08-03 21:13:30,043 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 70 transitions, 227 flow [2023-08-03 21:13:30,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:30,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:13:30,044 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:13:30,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-03 21:13:30,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-03 21:13:30,245 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:13:30,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:13:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash -260665139, now seen corresponding path program 1 times [2023-08-03 21:13:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:13:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966494450] [2023-08-03 21:13:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:13:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 21:13:30,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:13:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966494450] [2023-08-03 21:13:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966494450] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:13:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788987065] [2023-08-03 21:13:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:30,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:30,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:13:30,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:13:30,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 21:13:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:30,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 21:13:30,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:13:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 21:13:30,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:13:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788987065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:13:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:13:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-03 21:13:30,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809885250] [2023-08-03 21:13:30,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:13:30,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:13:30,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:13:30,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:13:30,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:13:30,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 527 [2023-08-03 21:13:30,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 70 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:30,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:13:30,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 527 [2023-08-03 21:13:30,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:13:39,372 INFO L124 PetriNetUnfolderBase]: 127044/161566 cut-off events. [2023-08-03 21:13:39,373 INFO L125 PetriNetUnfolderBase]: For 61964/61964 co-relation queries the response was YES. [2023-08-03 21:13:39,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355527 conditions, 161566 events. 127044/161566 cut-off events. For 61964/61964 co-relation queries the response was YES. Maximal size of possible extension queue 4033. Compared 931242 event pairs, 77104 based on Foata normal form. 0/118419 useless extension candidates. Maximal degree in co-relation 355502. Up to 135102 conditions per place. [2023-08-03 21:13:40,453 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 96 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2023-08-03 21:13:40,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 503 flow [2023-08-03 21:13:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:13:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:13:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2023-08-03 21:13:40,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49778621125869704 [2023-08-03 21:13:40,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 787 transitions. [2023-08-03 21:13:40,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 787 transitions. [2023-08-03 21:13:40,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:13:40,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 787 transitions. [2023-08-03 21:13:40,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:40,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:40,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:40,460 INFO L175 Difference]: Start difference. First operand has 75 places, 70 transitions, 227 flow. Second operand 3 states and 787 transitions. [2023-08-03 21:13:40,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 503 flow [2023-08-03 21:13:40,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 496 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 21:13:40,688 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 232 flow [2023-08-03 21:13:40,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2023-08-03 21:13:40,689 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 11 predicate places. [2023-08-03 21:13:40,689 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 232 flow [2023-08-03 21:13:40,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:40,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:13:40,690 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:13:40,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 21:13:40,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:40,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:13:40,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:13:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1840035614, now seen corresponding path program 1 times [2023-08-03 21:13:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:13:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146976082] [2023-08-03 21:13:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:13:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:40,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 21:13:40,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:13:40,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146976082] [2023-08-03 21:13:40,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146976082] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:13:40,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448400991] [2023-08-03 21:13:40,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:40,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:40,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:13:40,944 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:13:40,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 21:13:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:41,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:13:41,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:13:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 21:13:41,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:13:41,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-03 21:13:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448400991] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:13:41,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:13:41,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:13:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301589338] [2023-08-03 21:13:41,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:13:41,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:13:41,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:13:41,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:13:41,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:13:41,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 527 [2023-08-03 21:13:41,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 235.2) internal successors, (1176), 5 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:41,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:13:41,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 527 [2023-08-03 21:13:41,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:13:49,958 INFO L124 PetriNetUnfolderBase]: 122824/157946 cut-off events. [2023-08-03 21:13:49,958 INFO L125 PetriNetUnfolderBase]: For 33432/33432 co-relation queries the response was YES. [2023-08-03 21:13:50,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344699 conditions, 157946 events. 122824/157946 cut-off events. For 33432/33432 co-relation queries the response was YES. Maximal size of possible extension queue 4098. Compared 946127 event pairs, 35919 based on Foata normal form. 360/117311 useless extension candidates. Maximal degree in co-relation 344673. Up to 132046 conditions per place. [2023-08-03 21:13:51,119 INFO L140 encePairwiseOnDemand]: 524/527 looper letters, 110 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2023-08-03 21:13:51,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 121 transitions, 554 flow [2023-08-03 21:13:51,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:13:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:13:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1030 transitions. [2023-08-03 21:13:51,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48861480075901326 [2023-08-03 21:13:51,122 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1030 transitions. [2023-08-03 21:13:51,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1030 transitions. [2023-08-03 21:13:51,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:13:51,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1030 transitions. [2023-08-03 21:13:51,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 257.5) internal successors, (1030), 4 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:51,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:51,127 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:51,127 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 232 flow. Second operand 4 states and 1030 transitions. [2023-08-03 21:13:51,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 121 transitions, 554 flow [2023-08-03 21:13:59,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 121 transitions, 552 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:13:59,040 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 228 flow [2023-08-03 21:13:59,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2023-08-03 21:13:59,041 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 13 predicate places. [2023-08-03 21:13:59,041 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 228 flow [2023-08-03 21:13:59,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.2) internal successors, (1176), 5 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:59,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:13:59,041 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:13:59,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-03 21:13:59,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:59,246 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:13:59,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:13:59,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1712434336, now seen corresponding path program 1 times [2023-08-03 21:13:59,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:13:59,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308340501] [2023-08-03 21:13:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:13:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 21:13:59,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:13:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308340501] [2023-08-03 21:13:59,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308340501] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:13:59,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138855871] [2023-08-03 21:13:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:13:59,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:13:59,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:13:59,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:13:59,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 21:13:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:13:59,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:13:59,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:13:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 21:13:59,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:13:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 21:13:59,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138855871] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:13:59,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:13:59,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 21:13:59,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681493151] [2023-08-03 21:13:59,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:13:59,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:13:59,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:13:59,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:13:59,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:13:59,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 527 [2023-08-03 21:13:59,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:13:59,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:13:59,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 527 [2023-08-03 21:13:59,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:14:06,720 INFO L124 PetriNetUnfolderBase]: 104027/132716 cut-off events. [2023-08-03 21:14:06,720 INFO L125 PetriNetUnfolderBase]: For 53895/53895 co-relation queries the response was YES. [2023-08-03 21:14:07,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293334 conditions, 132716 events. 104027/132716 cut-off events. For 53895/53895 co-relation queries the response was YES. Maximal size of possible extension queue 3422. Compared 771465 event pairs, 28197 based on Foata normal form. 2142/99601 useless extension candidates. Maximal degree in co-relation 293308. Up to 55660 conditions per place. [2023-08-03 21:14:07,691 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 124 selfloop transitions, 4 changer transitions 0/136 dead transitions. [2023-08-03 21:14:07,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 136 transitions, 624 flow [2023-08-03 21:14:07,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:14:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:14:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1045 transitions. [2023-08-03 21:14:07,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49573055028463 [2023-08-03 21:14:07,694 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1045 transitions. [2023-08-03 21:14:07,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1045 transitions. [2023-08-03 21:14:07,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:14:07,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1045 transitions. [2023-08-03 21:14:07,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 261.25) internal successors, (1045), 4 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:07,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:07,699 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:07,699 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 228 flow. Second operand 4 states and 1045 transitions. [2023-08-03 21:14:07,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 136 transitions, 624 flow [2023-08-03 21:14:08,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 136 transitions, 618 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 21:14:08,270 INFO L231 Difference]: Finished difference. Result has 80 places, 71 transitions, 242 flow [2023-08-03 21:14:08,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=80, PETRI_TRANSITIONS=71} [2023-08-03 21:14:08,271 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 15 predicate places. [2023-08-03 21:14:08,271 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 71 transitions, 242 flow [2023-08-03 21:14:08,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.4) internal successors, (1177), 5 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:08,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:14:08,272 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:14:08,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-03 21:14:08,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-03 21:14:08,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:14:08,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:14:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1368433440, now seen corresponding path program 1 times [2023-08-03 21:14:08,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:14:08,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089144474] [2023-08-03 21:14:08,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:14:08,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:14:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:14:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 21:14:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:14:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089144474] [2023-08-03 21:14:08,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089144474] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:14:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434520182] [2023-08-03 21:14:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:14:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:14:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:14:08,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:14:08,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 21:14:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:14:08,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 21:14:08,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:14:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 21:14:08,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 21:14:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 21:14:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434520182] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 21:14:08,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 21:14:08,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 21:14:08,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481867268] [2023-08-03 21:14:08,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 21:14:08,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:14:08,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:14:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:14:08,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 21:14:08,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 527 [2023-08-03 21:14:08,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 71 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 235.8) internal successors, (1179), 5 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:08,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:14:08,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 527 [2023-08-03 21:14:08,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:14:16,412 INFO L124 PetriNetUnfolderBase]: 103987/131903 cut-off events. [2023-08-03 21:14:16,412 INFO L125 PetriNetUnfolderBase]: For 76301/76301 co-relation queries the response was YES. [2023-08-03 21:14:16,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306659 conditions, 131903 events. 103987/131903 cut-off events. For 76301/76301 co-relation queries the response was YES. Maximal size of possible extension queue 3406. Compared 739375 event pairs, 72710 based on Foata normal form. 35/96508 useless extension candidates. Maximal degree in co-relation 306632. Up to 126401 conditions per place. [2023-08-03 21:14:17,376 INFO L140 encePairwiseOnDemand]: 523/527 looper letters, 118 selfloop transitions, 3 changer transitions 8/137 dead transitions. [2023-08-03 21:14:17,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 137 transitions, 640 flow [2023-08-03 21:14:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:14:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:14:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1045 transitions. [2023-08-03 21:14:17,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49573055028463 [2023-08-03 21:14:17,379 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1045 transitions. [2023-08-03 21:14:17,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1045 transitions. [2023-08-03 21:14:17,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:14:17,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1045 transitions. [2023-08-03 21:14:17,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 261.25) internal successors, (1045), 4 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:17,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:17,384 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:17,385 INFO L175 Difference]: Start difference. First operand has 80 places, 71 transitions, 242 flow. Second operand 4 states and 1045 transitions. [2023-08-03 21:14:17,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 137 transitions, 640 flow [2023-08-03 21:14:18,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 137 transitions, 636 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-03 21:14:18,104 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 242 flow [2023-08-03 21:14:18,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2023-08-03 21:14:18,104 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 19 predicate places. [2023-08-03 21:14:18,104 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 242 flow [2023-08-03 21:14:18,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 235.8) internal successors, (1179), 5 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:18,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:14:18,105 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:14:18,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-03 21:14:18,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-03 21:14:18,309 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:14:18,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:14:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1362936287, now seen corresponding path program 1 times [2023-08-03 21:14:18,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:14:18,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141057054] [2023-08-03 21:14:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:14:18,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:14:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:14:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-08-03 21:14:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:14:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141057054] [2023-08-03 21:14:18,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141057054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:14:18,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:14:18,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 21:14:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397559643] [2023-08-03 21:14:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:14:18,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 21:14:18,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:14:18,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 21:14:18,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 21:14:18,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 527 [2023-08-03 21:14:18,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:18,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:14:18,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 527 [2023-08-03 21:14:18,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:14:24,518 INFO L124 PetriNetUnfolderBase]: 85180/108240 cut-off events. [2023-08-03 21:14:24,518 INFO L125 PetriNetUnfolderBase]: For 65694/65694 co-relation queries the response was YES. [2023-08-03 21:14:25,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252263 conditions, 108240 events. 85180/108240 cut-off events. For 65694/65694 co-relation queries the response was YES. Maximal size of possible extension queue 2852. Compared 614147 event pairs, 12196 based on Foata normal form. 1/86067 useless extension candidates. Maximal degree in co-relation 252234. Up to 99224 conditions per place. [2023-08-03 21:14:25,522 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 96 selfloop transitions, 5 changer transitions 1/110 dead transitions. [2023-08-03 21:14:25,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 110 transitions, 621 flow [2023-08-03 21:14:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 21:14:25,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 21:14:25,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2023-08-03 21:14:25,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864010120177103 [2023-08-03 21:14:25,525 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 769 transitions. [2023-08-03 21:14:25,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 769 transitions. [2023-08-03 21:14:25,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:14:25,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 769 transitions. [2023-08-03 21:14:25,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:25,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:25,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 527.0) internal successors, (2108), 4 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:25,529 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 242 flow. Second operand 3 states and 769 transitions. [2023-08-03 21:14:25,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 110 transitions, 621 flow [2023-08-03 21:14:26,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 110 transitions, 605 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-03 21:14:26,047 INFO L231 Difference]: Finished difference. Result has 82 places, 72 transitions, 267 flow [2023-08-03 21:14:26,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=82, PETRI_TRANSITIONS=72} [2023-08-03 21:14:26,047 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 17 predicate places. [2023-08-03 21:14:26,048 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 72 transitions, 267 flow [2023-08-03 21:14:26,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:26,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:14:26,048 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:14:26,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-03 21:14:26,048 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:14:26,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:14:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash 532174513, now seen corresponding path program 1 times [2023-08-03 21:14:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:14:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487706759] [2023-08-03 21:14:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:14:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:14:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:14:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 21:14:26,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:14:26,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487706759] [2023-08-03 21:14:26,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487706759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:14:26,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:14:26,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:14:26,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965541249] [2023-08-03 21:14:26,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:14:26,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:14:26,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:14:26,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:14:26,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:14:26,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 527 [2023-08-03 21:14:26,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:26,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:14:26,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 527 [2023-08-03 21:14:26,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:14:36,772 INFO L124 PetriNetUnfolderBase]: 126588/161167 cut-off events. [2023-08-03 21:14:36,773 INFO L125 PetriNetUnfolderBase]: For 94647/94647 co-relation queries the response was YES. [2023-08-03 21:14:37,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401280 conditions, 161167 events. 126588/161167 cut-off events. For 94647/94647 co-relation queries the response was YES. Maximal size of possible extension queue 4205. Compared 959972 event pairs, 21933 based on Foata normal form. 0/134744 useless extension candidates. Maximal degree in co-relation 401250. Up to 105207 conditions per place. [2023-08-03 21:14:37,835 INFO L140 encePairwiseOnDemand]: 520/527 looper letters, 143 selfloop transitions, 7 changer transitions 1/158 dead transitions. [2023-08-03 21:14:37,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 158 transitions, 913 flow [2023-08-03 21:14:37,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:14:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:14:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1037 transitions. [2023-08-03 21:14:37,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2023-08-03 21:14:37,838 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1037 transitions. [2023-08-03 21:14:37,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1037 transitions. [2023-08-03 21:14:37,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:14:37,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1037 transitions. [2023-08-03 21:14:37,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 259.25) internal successors, (1037), 4 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:37,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:37,843 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:37,843 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 267 flow. Second operand 4 states and 1037 transitions. [2023-08-03 21:14:37,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 158 transitions, 913 flow [2023-08-03 21:14:37,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 158 transitions, 904 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:14:37,956 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 324 flow [2023-08-03 21:14:37,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2023-08-03 21:14:37,956 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 22 predicate places. [2023-08-03 21:14:37,956 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 324 flow [2023-08-03 21:14:37,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:37,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:14:37,957 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:14:37,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-03 21:14:37,957 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:14:37,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:14:37,957 INFO L85 PathProgramCache]: Analyzing trace with hash -618570135, now seen corresponding path program 2 times [2023-08-03 21:14:37,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:14:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687463548] [2023-08-03 21:14:37,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:14:37,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:14:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:14:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-03 21:14:38,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:14:38,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687463548] [2023-08-03 21:14:38,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687463548] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 21:14:38,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008434116] [2023-08-03 21:14:38,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-03 21:14:38,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 21:14:38,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 21:14:38,066 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 21:14:38,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-03 21:14:38,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-03 21:14:38,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-03 21:14:38,181 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-03 21:14:38,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 21:14:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 21:14:38,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 21:14:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008434116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:14:38,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 21:14:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2023-08-03 21:14:38,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684901315] [2023-08-03 21:14:38,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:14:38,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 21:14:38,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:14:38,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 21:14:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-03 21:14:38,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 527 [2023-08-03 21:14:38,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 229.8) internal successors, (1149), 5 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:14:38,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:14:38,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 527 [2023-08-03 21:14:38,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:15:05,064 INFO L124 PetriNetUnfolderBase]: 286126/377010 cut-off events. [2023-08-03 21:15:05,064 INFO L125 PetriNetUnfolderBase]: For 367328/367331 co-relation queries the response was YES. [2023-08-03 21:15:06,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039929 conditions, 377010 events. 286126/377010 cut-off events. For 367328/367331 co-relation queries the response was YES. Maximal size of possible extension queue 8940. Compared 2615767 event pairs, 98259 based on Foata normal form. 13738/390700 useless extension candidates. Maximal degree in co-relation 1039897. Up to 145973 conditions per place. [2023-08-03 21:15:08,116 INFO L140 encePairwiseOnDemand]: 517/527 looper letters, 271 selfloop transitions, 20 changer transitions 5/302 dead transitions. [2023-08-03 21:15:08,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 302 transitions, 1846 flow [2023-08-03 21:15:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-03 21:15:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-03 21:15:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1582 transitions. [2023-08-03 21:15:08,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003162555344719 [2023-08-03 21:15:08,119 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1582 transitions. [2023-08-03 21:15:08,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1582 transitions. [2023-08-03 21:15:08,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:15:08,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1582 transitions. [2023-08-03 21:15:08,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 263.6666666666667) internal successors, (1582), 6 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:15:08,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 527.0) internal successors, (3689), 7 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:15:08,124 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 527.0) internal successors, (3689), 7 states have internal predecessors, (3689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:15:08,124 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 324 flow. Second operand 6 states and 1582 transitions. [2023-08-03 21:15:08,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 302 transitions, 1846 flow [2023-08-03 21:15:11,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 302 transitions, 1846 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:15:11,613 INFO L231 Difference]: Finished difference. Result has 96 places, 97 transitions, 551 flow [2023-08-03 21:15:11,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=551, PETRI_PLACES=96, PETRI_TRANSITIONS=97} [2023-08-03 21:15:11,613 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 31 predicate places. [2023-08-03 21:15:11,613 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 97 transitions, 551 flow [2023-08-03 21:15:11,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 229.8) internal successors, (1149), 5 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:15:11,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:15:11,614 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:15:11,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 21:15:11,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-03 21:15:11,818 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:15:11,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:15:11,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2066124515, now seen corresponding path program 1 times [2023-08-03 21:15:11,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:15:11,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573010971] [2023-08-03 21:15:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:15:11,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:15:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:15:11,937 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 21:15:11,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:15:11,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573010971] [2023-08-03 21:15:11,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573010971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:15:11,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:15:11,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:15:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422660737] [2023-08-03 21:15:11,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:15:11,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:15:11,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:15:11,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:15:11,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:15:11,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 527 [2023-08-03 21:15:11,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 97 transitions, 551 flow. Second operand has 4 states, 4 states have (on average 232.25) internal successors, (929), 4 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:15:11,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:15:11,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 527 [2023-08-03 21:15:11,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:15:27,378 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 208#L86-6true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:27,378 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-03 21:15:27,378 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 21:15:27,378 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 21:15:27,378 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:15:27,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, 208#L86-6true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:27,379 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-03 21:15:27,379 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 21:15:27,379 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:15:27,379 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:15:29,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 208#L86-6true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:29,644 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 21:15:29,644 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:15:29,644 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:15:29,645 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:15:29,645 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, 208#L86-6true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:29,645 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 21:15:29,646 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:15:29,646 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:15:29,646 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:15:30,079 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 208#L86-6true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 13#thread2EXITtrue, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:30,079 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 21:15:30,079 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:15:30,079 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:15:30,079 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:15:32,323 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 208#L86-6true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, 13#thread2EXITtrue, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:32,323 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:15:32,323 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:15:32,323 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:15:32,323 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:15:33,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 195#L86-11true, Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:33,078 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:15:33,078 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:15:33,078 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:15:33,078 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:15:33,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:33,081 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:15:33,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:15:33,081 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:15:33,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:15:33,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 214#L49-2true, 208#L86-6true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 234#L61-1true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:33,084 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:15:33,084 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:15:33,084 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:15:33,084 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:15:34,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 195#L86-11true, Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:34,911 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:15:34,911 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:34,911 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:34,911 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:34,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:34,914 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:15:34,914 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:34,914 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:34,914 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:34,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, 208#L86-6true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 234#L61-1true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:34,917 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:15:34,917 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:34,917 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:34,918 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 13#thread2EXITtrue, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:35,648 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,648 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,648 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,648 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:35,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:35,658 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,658 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:35,658 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,658 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:35,660 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,661 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:15:35,661 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:35,661 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:15:37,371 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, 13#thread2EXITtrue, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:37,371 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:15:37,371 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:37,371 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:37,371 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:37,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:37,692 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:15:37,692 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:37,692 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:37,692 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:37,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:37,695 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:15:37,695 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:37,695 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:37,695 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:38,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 13#thread2EXITtrue, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:38,120 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,120 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:38,120 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,120 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:38,131 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,131 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,131 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,131 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:38,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 234#L61-1true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:38,132 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,132 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:38,132 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:38,132 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 63#L59-2true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:38,133 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:15:38,133 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:38,133 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:15:38,133 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:15:39,651 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, 13#thread2EXITtrue, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:39,651 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,652 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,652 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,652 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:39,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:39,660 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,660 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,660 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:39,660 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 234#L61-1true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), 195#L86-11true, Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:39,661 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,661 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:39,661 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,661 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:39,662 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:39,662 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-03 21:15:39,662 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:39,662 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:39,662 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:40,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 136#L87-3true, thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 13#thread2EXITtrue, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:40,367 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-03 21:15:40,367 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:40,367 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:40,367 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:40,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 234#L61-1true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:40,375 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-03 21:15:40,375 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:15:40,375 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:40,375 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:15:41,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 136#L87-3true, thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, 13#thread2EXITtrue, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:41,697 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-03 21:15:41,697 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-03 21:15:41,697 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-03 21:15:41,697 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 21:15:41,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 234#L61-1true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:41,705 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-03 21:15:41,705 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 21:15:41,705 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 21:15:41,705 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-03 21:15:42,024 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 145#L87-4true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0NotInUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:42,024 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-03 21:15:42,024 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-03 21:15:42,024 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-03 21:15:42,024 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 21:15:42,030 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 234#L61-1true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:42,030 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-03 21:15:42,030 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 21:15:42,030 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-03 21:15:42,030 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 21:15:43,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 145#L87-4true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0NotInUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:43,178 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-03 21:15:43,178 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-03 21:15:43,178 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 21:15:43,178 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-03 21:15:43,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][106], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 234#L61-1true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-03 21:15:43,184 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-03 21:15:43,185 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 21:15:43,185 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-03 21:15:43,185 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 21:15:45,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0NotInUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:45,860 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-03 21:15:45,860 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-03 21:15:45,860 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-03 21:15:45,860 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-03 21:15:46,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0NotInUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:46,766 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-03 21:15:46,766 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 21:15:46,766 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-03 21:15:46,766 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-03 21:15:47,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0NotInUse, 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:47,110 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-03 21:15:47,110 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-03 21:15:47,110 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-03 21:15:47,110 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 21:15:48,100 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][93], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0NotInUse, 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:15:48,100 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-03 21:15:48,100 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-03 21:15:48,100 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-03 21:15:48,100 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:15:50,440 INFO L124 PetriNetUnfolderBase]: 337147/444194 cut-off events. [2023-08-03 21:15:50,441 INFO L125 PetriNetUnfolderBase]: For 958520/979171 co-relation queries the response was YES. [2023-08-03 21:15:53,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483614 conditions, 444194 events. 337147/444194 cut-off events. For 958520/979171 co-relation queries the response was YES. Maximal size of possible extension queue 11450. Compared 3123846 event pairs, 121476 based on Foata normal form. 20634/462640 useless extension candidates. Maximal degree in co-relation 1483577. Up to 346567 conditions per place. [2023-08-03 21:15:55,740 INFO L140 encePairwiseOnDemand]: 520/527 looper letters, 167 selfloop transitions, 7 changer transitions 7/191 dead transitions. [2023-08-03 21:15:55,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 191 transitions, 1452 flow [2023-08-03 21:15:55,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:15:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:15:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1020 transitions. [2023-08-03 21:15:55,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2023-08-03 21:15:55,743 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1020 transitions. [2023-08-03 21:15:55,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1020 transitions. [2023-08-03 21:15:55,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:15:55,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1020 transitions. [2023-08-03 21:15:55,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:15:55,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:15:55,747 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:15:55,747 INFO L175 Difference]: Start difference. First operand has 96 places, 97 transitions, 551 flow. Second operand 4 states and 1020 transitions. [2023-08-03 21:15:55,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 191 transitions, 1452 flow [2023-08-03 21:16:00,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 191 transitions, 1452 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 21:16:00,018 INFO L231 Difference]: Finished difference. Result has 101 places, 100 transitions, 593 flow [2023-08-03 21:16:00,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=593, PETRI_PLACES=101, PETRI_TRANSITIONS=100} [2023-08-03 21:16:00,018 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 36 predicate places. [2023-08-03 21:16:00,018 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 100 transitions, 593 flow [2023-08-03 21:16:00,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 232.25) internal successors, (929), 4 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:16:00,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:16:00,019 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:16:00,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-03 21:16:00,019 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:16:00,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:16:00,019 INFO L85 PathProgramCache]: Analyzing trace with hash 389450827, now seen corresponding path program 3 times [2023-08-03 21:16:00,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:16:00,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780712136] [2023-08-03 21:16:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:16:00,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:16:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:16:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-03 21:16:00,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:16:00,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780712136] [2023-08-03 21:16:00,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780712136] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:16:00,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:16:00,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:16:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833034424] [2023-08-03 21:16:00,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:16:00,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:16:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:16:00,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:16:00,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:16:00,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 527 [2023-08-03 21:16:00,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 100 transitions, 593 flow. Second operand has 4 states, 4 states have (on average 232.25) internal successors, (929), 4 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:16:00,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:16:00,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 527 [2023-08-03 21:16:00,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:16:13,446 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 30#L49-2true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, 208#L86-6true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:13,446 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-03 21:16:13,447 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 21:16:13,447 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-03 21:16:13,447 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-03 21:16:16,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, 174#thread1EXITtrue, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 208#L86-6true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:16,153 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-03 21:16:16,154 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 21:16:16,154 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:16:16,154 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:16:16,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, 208#L86-6true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:16,400 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-03 21:16:16,400 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:16:16,400 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:16:16,400 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 21:16:16,430 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 30#L49-2true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:16,430 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-03 21:16:16,430 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:16:16,430 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-03 21:16:16,430 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-03 21:16:18,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, 208#L86-6true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:18,741 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 21:16:18,741 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:18,741 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:18,741 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:16:18,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, 174#thread1EXITtrue, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:18,962 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 21:16:18,962 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:18,962 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:18,962 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:16:19,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:19,247 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 21:16:19,247 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:16:19,247 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:19,247 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:19,278 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 30#L49-2true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:19,278 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 21:16:19,278 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:19,278 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:16:19,278 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:19,279 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [30#L49-2true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:19,279 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-03 21:16:19,279 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:19,279 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-03 21:16:19,279 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-03 21:16:21,612 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:21,612 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:16:21,612 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:16:21,612 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:21,612 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,174 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, 174#thread1EXITtrue, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:22,174 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,174 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,174 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,174 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, 174#thread1EXITtrue, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:22,176 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,176 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,176 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,176 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,289 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [30#L49-2true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:22,290 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,290 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,290 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,290 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 63#L59-2true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:22,438 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,438 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,438 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,438 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:22,438 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,438 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,438 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,438 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [30#L49-2true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:22,473 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,473 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:22,473 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-03 21:16:22,473 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-03 21:16:24,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), 195#L86-11true, Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:24,753 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:16:24,753 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:24,753 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:24,753 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:16:24,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:24,754 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:16:24,754 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:24,754 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:16:24,754 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, 174#thread1EXITtrue, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:25,014 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,014 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,014 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,014 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,015 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, 174#thread1EXITtrue, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:25,015 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,015 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,015 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,015 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:25,073 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,073 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,073 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,073 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [30#L49-2true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:25,136 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,136 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,136 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,136 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,603 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:25,603 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,603 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:25,603 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-03 21:16:25,603 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-03 21:16:27,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:27,557 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:16:27,557 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:16:27,557 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:27,557 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:27,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, 63#L59-2true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 830#true, 214#L49-2true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:27,572 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:16:27,572 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:16:27,572 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:27,572 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:28,176 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, 174#thread1EXITtrue, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:28,177 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:16:28,177 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:16:28,177 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:28,177 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:28,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 145#L87-4true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:28,178 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:16:28,178 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:28,178 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:28,178 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:16:28,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [201#L50-1true, Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:28,236 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-03 21:16:28,236 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:28,236 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-03 21:16:28,237 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-03 21:16:30,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1InUse, Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 175#L51-1true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:30,586 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-03 21:16:30,586 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:16:30,586 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:16:30,586 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:16:30,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 145#L87-4true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1NotInUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0))]) [2023-08-03 21:16:30,883 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-03 21:16:30,883 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:16:30,883 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-03 21:16:30,883 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-03 21:16:33,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1)]) [2023-08-03 21:16:33,454 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-03 21:16:33,455 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-03 21:16:33,455 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 21:16:33,455 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-03 21:16:35,868 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 18#L87-8true, Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 1292#(= ~x2~0 ~x1~0), Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), 214#L49-2true, Black: 830#true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1)]) [2023-08-03 21:16:35,868 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-03 21:16:35,868 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 21:16:35,868 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 21:16:35,868 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-03 21:16:35,869 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][105], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 47#L37true, 91#$Ultimate##0true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), 214#L49-2true, Black: 830#true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 136#L87-3true, 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), thread1Thread1of2ForFork1NotInUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1471#true, Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1)]) [2023-08-03 21:16:35,869 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-03 21:16:35,869 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 21:16:35,869 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-03 21:16:35,869 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-03 21:16:39,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1269] L59-2-->L37: Formula: (and (< (mod |v_thread2Thread2of2ForFork0_~i~1#1_39| 4294967296) (mod (* v_~n~0_78 3) 4294967296)) (= |v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35| (ite (and (<= 0 v_~x2~0_166) (< v_~x2~0_166 v_~size~0_117)) 1 0))) InVars {~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, ~n~0=v_~n~0_78} OutVars{~x2~0=v_~x2~0_166, ~size~0=v_~size~0_117, thread2Thread2of2ForFork0_~i~1#1=|v_thread2Thread2of2ForFork0_~i~1#1_39|, thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1_35|, ~n~0=v_~n~0_78, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1_51|} AuxVars[] AssignedVars[thread2Thread2of2ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread2of2ForFork0_assume_abort_if_not_~cond#1][99], [Black: 379#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 641#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1045#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 63#L59-2true, 47#L37true, Black: 294#(<= 1 |ULTIMATE.start_main_~asdf~0#1|), Black: 1292#(= ~x2~0 ~x1~0), Black: 830#true, 214#L49-2true, Black: 1295#true, Black: 1297#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), Black: 277#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 288#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 1303#true, 295#(<= 2 |ULTIMATE.start_main_~asdf~0#1|), thread2Thread1of2ForFork0InUse, 136#L87-3true, 1298#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), 497#(<= 2 |ULTIMATE.start_main_~asdf~1#1|), 1473#(= |thread2Thread1of2ForFork0_~i~1#1| 0), thread1Thread1of2ForFork1NotInUse, Black: 496#(<= 1 |ULTIMATE.start_main_~asdf~1#1|), Black: 1347#(and (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1325#(= |thread1Thread1of2ForFork1_~i~0#1| 0), Black: 1458#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0) (= |thread1Thread2of2ForFork1_~i~0#1| 0)), Black: 1351#(and (<= (mod (* 3 ~n~0) 4294967296) 0) (= |thread1Thread1of2ForFork1_~i~0#1| 0)), 1467#(and (<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)) (= |thread2Thread1of2ForFork0_~i~1#1| 0)), Black: 249#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 1466#(<= (+ (* 4294967296 (div (* 3 ~n~0) 4294967296)) 1) (* 3 ~n~0)), 833#(<= |ULTIMATE.start_main_~asdf~2#1| 1)]) [2023-08-03 21:16:39,367 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-03 21:16:39,367 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-03 21:16:39,367 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-03 21:16:39,367 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-03 21:16:53,548 INFO L124 PetriNetUnfolderBase]: 421203/559656 cut-off events. [2023-08-03 21:16:53,548 INFO L125 PetriNetUnfolderBase]: For 1360568/1385455 co-relation queries the response was YES. [2023-08-03 21:16:56,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1916353 conditions, 559656 events. 421203/559656 cut-off events. For 1360568/1385455 co-relation queries the response was YES. Maximal size of possible extension queue 12371. Compared 4020993 event pairs, 211502 based on Foata normal form. 23255/580179 useless extension candidates. Maximal degree in co-relation 1916313. Up to 327762 conditions per place. [2023-08-03 21:16:59,134 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 201 selfloop transitions, 7 changer transitions 2/220 dead transitions. [2023-08-03 21:16:59,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 220 transitions, 1767 flow [2023-08-03 21:16:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:16:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:16:59,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1025 transitions. [2023-08-03 21:16:59,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862428842504744 [2023-08-03 21:16:59,137 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1025 transitions. [2023-08-03 21:16:59,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1025 transitions. [2023-08-03 21:16:59,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:16:59,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1025 transitions. [2023-08-03 21:16:59,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 256.25) internal successors, (1025), 4 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:16:59,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:16:59,140 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:16:59,140 INFO L175 Difference]: Start difference. First operand has 101 places, 100 transitions, 593 flow. Second operand 4 states and 1025 transitions. [2023-08-03 21:16:59,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 220 transitions, 1767 flow [2023-08-03 21:17:12,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 220 transitions, 1760 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 21:17:12,191 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 637 flow [2023-08-03 21:17:12,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=637, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2023-08-03 21:17:12,192 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 40 predicate places. [2023-08-03 21:17:12,192 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 637 flow [2023-08-03 21:17:12,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 232.25) internal successors, (929), 4 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:17:12,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:17:12,192 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:17:12,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-03 21:17:12,192 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:17:12,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:17:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1817363067, now seen corresponding path program 4 times [2023-08-03 21:17:12,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:17:12,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891766468] [2023-08-03 21:17:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:17:12,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:17:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:17:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-03 21:17:12,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:17:12,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891766468] [2023-08-03 21:17:12,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891766468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:17:12,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:17:12,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:17:12,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664155526] [2023-08-03 21:17:12,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:17:12,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:17:12,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:17:12,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:17:12,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:17:12,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 527 [2023-08-03 21:17:12,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 637 flow. Second operand has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:17:12,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:17:12,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 527 [2023-08-03 21:17:12,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 21:18:20,837 INFO L124 PetriNetUnfolderBase]: 539624/721069 cut-off events. [2023-08-03 21:18:20,837 INFO L125 PetriNetUnfolderBase]: For 2107092/2138892 co-relation queries the response was YES. [2023-08-03 21:18:24,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590256 conditions, 721069 events. 539624/721069 cut-off events. For 2107092/2138892 co-relation queries the response was YES. Maximal size of possible extension queue 15449. Compared 5351215 event pairs, 287126 based on Foata normal form. 38755/759343 useless extension candidates. Maximal degree in co-relation 2590214. Up to 344915 conditions per place. [2023-08-03 21:18:27,404 INFO L140 encePairwiseOnDemand]: 521/527 looper letters, 187 selfloop transitions, 18 changer transitions 3/216 dead transitions. [2023-08-03 21:18:27,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 216 transitions, 1650 flow [2023-08-03 21:18:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 21:18:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 21:18:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1051 transitions. [2023-08-03 21:18:27,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4985768500948767 [2023-08-03 21:18:27,407 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1051 transitions. [2023-08-03 21:18:27,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1051 transitions. [2023-08-03 21:18:27,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 21:18:27,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1051 transitions. [2023-08-03 21:18:27,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 262.75) internal successors, (1051), 4 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:18:27,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:18:27,410 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 527.0) internal successors, (2635), 5 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:18:27,410 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 637 flow. Second operand 4 states and 1051 transitions. [2023-08-03 21:18:27,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 216 transitions, 1650 flow [2023-08-03 21:19:47,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 216 transitions, 1624 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-03 21:19:47,561 INFO L231 Difference]: Finished difference. Result has 109 places, 104 transitions, 715 flow [2023-08-03 21:19:47,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=527, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=715, PETRI_PLACES=109, PETRI_TRANSITIONS=104} [2023-08-03 21:19:47,561 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 44 predicate places. [2023-08-03 21:19:47,561 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 104 transitions, 715 flow [2023-08-03 21:19:47,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 234.25) internal successors, (937), 4 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:19:47,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 21:19:47,562 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 21:19:47,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-03 21:19:47,562 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-03 21:19:47,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 21:19:47,562 INFO L85 PathProgramCache]: Analyzing trace with hash 192182693, now seen corresponding path program 1 times [2023-08-03 21:19:47,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 21:19:47,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389209816] [2023-08-03 21:19:47,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 21:19:47,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 21:19:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 21:19:47,641 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-03 21:19:47,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 21:19:47,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389209816] [2023-08-03 21:19:47,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389209816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 21:19:47,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 21:19:47,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 21:19:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131993167] [2023-08-03 21:19:47,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 21:19:47,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 21:19:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 21:19:47,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 21:19:47,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 21:19:47,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 527 [2023-08-03 21:19:47,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 104 transitions, 715 flow. Second operand has 4 states, 4 states have (on average 232.25) internal successors, (929), 4 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 21:19:47,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 21:19:47,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 527 [2023-08-03 21:19:47,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand