/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 03:08:52,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 03:08:52,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 03:08:52,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 03:08:52,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 03:08:52,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 03:08:52,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 03:08:52,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 03:08:52,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 03:08:52,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 03:08:52,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 03:08:52,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 03:08:52,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 03:08:52,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 03:08:52,771 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 03:08:52,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 03:08:52,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 03:08:52,772 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 03:08:52,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 03:08:52,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 03:08:52,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 03:08:52,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 03:08:52,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 03:08:52,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 03:08:52,775 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 03:08:52,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 03:08:52,775 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 03:08:52,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 03:08:52,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 03:08:52,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 03:08:52,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:08:52,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 03:08:52,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 03:08:52,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 03:08:52,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 03:08:52,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 03:08:52,778 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 03:08:52,778 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 03:08:52,778 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 03:08:52,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 03:08:52,778 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 03:08:52,778 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 -> INSUFFICIENT_FIRST [2023-08-04 03:08:52,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 03:08:53,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 03:08:53,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 03:08:53,017 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 03:08:53,017 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 03:08:53,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c [2023-08-04 03:08:54,220 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 03:08:54,440 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 03:08:54,441 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c [2023-08-04 03:08:54,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a62f9328/a0da6f8bb6f24097bd4bc0f5812e9f03/FLAGfe65906ce [2023-08-04 03:08:54,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a62f9328/a0da6f8bb6f24097bd4bc0f5812e9f03 [2023-08-04 03:08:54,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 03:08:54,475 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 03:08:54,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 03:08:54,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 03:08:54,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 03:08:54,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740ba459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54, skipping insertion in model container [2023-08-04 03:08:54,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,506 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 03:08:54,684 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_popl20-more-nonblocking-counter-alt2.wvr_bound2.c[2309,2322] [2023-08-04 03:08:54,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:08:54,695 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 03:08:54,730 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_popl20-more-nonblocking-counter-alt2.wvr_bound2.c[2309,2322] [2023-08-04 03:08:54,731 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 03:08:54,737 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 03:08:54,737 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 03:08:54,744 INFO L206 MainTranslator]: Completed translation [2023-08-04 03:08:54,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54 WrapperNode [2023-08-04 03:08:54,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 03:08:54,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 03:08:54,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 03:08:54,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 03:08:54,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,784 INFO L138 Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2023-08-04 03:08:54,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 03:08:54,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 03:08:54,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 03:08:54,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 03:08:54,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 03:08:54,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 03:08:54,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 03:08:54,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 03:08:54,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (1/1) ... [2023-08-04 03:08:54,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 03:08:54,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:08:54,852 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-04 03:08:54,866 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-04 03:08:54,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 03:08:54,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 03:08:54,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 03:08:54,890 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 03:08:54,890 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 03:08:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 03:08:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 03:08:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 03:08:54,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 03:08:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 03:08:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 03:08:54,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 03:08:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 03:08:54,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 03:08:54,895 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 03:08:54,980 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 03:08:54,986 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 03:08:55,256 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 03:08:55,300 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 03:08:55,301 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 03:08:55,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:08:55 BoogieIcfgContainer [2023-08-04 03:08:55,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 03:08:55,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 03:08:55,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 03:08:55,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 03:08:55,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 03:08:54" (1/3) ... [2023-08-04 03:08:55,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cabb0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:08:55, skipping insertion in model container [2023-08-04 03:08:55,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 03:08:54" (2/3) ... [2023-08-04 03:08:55,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cabb0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 03:08:55, skipping insertion in model container [2023-08-04 03:08:55,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 03:08:55" (3/3) ... [2023-08-04 03:08:55,314 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-more-nonblocking-counter-alt2.wvr_bound2.c [2023-08-04 03:08:55,321 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 03:08:55,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 03:08:55,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 03:08:55,330 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 03:08:55,409 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 03:08:55,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 109 transitions, 240 flow [2023-08-04 03:08:55,561 INFO L124 PetriNetUnfolderBase]: 33/246 cut-off events. [2023-08-04 03:08:55,562 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 03:08:55,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 246 events. 33/246 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 795 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-04 03:08:55,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 109 transitions, 240 flow [2023-08-04 03:08:55,576 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 109 transitions, 240 flow [2023-08-04 03:08:55,581 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:08:55,593 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 109 transitions, 240 flow [2023-08-04 03:08:55,597 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 109 transitions, 240 flow [2023-08-04 03:08:55,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 109 transitions, 240 flow [2023-08-04 03:08:55,655 INFO L124 PetriNetUnfolderBase]: 33/246 cut-off events. [2023-08-04 03:08:55,655 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 03:08:55,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 246 events. 33/246 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 795 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2023-08-04 03:08:55,662 INFO L119 LiptonReduction]: Number of co-enabled transitions 2052 [2023-08-04 03:08:57,790 INFO L134 LiptonReduction]: Checked pairs total: 2605 [2023-08-04 03:08:57,791 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-04 03:08:57,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:08:57,810 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;@18bbfce7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:08:57,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 03:08:57,815 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:08:57,816 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2023-08-04 03:08:57,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:08:57,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:08:57,817 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 03:08:57,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:08:57,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:08:57,822 INFO L85 PathProgramCache]: Analyzing trace with hash -58774126, now seen corresponding path program 1 times [2023-08-04 03:08:57,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:08:57,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218254447] [2023-08-04 03:08:57,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:08:57,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:08:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:08:57,924 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 03:08:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 03:08:57,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 03:08:57,982 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 03:08:57,983 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 03:08:57,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 03:08:57,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 03:08:57,985 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 03:08:57,987 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 03:08:57,988 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 03:08:57,988 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 03:08:58,007 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 03:08:58,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 132 transitions, 312 flow [2023-08-04 03:08:58,092 INFO L124 PetriNetUnfolderBase]: 134/809 cut-off events. [2023-08-04 03:08:58,093 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 03:08:58,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 809 events. 134/809 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4044 event pairs, 2 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-04 03:08:58,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 132 transitions, 312 flow [2023-08-04 03:08:58,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 132 transitions, 312 flow [2023-08-04 03:08:58,103 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:08:58,103 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 132 transitions, 312 flow [2023-08-04 03:08:58,103 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 132 transitions, 312 flow [2023-08-04 03:08:58,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 132 transitions, 312 flow [2023-08-04 03:08:58,186 INFO L124 PetriNetUnfolderBase]: 134/809 cut-off events. [2023-08-04 03:08:58,187 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 03:08:58,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 809 events. 134/809 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4044 event pairs, 2 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-04 03:08:58,203 INFO L119 LiptonReduction]: Number of co-enabled transitions 5028 [2023-08-04 03:09:00,253 INFO L134 LiptonReduction]: Checked pairs total: 7595 [2023-08-04 03:09:00,253 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-08-04 03:09:00,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 03:09:00,256 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;@18bbfce7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:09:00,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 03:09:00,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:09:00,262 INFO L124 PetriNetUnfolderBase]: 7/67 cut-off events. [2023-08-04 03:09:00,262 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 03:09:00,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:00,262 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 03:09:00,262 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:09:00,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:00,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1410418684, now seen corresponding path program 1 times [2023-08-04 03:09:00,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:00,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369437658] [2023-08-04 03:09:00,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:09:00,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:00,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369437658] [2023-08-04 03:09:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369437658] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581713207] [2023-08-04 03:09:00,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:00,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:00,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:00,465 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-04 03:09:00,469 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-04 03:09:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:00,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 03:09:00,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 03:09:00,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:09:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581713207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:09:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 03:09:00,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665394147] [2023-08-04 03:09:00,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:00,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:09:00,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:00,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:09:00,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 03:09:00,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-04 03:09:00,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-04 03:09:00,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:00,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-04 03:09:00,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:01,456 INFO L124 PetriNetUnfolderBase]: 8553/11151 cut-off events. [2023-08-04 03:09:01,456 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-08-04 03:09:01,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22551 conditions, 11151 events. 8553/11151 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 50077 event pairs, 2448 based on Foata normal form. 0/6346 useless extension candidates. Maximal degree in co-relation 6846. Up to 10615 conditions per place. [2023-08-04 03:09:01,492 INFO L140 encePairwiseOnDemand]: 231/236 looper letters, 23 selfloop transitions, 5 changer transitions 17/52 dead transitions. [2023-08-04 03:09:01,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 234 flow [2023-08-04 03:09:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:09:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:09:01,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 555 transitions. [2023-08-04 03:09:01,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703389830508475 [2023-08-04 03:09:01,506 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 555 transitions. [2023-08-04 03:09:01,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 555 transitions. [2023-08-04 03:09:01,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:01,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 555 transitions. [2023-08-04 03:09:01,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:09:01,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-04 03:09:01,529 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-04 03:09:01,531 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 5 states and 555 transitions. [2023-08-04 03:09:01,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 234 flow [2023-08-04 03:09:01,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:09:01,541 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 91 flow [2023-08-04 03:09:01,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 03:09:01,547 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 03:09:01,547 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 91 flow [2023-08-04 03:09:01,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 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-04 03:09:01,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:01,548 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 03:09:01,560 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-04 03:09:01,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:01,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:09:01,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash -143254444, now seen corresponding path program 1 times [2023-08-04 03:09:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277770186] [2023-08-04 03:09:01,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:01,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:01,806 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-04 03:09:01,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:01,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277770186] [2023-08-04 03:09:01,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277770186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:01,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:09:01,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:09:01,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225421733] [2023-08-04 03:09:01,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:01,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:09:01,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:01,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:09:01,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:09:01,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 236 [2023-08-04 03:09:01,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-04 03:09:01,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:01,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 236 [2023-08-04 03:09:01,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:02,054 INFO L124 PetriNetUnfolderBase]: 1760/2333 cut-off events. [2023-08-04 03:09:02,054 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2023-08-04 03:09:02,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 2333 events. 1760/2333 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8292 event pairs, 685 based on Foata normal form. 1/1402 useless extension candidates. Maximal degree in co-relation 1396. Up to 2189 conditions per place. [2023-08-04 03:09:02,069 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 21 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 03:09:02,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 140 flow [2023-08-04 03:09:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:09:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:09:02,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-08-04 03:09:02,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689265536723164 [2023-08-04 03:09:02,071 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-08-04 03:09:02,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-08-04 03:09:02,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:02,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-08-04 03:09:02,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 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-04 03:09:02,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 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-04 03:09:02,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 236.0) internal successors, (944), 4 states have internal predecessors, (944), 0 states have call successors, (0), 0 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-04 03:09:02,076 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 91 flow. Second operand 3 states and 332 transitions. [2023-08-04 03:09:02,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 140 flow [2023-08-04 03:09:02,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 137 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:09:02,078 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 87 flow [2023-08-04 03:09:02,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2023-08-04 03:09:02,079 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 03:09:02,079 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 87 flow [2023-08-04 03:09:02,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 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-04 03:09:02,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:02,079 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:09:02,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 03:09:02,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:09:02,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:02,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1486425453, now seen corresponding path program 1 times [2023-08-04 03:09:02,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:02,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221434966] [2023-08-04 03:09:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:02,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:02,130 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-04 03:09:02,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221434966] [2023-08-04 03:09:02,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221434966] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:02,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107175383] [2023-08-04 03:09:02,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:02,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:02,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:02,132 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-04 03:09:02,149 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-04 03:09:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:02,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:09:02,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:02,218 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-04 03:09:02,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:09:02,237 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-04 03:09:02,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107175383] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:09:02,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:09:02,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:09:02,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354895163] [2023-08-04 03:09:02,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:09:02,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:09:02,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:02,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:09:02,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:09:02,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-04 03:09:02,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-04 03:09:02,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:02,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-04 03:09:02,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:02,431 INFO L124 PetriNetUnfolderBase]: 1432/1870 cut-off events. [2023-08-04 03:09:02,432 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-08-04 03:09:02,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 1870 events. 1432/1870 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6188 event pairs, 357 based on Foata normal form. 3/1117 useless extension candidates. Maximal degree in co-relation 2803. Up to 1729 conditions per place. [2023-08-04 03:09:02,445 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-04 03:09:02,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 150 flow [2023-08-04 03:09:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:02,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:02,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-04 03:09:02,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608050847457627 [2023-08-04 03:09:02,448 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-04 03:09:02,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-04 03:09:02,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:02,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-04 03:09:02,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 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-04 03:09:02,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 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-04 03:09:02,452 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 236.0) internal successors, (1180), 5 states have internal predecessors, (1180), 0 states have call successors, (0), 0 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-04 03:09:02,452 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 87 flow. Second operand 4 states and 435 transitions. [2023-08-04 03:09:02,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 150 flow [2023-08-04 03:09:02,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 03:09:02,454 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 84 flow [2023-08-04 03:09:02,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-04 03:09:02,456 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-08-04 03:09:02,456 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 84 flow [2023-08-04 03:09:02,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-04 03:09:02,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:02,459 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:09:02,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 03:09:02,669 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,SelfDestructingSolverStorable3 [2023-08-04 03:09:02,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 03:09:02,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash -2145807451, now seen corresponding path program 1 times [2023-08-04 03:09:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:02,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650333138] [2023-08-04 03:09:02,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:02,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 03:09:02,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650333138] [2023-08-04 03:09:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650333138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505192421] [2023-08-04 03:09:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:02,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:02,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:02,763 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-04 03:09:02,782 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-04 03:09:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:02,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 03:09:02,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:02,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 03:09:02,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:09:02,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505192421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:09:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 03:09:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044796791] [2023-08-04 03:09:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:02,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:09:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:09:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 03:09:02,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 236 [2023-08-04 03:09:02,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-04 03:09:02,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:02,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 236 [2023-08-04 03:09:02,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:03,001 INFO L124 PetriNetUnfolderBase]: 1000/1330 cut-off events. [2023-08-04 03:09:03,001 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-08-04 03:09:03,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1330 events. 1000/1330 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4430 event pairs, 43 based on Foata normal form. 81/871 useless extension candidates. Maximal degree in co-relation 1017. Up to 558 conditions per place. [2023-08-04 03:09:03,004 INFO L140 encePairwiseOnDemand]: 233/236 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2023-08-04 03:09:03,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 198 flow [2023-08-04 03:09:03,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 03:09:03,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 03:09:03,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 549 transitions. [2023-08-04 03:09:03,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652542372881356 [2023-08-04 03:09:03,007 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 549 transitions. [2023-08-04 03:09:03,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 549 transitions. [2023-08-04 03:09:03,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:03,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 549 transitions. [2023-08-04 03:09:03,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 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-04 03:09:03,011 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-04 03:09:03,012 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 236.0) internal successors, (1416), 6 states have internal predecessors, (1416), 0 states have call successors, (0), 0 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-04 03:09:03,012 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 84 flow. Second operand 5 states and 549 transitions. [2023-08-04 03:09:03,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 198 flow [2023-08-04 03:09:03,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 03:09:03,015 INFO L231 Difference]: Finished difference. Result has 34 places, 0 transitions, 0 flow [2023-08-04 03:09:03,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=236, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=34, PETRI_TRANSITIONS=0} [2023-08-04 03:09:03,017 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-04 03:09:03,017 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 0 transitions, 0 flow [2023-08-04 03:09:03,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-04 03:09:03,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 03:09:03,018 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 03:09:03,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 03:09:03,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:03,224 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 03:09:03,224 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 03:09:03,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 132 transitions, 312 flow [2023-08-04 03:09:03,283 INFO L124 PetriNetUnfolderBase]: 134/809 cut-off events. [2023-08-04 03:09:03,283 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 03:09:03,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 809 events. 134/809 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4044 event pairs, 2 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-04 03:09:03,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 132 transitions, 312 flow [2023-08-04 03:09:03,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 132 transitions, 312 flow [2023-08-04 03:09:03,290 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 03:09:03,290 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 132 transitions, 312 flow [2023-08-04 03:09:03,290 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 132 transitions, 312 flow [2023-08-04 03:09:03,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 132 transitions, 312 flow [2023-08-04 03:09:03,344 INFO L124 PetriNetUnfolderBase]: 134/809 cut-off events. [2023-08-04 03:09:03,344 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 03:09:03,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 809 events. 134/809 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4044 event pairs, 2 based on Foata normal form. 0/672 useless extension candidates. Maximal degree in co-relation 479. Up to 32 conditions per place. [2023-08-04 03:09:03,357 INFO L119 LiptonReduction]: Number of co-enabled transitions 5028 [2023-08-04 03:09:05,343 INFO L134 LiptonReduction]: Checked pairs total: 7595 [2023-08-04 03:09:05,343 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-04 03:09:05,345 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 03:09:05,346 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;@18bbfce7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 03:09:05,346 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 03:09:05,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 03:09:05,349 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 03:09:05,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 03:09:05,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:05,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 03:09:05,349 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:05,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:05,351 INFO L85 PathProgramCache]: Analyzing trace with hash 754210923, now seen corresponding path program 1 times [2023-08-04 03:09:05,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:05,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060391423] [2023-08-04 03:09:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:05,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:05,382 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-04 03:09:05,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:05,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060391423] [2023-08-04 03:09:05,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060391423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:05,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:09:05,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 03:09:05,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403913902] [2023-08-04 03:09:05,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:05,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:09:05,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:05,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:09:05,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 03:09:05,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-04 03:09:05,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-04 03:09:05,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:05,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-04 03:09:05,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:06,091 INFO L124 PetriNetUnfolderBase]: 8526/11037 cut-off events. [2023-08-04 03:09:06,091 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2023-08-04 03:09:06,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22380 conditions, 11037 events. 8526/11037 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47384 event pairs, 3472 based on Foata normal form. 0/6248 useless extension candidates. Maximal degree in co-relation 6836. Up to 10600 conditions per place. [2023-08-04 03:09:06,144 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2023-08-04 03:09:06,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 216 flow [2023-08-04 03:09:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:09:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:09:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-04 03:09:06,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49361702127659574 [2023-08-04 03:09:06,150 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-04 03:09:06,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-04 03:09:06,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:06,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-04 03:09:06,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 03:09:06,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-04 03:09:06,157 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-04 03:09:06,157 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 348 transitions. [2023-08-04 03:09:06,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 216 flow [2023-08-04 03:09:06,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 03:09:06,160 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 134 flow [2023-08-04 03:09:06,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2023-08-04 03:09:06,162 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 03:09:06,163 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 134 flow [2023-08-04 03:09:06,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-04 03:09:06,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:06,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:09:06,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 03:09:06,163 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:06,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:06,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1680862222, now seen corresponding path program 1 times [2023-08-04 03:09:06,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:06,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678869000] [2023-08-04 03:09:06,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:06,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:06,218 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-04 03:09:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678869000] [2023-08-04 03:09:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678869000] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939639873] [2023-08-04 03:09:06,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:06,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:06,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:06,221 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-04 03:09:06,243 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-04 03:09:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:06,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:09:06,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:06,284 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-04 03:09:06,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:09:06,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939639873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:06,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:09:06,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:09:06,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147546387] [2023-08-04 03:09:06,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:06,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:09:06,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:09:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:09:06,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-04 03:09:06,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-04 03:09:06,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:06,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-04 03:09:06,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:06,997 INFO L124 PetriNetUnfolderBase]: 8488/11014 cut-off events. [2023-08-04 03:09:06,997 INFO L125 PetriNetUnfolderBase]: For 856/856 co-relation queries the response was YES. [2023-08-04 03:09:07,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22260 conditions, 11014 events. 8488/11014 cut-off events. For 856/856 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 49181 event pairs, 3438 based on Foata normal form. 0/6262 useless extension candidates. Maximal degree in co-relation 13423. Up to 10389 conditions per place. [2023-08-04 03:09:07,048 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-08-04 03:09:07,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 234 flow [2023-08-04 03:09:07,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:09:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:09:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-04 03:09:07,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4978723404255319 [2023-08-04 03:09:07,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-04 03:09:07,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-04 03:09:07,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:07,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-04 03:09:07,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 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-04 03:09:07,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-04 03:09:07,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-04 03:09:07,053 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 134 flow. Second operand 3 states and 351 transitions. [2023-08-04 03:09:07,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 234 flow [2023-08-04 03:09:07,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 03:09:07,059 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 138 flow [2023-08-04 03:09:07,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2023-08-04 03:09:07,060 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2023-08-04 03:09:07,060 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 138 flow [2023-08-04 03:09:07,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 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-04 03:09:07,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:07,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:09:07,067 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-04 03:09:07,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:07,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:07,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:07,267 INFO L85 PathProgramCache]: Analyzing trace with hash 712481687, now seen corresponding path program 1 times [2023-08-04 03:09:07,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:07,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663165230] [2023-08-04 03:09:07,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:07,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 03:09:07,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:07,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663165230] [2023-08-04 03:09:07,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663165230] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:07,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565021244] [2023-08-04 03:09:07,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:07,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:07,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:07,315 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-04 03:09:07,318 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-04 03:09:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:07,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:09:07,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:07,381 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-04 03:09:07,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:09:07,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565021244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:07,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:09:07,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 03:09:07,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991654904] [2023-08-04 03:09:07,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:07,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:09:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:07,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:09:07,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:09:07,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-04 03:09:07,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-04 03:09:07,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:07,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-04 03:09:07,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:07,908 INFO L124 PetriNetUnfolderBase]: 7283/9572 cut-off events. [2023-08-04 03:09:07,908 INFO L125 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2023-08-04 03:09:07,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19645 conditions, 9572 events. 7283/9572 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 43092 event pairs, 2490 based on Foata normal form. 0/5673 useless extension candidates. Maximal degree in co-relation 6727. Up to 6828 conditions per place. [2023-08-04 03:09:07,950 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 47 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 03:09:07,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 274 flow [2023-08-04 03:09:07,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:09:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:09:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-04 03:09:07,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063829787234042 [2023-08-04 03:09:07,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-04 03:09:07,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-04 03:09:07,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:07,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-04 03:09:07,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-04 03:09:07,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-04 03:09:07,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-04 03:09:07,955 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 138 flow. Second operand 3 states and 357 transitions. [2023-08-04 03:09:07,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 274 flow [2023-08-04 03:09:07,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:09:07,958 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 148 flow [2023-08-04 03:09:07,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-04 03:09:07,959 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 03:09:07,959 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 148 flow [2023-08-04 03:09:07,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-04 03:09:07,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:07,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:09:07,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 03:09:08,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:08,166 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:08,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:08,167 INFO L85 PathProgramCache]: Analyzing trace with hash -797482676, now seen corresponding path program 1 times [2023-08-04 03:09:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:08,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081682408] [2023-08-04 03:09:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:08,221 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-04 03:09:08,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:08,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081682408] [2023-08-04 03:09:08,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081682408] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:08,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145713363] [2023-08-04 03:09:08,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:08,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:08,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:08,225 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-04 03:09:08,228 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-04 03:09:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:08,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 03:09:08,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:08,291 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-04 03:09:08,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 03:09:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145713363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:08,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 03:09:08,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 03:09:08,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527739201] [2023-08-04 03:09:08,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:08,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 03:09:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 03:09:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:09:08,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 235 [2023-08-04 03:09:08,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-04 03:09:08,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:08,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 235 [2023-08-04 03:09:08,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:08,800 INFO L124 PetriNetUnfolderBase]: 7160/9501 cut-off events. [2023-08-04 03:09:08,800 INFO L125 PetriNetUnfolderBase]: For 1496/1496 co-relation queries the response was YES. [2023-08-04 03:09:08,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20205 conditions, 9501 events. 7160/9501 cut-off events. For 1496/1496 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 42846 event pairs, 2789 based on Foata normal form. 0/5933 useless extension candidates. Maximal degree in co-relation 7255. Up to 7262 conditions per place. [2023-08-04 03:09:08,846 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 48 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-04 03:09:08,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 286 flow [2023-08-04 03:09:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 03:09:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 03:09:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-04 03:09:08,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063829787234042 [2023-08-04 03:09:08,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-04 03:09:08,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-04 03:09:08,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:08,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-04 03:09:08,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 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-04 03:09:08,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-04 03:09:08,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 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-04 03:09:08,852 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 148 flow. Second operand 3 states and 357 transitions. [2023-08-04 03:09:08,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 286 flow [2023-08-04 03:09:08,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:09:08,858 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 158 flow [2023-08-04 03:09:08,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-04 03:09:08,858 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-04 03:09:08,859 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 158 flow [2023-08-04 03:09:08,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-04 03:09:08,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:08,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 03:09:08,867 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-04 03:09:09,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:09,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:09,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1190928951, now seen corresponding path program 1 times [2023-08-04 03:09:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366118588] [2023-08-04 03:09:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:09:09,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:09,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366118588] [2023-08-04 03:09:09,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366118588] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:09,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738267145] [2023-08-04 03:09:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:09,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:09,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:09,109 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-04 03:09:09,135 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-04 03:09:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:09,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:09:09,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:09:09,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:09:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 03:09:09,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738267145] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:09:09,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:09:09,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:09:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316314559] [2023-08-04 03:09:09,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:09:09,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:09:09,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:09,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:09:09,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:09:09,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-04 03:09:09,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-04 03:09:09,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:09,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-04 03:09:09,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:09,704 INFO L124 PetriNetUnfolderBase]: 6453/8554 cut-off events. [2023-08-04 03:09:09,704 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2023-08-04 03:09:09,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18389 conditions, 8554 events. 6453/8554 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 38298 event pairs, 1919 based on Foata normal form. 3/5405 useless extension candidates. Maximal degree in co-relation 12362. Up to 8125 conditions per place. [2023-08-04 03:09:09,748 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 41 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2023-08-04 03:09:09,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 264 flow [2023-08-04 03:09:09,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-04 03:09:09,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797872340425532 [2023-08-04 03:09:09,751 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-04 03:09:09,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-04 03:09:09,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:09,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-04 03:09:09,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 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-04 03:09:09,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:09,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:09,755 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 158 flow. Second operand 4 states and 451 transitions. [2023-08-04 03:09:09,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 264 flow [2023-08-04 03:09:09,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 53 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 03:09:09,772 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 170 flow [2023-08-04 03:09:09,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2023-08-04 03:09:09,774 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-04 03:09:09,774 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 170 flow [2023-08-04 03:09:09,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-04 03:09:09,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:09,774 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] [2023-08-04 03:09:09,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 03:09:09,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:09,980 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:09,980 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:09,980 INFO L85 PathProgramCache]: Analyzing trace with hash 890184969, now seen corresponding path program 1 times [2023-08-04 03:09:09,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:09,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485170592] [2023-08-04 03:09:09,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:09,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:10,025 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-04 03:09:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485170592] [2023-08-04 03:09:10,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485170592] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390357989] [2023-08-04 03:09:10,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:10,028 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-04 03:09:10,030 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-04 03:09:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:10,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:09:10,091 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:10,101 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-04 03:09:10,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:09:10,115 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-04 03:09:10,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390357989] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:09:10,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:09:10,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 03:09:10,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352091476] [2023-08-04 03:09:10,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:09:10,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:09:10,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:10,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:09:10,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:09:10,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-04 03:09:10,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-04 03:09:10,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:10,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-04 03:09:10,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:10,651 INFO L124 PetriNetUnfolderBase]: 6114/8098 cut-off events. [2023-08-04 03:09:10,651 INFO L125 PetriNetUnfolderBase]: For 792/792 co-relation queries the response was YES. [2023-08-04 03:09:10,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 8098 events. 6114/8098 cut-off events. For 792/792 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 36576 event pairs, 1699 based on Foata normal form. 27/5129 useless extension candidates. Maximal degree in co-relation 11398. Up to 6552 conditions per place. [2023-08-04 03:09:10,686 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 49 selfloop transitions, 3 changer transitions 1/61 dead transitions. [2023-08-04 03:09:10,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 308 flow [2023-08-04 03:09:10,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2023-08-04 03:09:10,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48829787234042554 [2023-08-04 03:09:10,688 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2023-08-04 03:09:10,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2023-08-04 03:09:10,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:10,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2023-08-04 03:09:10,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 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-04 03:09:10,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:10,691 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:10,691 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 170 flow. Second operand 4 states and 459 transitions. [2023-08-04 03:09:10,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 308 flow [2023-08-04 03:09:10,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 299 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:09:10,703 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 175 flow [2023-08-04 03:09:10,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-08-04 03:09:10,704 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 10 predicate places. [2023-08-04 03:09:10,704 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 175 flow [2023-08-04 03:09:10,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 0 states have call successors, (0), 0 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-04 03:09:10,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:10,705 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] [2023-08-04 03:09:10,709 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-04 03:09:10,905 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,SelfDestructingSolverStorable10 [2023-08-04 03:09:10,905 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:10,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:10,906 INFO L85 PathProgramCache]: Analyzing trace with hash 462738391, now seen corresponding path program 1 times [2023-08-04 03:09:10,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:10,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122867561] [2023-08-04 03:09:10,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:10,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:09:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122867561] [2023-08-04 03:09:10,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122867561] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:10,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798425107] [2023-08-04 03:09:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:10,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:10,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:10,960 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-04 03:09:10,962 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-04 03:09:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:11,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:09:11,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:11,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:09:11,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:09:11,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 03:09:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798425107] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:09:11,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:09:11,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 03:09:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942789502] [2023-08-04 03:09:11,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:09:11,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:09:11,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:11,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:09:11,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:09:11,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-04 03:09:11,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-04 03:09:11,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:11,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-04 03:09:11,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:11,434 INFO L124 PetriNetUnfolderBase]: 4136/5529 cut-off events. [2023-08-04 03:09:11,434 INFO L125 PetriNetUnfolderBase]: For 1271/1271 co-relation queries the response was YES. [2023-08-04 03:09:11,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11980 conditions, 5529 events. 4136/5529 cut-off events. For 1271/1271 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22842 event pairs, 747 based on Foata normal form. 108/3585 useless extension candidates. Maximal degree in co-relation 10556. Up to 2080 conditions per place. [2023-08-04 03:09:11,451 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 55 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-04 03:09:11,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 346 flow [2023-08-04 03:09:11,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-08-04 03:09:11,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946808510638298 [2023-08-04 03:09:11,452 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-08-04 03:09:11,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-08-04 03:09:11,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:11,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-08-04 03:09:11,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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-04 03:09:11,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:11,456 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:11,456 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 175 flow. Second operand 4 states and 465 transitions. [2023-08-04 03:09:11,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 346 flow [2023-08-04 03:09:11,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 336 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:09:11,463 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 186 flow [2023-08-04 03:09:11,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-04 03:09:11,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-04 03:09:11,464 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 186 flow [2023-08-04 03:09:11,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.0) internal successors, (535), 5 states have internal predecessors, (535), 0 states have call successors, (0), 0 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-04 03:09:11,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:11,464 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] [2023-08-04 03:09:11,472 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-04 03:09:11,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:11,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:11,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1066448735, now seen corresponding path program 1 times [2023-08-04 03:09:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191684274] [2023-08-04 03:09:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:11,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:09:11,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191684274] [2023-08-04 03:09:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191684274] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489184814] [2023-08-04 03:09:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:11,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:11,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:11,733 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-04 03:09:11,761 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-04 03:09:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:11,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 03:09:11,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:09:11,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:09:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 03:09:11,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489184814] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:09:11,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:09:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 03:09:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936571638] [2023-08-04 03:09:11,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:09:11,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 03:09:11,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 03:09:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 03:09:11,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-04 03:09:11,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-04 03:09:11,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:11,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-04 03:09:11,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:12,146 INFO L124 PetriNetUnfolderBase]: 4120/5502 cut-off events. [2023-08-04 03:09:12,146 INFO L125 PetriNetUnfolderBase]: For 2152/2152 co-relation queries the response was YES. [2023-08-04 03:09:12,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12516 conditions, 5502 events. 4120/5502 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 22532 event pairs, 1861 based on Foata normal form. 13/3471 useless extension candidates. Maximal degree in co-relation 11102. Up to 4661 conditions per place. [2023-08-04 03:09:12,166 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 55 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2023-08-04 03:09:12,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 358 flow [2023-08-04 03:09:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2023-08-04 03:09:12,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4946808510638298 [2023-08-04 03:09:12,168 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 465 transitions. [2023-08-04 03:09:12,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions. [2023-08-04 03:09:12,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:12,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions. [2023-08-04 03:09:12,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 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-04 03:09:12,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:12,172 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:12,172 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 186 flow. Second operand 4 states and 465 transitions. [2023-08-04 03:09:12,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 358 flow [2023-08-04 03:09:12,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 03:09:12,183 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 190 flow [2023-08-04 03:09:12,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2023-08-04 03:09:12,184 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 03:09:12,184 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 190 flow [2023-08-04 03:09:12,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-04 03:09:12,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:12,185 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] [2023-08-04 03:09:12,192 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-04 03:09:12,390 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,SelfDestructingSolverStorable12 [2023-08-04 03:09:12,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:12,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash -14717196, now seen corresponding path program 1 times [2023-08-04 03:09:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:12,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018040912] [2023-08-04 03:09:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:09:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018040912] [2023-08-04 03:09:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018040912] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:12,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:09:12,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 03:09:12,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315014230] [2023-08-04 03:09:12,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:12,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 03:09:12,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:12,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 03:09:12,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 03:09:12,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-04 03:09:12,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 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-04 03:09:12,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:12,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-04 03:09:12,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:13,050 INFO L124 PetriNetUnfolderBase]: 4584/6149 cut-off events. [2023-08-04 03:09:13,050 INFO L125 PetriNetUnfolderBase]: For 2270/2270 co-relation queries the response was YES. [2023-08-04 03:09:13,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13980 conditions, 6149 events. 4584/6149 cut-off events. For 2270/2270 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 26197 event pairs, 2000 based on Foata normal form. 0/4107 useless extension candidates. Maximal degree in co-relation 13791. Up to 4603 conditions per place. [2023-08-04 03:09:13,077 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 65 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-04 03:09:13,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 464 flow [2023-08-04 03:09:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-04 03:09:13,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4829787234042553 [2023-08-04 03:09:13,079 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-04 03:09:13,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-04 03:09:13,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:13,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-04 03:09:13,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 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-04 03:09:13,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:13,082 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:13,083 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 190 flow. Second operand 4 states and 454 transitions. [2023-08-04 03:09:13,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 464 flow [2023-08-04 03:09:13,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 451 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 03:09:13,101 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 196 flow [2023-08-04 03:09:13,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=196, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2023-08-04 03:09:13,103 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-08-04 03:09:13,103 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 196 flow [2023-08-04 03:09:13,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 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-04 03:09:13,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:13,104 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] [2023-08-04 03:09:13,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 03:09:13,104 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:13,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1075308497, now seen corresponding path program 1 times [2023-08-04 03:09:13,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:13,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960086756] [2023-08-04 03:09:13,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 03:09:13,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:13,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960086756] [2023-08-04 03:09:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960086756] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:13,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:09:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 03:09:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207273089] [2023-08-04 03:09:13,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:13,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 03:09:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:13,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 03:09:13,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 03:09:13,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-04 03:09:13,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-04 03:09:13,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:13,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-04 03:09:13,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:13,644 INFO L124 PetriNetUnfolderBase]: 4328/5842 cut-off events. [2023-08-04 03:09:13,644 INFO L125 PetriNetUnfolderBase]: For 2709/3037 co-relation queries the response was YES. [2023-08-04 03:09:13,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14648 conditions, 5842 events. 4328/5842 cut-off events. For 2709/3037 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 25455 event pairs, 1913 based on Foata normal form. 328/4424 useless extension candidates. Maximal degree in co-relation 14457. Up to 4371 conditions per place. [2023-08-04 03:09:13,666 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 64 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-04 03:09:13,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 461 flow [2023-08-04 03:09:13,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-04 03:09:13,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808510638297872 [2023-08-04 03:09:13,668 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-04 03:09:13,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-04 03:09:13,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:13,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-04 03:09:13,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 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-04 03:09:13,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:13,671 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:13,671 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 196 flow. Second operand 4 states and 452 transitions. [2023-08-04 03:09:13,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 461 flow [2023-08-04 03:09:13,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 452 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 03:09:13,682 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 204 flow [2023-08-04 03:09:13,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-08-04 03:09:13,683 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-08-04 03:09:13,683 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 204 flow [2023-08-04 03:09:13,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 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-04 03:09:13,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:13,683 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-04 03:09:13,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 03:09:13,684 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:13,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1987916478, now seen corresponding path program 1 times [2023-08-04 03:09:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:13,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385071140] [2023-08-04 03:09:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 03:09:13,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:13,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385071140] [2023-08-04 03:09:13,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385071140] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:13,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006139324] [2023-08-04 03:09:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:13,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:13,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:13,841 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:09:13,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 03:09:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:13,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 03:09:13,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 03:09:13,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:09:14,041 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-04 03:09:14,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006139324] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:14,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 03:09:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-08-04 03:09:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888219065] [2023-08-04 03:09:14,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:14,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 03:09:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:14,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 03:09:14,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-04 03:09:14,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-08-04 03:09:14,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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-04 03:09:14,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:14,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-08-04 03:09:14,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:14,496 INFO L124 PetriNetUnfolderBase]: 4027/5532 cut-off events. [2023-08-04 03:09:14,496 INFO L125 PetriNetUnfolderBase]: For 2985/3634 co-relation queries the response was YES. [2023-08-04 03:09:14,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14656 conditions, 5532 events. 4027/5532 cut-off events. For 2985/3634 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 24305 event pairs, 1934 based on Foata normal form. 649/4737 useless extension candidates. Maximal degree in co-relation 14464. Up to 4167 conditions per place. [2023-08-04 03:09:14,529 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 63 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-04 03:09:14,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 450 flow [2023-08-04 03:09:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 453 transitions. [2023-08-04 03:09:14,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819148936170213 [2023-08-04 03:09:14,532 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 453 transitions. [2023-08-04 03:09:14,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 453 transitions. [2023-08-04 03:09:14,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:14,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 453 transitions. [2023-08-04 03:09:14,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 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-04 03:09:14,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:14,535 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:14,535 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 204 flow. Second operand 4 states and 453 transitions. [2023-08-04 03:09:14,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 450 flow [2023-08-04 03:09:14,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 441 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 03:09:14,545 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 212 flow [2023-08-04 03:09:14,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-08-04 03:09:14,545 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2023-08-04 03:09:14,545 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 212 flow [2023-08-04 03:09:14,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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-04 03:09:14,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:14,546 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] [2023-08-04 03:09:14,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 03:09:14,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-04 03:09:14,752 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:14,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash 557613315, now seen corresponding path program 1 times [2023-08-04 03:09:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:14,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632092191] [2023-08-04 03:09:14,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 03:09:14,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632092191] [2023-08-04 03:09:14,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632092191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 03:09:14,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 03:09:14,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 03:09:14,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309601657] [2023-08-04 03:09:14,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 03:09:14,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 03:09:14,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 03:09:14,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 03:09:14,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 235 [2023-08-04 03:09:14,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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-04 03:09:14,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:14,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 235 [2023-08-04 03:09:14,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:15,289 INFO L124 PetriNetUnfolderBase]: 3795/5283 cut-off events. [2023-08-04 03:09:15,289 INFO L125 PetriNetUnfolderBase]: For 3384/4337 co-relation queries the response was YES. [2023-08-04 03:09:15,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14785 conditions, 5283 events. 3795/5283 cut-off events. For 3384/4337 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 23222 event pairs, 1976 based on Foata normal form. 953/5042 useless extension candidates. Maximal degree in co-relation 14592. Up to 4092 conditions per place. [2023-08-04 03:09:15,313 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 62 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-04 03:09:15,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 451 flow [2023-08-04 03:09:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 03:09:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 03:09:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-04 03:09:15,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797872340425532 [2023-08-04 03:09:15,318 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-04 03:09:15,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-04 03:09:15,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:15,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-04 03:09:15,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 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-04 03:09:15,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:15,321 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 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-04 03:09:15,321 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 212 flow. Second operand 4 states and 451 transitions. [2023-08-04 03:09:15,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 451 flow [2023-08-04 03:09:15,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 442 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 03:09:15,331 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 220 flow [2023-08-04 03:09:15,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-08-04 03:09:15,332 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-04 03:09:15,332 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 220 flow [2023-08-04 03:09:15,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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-04 03:09:15,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:15,333 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] [2023-08-04 03:09:15,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 03:09:15,333 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:15,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 248950914, now seen corresponding path program 1 times [2023-08-04 03:09:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:15,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338328588] [2023-08-04 03:09:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:09:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:15,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338328588] [2023-08-04 03:09:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338328588] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:15,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761097226] [2023-08-04 03:09:15,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:15,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:15,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:15,810 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:09:15,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 03:09:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:15,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 03:09:15,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:16,380 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:09:16,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:09:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 03:09:17,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761097226] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:09:17,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:09:17,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 18 [2023-08-04 03:09:17,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571331724] [2023-08-04 03:09:17,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:09:17,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 03:09:17,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:17,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 03:09:17,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-08-04 03:09:17,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 235 [2023-08-04 03:09:17,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 220 flow. Second operand has 20 states, 20 states have (on average 93.2) internal successors, (1864), 20 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-04 03:09:17,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:17,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 235 [2023-08-04 03:09:17,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:09:55,189 INFO L124 PetriNetUnfolderBase]: 75899/103293 cut-off events. [2023-08-04 03:09:55,190 INFO L125 PetriNetUnfolderBase]: For 89431/92321 co-relation queries the response was YES. [2023-08-04 03:09:55,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310709 conditions, 103293 events. 75899/103293 cut-off events. For 89431/92321 co-relation queries the response was YES. Maximal size of possible extension queue 2370. Compared 652726 event pairs, 1091 based on Foata normal form. 2892/81542 useless extension candidates. Maximal degree in co-relation 309543. Up to 18375 conditions per place. [2023-08-04 03:09:55,871 INFO L140 encePairwiseOnDemand]: 224/235 looper letters, 1304 selfloop transitions, 357 changer transitions 24/1690 dead transitions. [2023-08-04 03:09:55,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 1690 transitions, 11272 flow [2023-08-04 03:09:55,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-08-04 03:09:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2023-08-04 03:09:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 7336 transitions. [2023-08-04 03:09:55,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4729851708575113 [2023-08-04 03:09:55,888 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 7336 transitions. [2023-08-04 03:09:55,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 7336 transitions. [2023-08-04 03:09:55,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:09:55,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 7336 transitions. [2023-08-04 03:09:55,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 111.15151515151516) internal successors, (7336), 66 states have internal predecessors, (7336), 0 states have call successors, (0), 0 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-04 03:09:55,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 67 states, 67 states have (on average 235.0) internal successors, (15745), 67 states have internal predecessors, (15745), 0 states have call successors, (0), 0 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-04 03:09:55,931 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 235.0) internal successors, (15745), 67 states have internal predecessors, (15745), 0 states have call successors, (0), 0 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-04 03:09:55,931 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 220 flow. Second operand 66 states and 7336 transitions. [2023-08-04 03:09:55,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 1690 transitions, 11272 flow [2023-08-04 03:09:56,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 1690 transitions, 11055 flow, removed 60 selfloop flow, removed 2 redundant places. [2023-08-04 03:09:56,599 INFO L231 Difference]: Finished difference. Result has 167 places, 444 transitions, 2855 flow [2023-08-04 03:09:56,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=2855, PETRI_PLACES=167, PETRI_TRANSITIONS=444} [2023-08-04 03:09:56,600 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 126 predicate places. [2023-08-04 03:09:56,600 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 444 transitions, 2855 flow [2023-08-04 03:09:56,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 93.2) internal successors, (1864), 20 states have internal predecessors, (1864), 0 states have call successors, (0), 0 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-04 03:09:56,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:09:56,602 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] [2023-08-04 03:09:56,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 03:09:56,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 03:09:56,807 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:09:56,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:09:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash 259949640, now seen corresponding path program 1 times [2023-08-04 03:09:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:09:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580846676] [2023-08-04 03:09:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:09:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 03:09:57,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:09:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580846676] [2023-08-04 03:09:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580846676] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:09:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120528899] [2023-08-04 03:09:57,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:09:57,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:09:57,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:09:57,099 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:09:57,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 03:09:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:09:57,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-04 03:09:57,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:09:57,211 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-04 03:09:57,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-04 03:09:57,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 03:09:57,291 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-04 03:09:57,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 03:09:57,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 03:09:57,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-04 03:09:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 03:09:57,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:09:57,788 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_369 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (<= .cse0 2147483647) (not (= (+ 4294967296 |c_ULTIMATE.start_main_#t~pre9#1|) .cse0))))) (forall ((v_ArrVal_369 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (< 2147483647 .cse1) (not (= |c_ULTIMATE.start_main_#t~pre9#1| .cse1)))))) is different from false [2023-08-04 03:09:57,808 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_369 (Array Int Int))) (let ((.cse0 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= (+ 4294967296 |c_#pthreadsForks|) .cse0)) (<= .cse0 2147483647)))) (forall ((v_ArrVal_369 (Array Int Int))) (let ((.cse1 (mod (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= |c_#pthreadsForks| .cse1)) (< 2147483647 .cse1))))) is different from false [2023-08-04 03:09:57,888 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~#t1~0#1.offset| (* |c_ULTIMATE.start_main_~asdf~0#1| 4)))) (and (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_366 Int)) (let ((.cse0 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| (store .cse1 .cse2 v_ArrVal_366)) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (<= .cse0 2147483647) (not (= .cse0 (+ 4294967297 |c_#pthreadsForks|)))))) (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_366 Int)) (let ((.cse3 (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| (store .cse1 .cse2 v_ArrVal_366)) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_369) |c_ULTIMATE.start_main_~#t1~0#1.base|) |c_ULTIMATE.start_main_~#t1~0#1.offset|) 4294967296))) (or (not (= .cse3 (+ |c_#pthreadsForks| 1))) (< 2147483647 .cse3)))))) is different from false [2023-08-04 03:09:58,129 INFO L322 Elim1Store]: treesize reduction 21, result has 54.3 percent of original size [2023-08-04 03:09:58,130 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 52 [2023-08-04 03:09:58,144 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 03:09:58,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 58 [2023-08-04 03:09:58,149 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-08-04 03:09:58,188 INFO L322 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2023-08-04 03:09:58,189 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 1 [2023-08-04 03:09:58,209 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 9 not checked. [2023-08-04 03:09:58,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120528899] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:09:58,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:09:58,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 22 [2023-08-04 03:09:58,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315946487] [2023-08-04 03:09:58,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:09:58,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 03:09:58,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:09:58,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 03:09:58,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=328, Unknown=7, NotChecked=114, Total=506 [2023-08-04 03:09:58,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 235 [2023-08-04 03:09:58,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 444 transitions, 2855 flow. Second operand has 23 states, 23 states have (on average 65.56521739130434) internal successors, (1508), 23 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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-04 03:09:58,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:09:58,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 235 [2023-08-04 03:09:58,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:10:06,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:10:07,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 03:10:10,230 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([683] L54-1-->L54-1: Formula: (and (let ((.cse0 (mod v_~counter~0_108 4294967296))) (or (and (= |v_thread2Thread2of2ForFork1_#t~post2_13| |v_thread2Thread2of2ForFork1_#t~post2_12|) (= v_~counter~0_108 v_~counter~0_107) (= v_thread2Thread2of2ForFork1_~i~1_25 v_thread2Thread2of2ForFork1_~i~1_24) (<= .cse0 0)) (and (= v_~counter~0_108 (+ v_~counter~0_107 v_~C~0_71)) (= (+ v_thread2Thread2of2ForFork1_~i~1_25 1) v_thread2Thread2of2ForFork1_~i~1_24) (< 0 .cse0)))) (< (mod v_thread2Thread2of2ForFork1_~i~1_25 4294967296) (mod v_~M~0_104 4294967296))) InVars {~counter~0=v_~counter~0_108, ~M~0=v_~M~0_104, ~C~0=v_~C~0_71, thread2Thread2of2ForFork1_~i~1=v_thread2Thread2of2ForFork1_~i~1_25, thread2Thread2of2ForFork1_#t~post2=|v_thread2Thread2of2ForFork1_#t~post2_13|} OutVars{~counter~0=v_~counter~0_107, ~M~0=v_~M~0_104, ~C~0=v_~C~0_71, thread2Thread2of2ForFork1_~i~1=v_thread2Thread2of2ForFork1_~i~1_24, thread2Thread2of2ForFork1_#t~post2=|v_thread2Thread2of2ForFork1_#t~post2_12|} AuxVars[] AssignedVars[~counter~0, thread2Thread2of2ForFork1_~i~1, thread2Thread2of2ForFork1_#t~post2][704], [Black: 793#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 2134#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= ~counter~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 259#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 32#L74-8true, 47#L41-4true, Black: 1035#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 593#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 590#true, 46#L54-1true, Black: 265#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1256#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), Black: 1325#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 4#$Ultimate##0true, Black: 1332#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1643#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1725#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 417#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1657#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1663#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1408#(and (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1713#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1649#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1715#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1337#(or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1699#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1655#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1709#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1707#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1645#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)), Black: 1689#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1673#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1659#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1687#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1333#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1735#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1330#(= ~counter~0 0), Black: 1639#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1641#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1679#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1681#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), 1029#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1582#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0)), Black: 1334#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1647#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1723#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1651#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), 1331#(and (= thread1Thread1of2ForFork0_~i~0 0) (= ~counter~0 0)), Black: 1335#(or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1338#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 1685#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1705#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 36#L54-1true, Black: 1675#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))), Black: 1667#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1637#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1661#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1671#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296)) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))), thread1Thread1of2ForFork0InUse, 195#(<= |ULTIMATE.start_main_~asdf~2#1| 0), thread2Thread1of2ForFork1InUse, Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-04 03:10:10,231 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-04 03:10:10,231 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 03:10:10,231 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 03:10:10,231 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 03:10:10,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L41-4-->L41-4: Formula: (and (= v_~counter~0_131 (+ v_~counter~0_132 v_~C~0_89)) (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< (mod v_thread1Thread1of2ForFork0_~i~0_43 4294967296) (mod v_~M~0_132 4294967296))) InVars {~counter~0=v_~counter~0_132, ~M~0=v_~M~0_132, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~C~0=v_~C~0_89} OutVars{~counter~0=v_~counter~0_131, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, ~M~0=v_~M~0_132, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~C~0=v_~C~0_89} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][702], [Black: 793#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 259#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 32#L74-8true, Black: 1029#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 47#L41-4true, Black: 1035#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 593#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 590#true, 2136#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 46#L54-1true, Black: 265#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1256#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 4#$Ultimate##0true, Black: 1332#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1643#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1725#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 417#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1657#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1663#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1408#(and (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1713#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1649#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1715#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1337#(or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1699#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1655#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1709#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1707#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1645#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)), Black: 1689#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1673#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1659#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1687#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1333#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1735#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1330#(= ~counter~0 0), Black: 1639#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1641#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1679#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1681#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1582#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0)), Black: 1334#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1647#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1723#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1651#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1335#(or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1338#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 1685#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1705#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 36#L54-1true, Black: 1675#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))), Black: 1667#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1661#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1671#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296)) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))), thread1Thread1of2ForFork0InUse, 195#(<= |ULTIMATE.start_main_~asdf~2#1| 0), thread2Thread1of2ForFork1InUse, 1325#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 1637#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-04 03:10:10,232 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-04 03:10:10,232 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 03:10:10,232 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 03:10:10,232 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 03:10:10,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L41-4-->L41-4: Formula: (and (= v_~counter~0_137 (+ v_~counter~0_138 v_~C~0_93)) (< (mod v_thread1Thread2of2ForFork0_~i~0_38 4294967296) (mod v_~M~0_138 4294967296)) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37)) InVars {~counter~0=v_~counter~0_138, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138, ~C~0=v_~C~0_93} OutVars{~counter~0=v_~counter~0_137, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138, ~C~0=v_~C~0_93} AuxVars[] AssignedVars[~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][703], [Black: 793#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1332#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 259#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 32#L74-8true, 47#L41-4true, Black: 1035#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 593#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 590#true, 2136#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 46#L54-1true, Black: 265#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1256#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 53#L41-4true, Black: 1643#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1725#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 417#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1657#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1663#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1408#(and (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1713#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1649#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1715#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1337#(or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1699#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1655#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1709#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1707#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1645#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)), Black: 1689#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1673#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1659#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1687#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1333#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1735#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1330#(= ~counter~0 0), Black: 1639#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1641#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1679#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1681#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1582#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0)), 1029#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1334#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1647#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1723#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1651#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1335#(or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1338#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 1685#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1705#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 36#L54-1true, Black: 1675#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))), Black: 1667#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1637#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1661#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1671#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296)) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))), thread1Thread1of2ForFork0InUse, 195#(<= |ULTIMATE.start_main_~asdf~2#1| 0), thread2Thread1of2ForFork1InUse, 1325#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-04 03:10:10,754 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,754 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,754 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,754 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([683] L54-1-->L54-1: Formula: (and (let ((.cse0 (mod v_~counter~0_108 4294967296))) (or (and (= |v_thread2Thread2of2ForFork1_#t~post2_13| |v_thread2Thread2of2ForFork1_#t~post2_12|) (= v_~counter~0_108 v_~counter~0_107) (= v_thread2Thread2of2ForFork1_~i~1_25 v_thread2Thread2of2ForFork1_~i~1_24) (<= .cse0 0)) (and (= v_~counter~0_108 (+ v_~counter~0_107 v_~C~0_71)) (= (+ v_thread2Thread2of2ForFork1_~i~1_25 1) v_thread2Thread2of2ForFork1_~i~1_24) (< 0 .cse0)))) (< (mod v_thread2Thread2of2ForFork1_~i~1_25 4294967296) (mod v_~M~0_104 4294967296))) InVars {~counter~0=v_~counter~0_108, ~M~0=v_~M~0_104, ~C~0=v_~C~0_71, thread2Thread2of2ForFork1_~i~1=v_thread2Thread2of2ForFork1_~i~1_25, thread2Thread2of2ForFork1_#t~post2=|v_thread2Thread2of2ForFork1_#t~post2_13|} OutVars{~counter~0=v_~counter~0_107, ~M~0=v_~M~0_104, ~C~0=v_~C~0_71, thread2Thread2of2ForFork1_~i~1=v_thread2Thread2of2ForFork1_~i~1_24, thread2Thread2of2ForFork1_#t~post2=|v_thread2Thread2of2ForFork1_#t~post2_12|} AuxVars[] AssignedVars[~counter~0, thread2Thread2of2ForFork1_~i~1, thread2Thread2of2ForFork1_#t~post2][851], [Black: 793#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 259#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 47#L41-4true, Black: 1035#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 593#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 590#true, 46#L54-1true, Black: 265#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1256#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), Black: 1325#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 4#$Ultimate##0true, 112#L74-3true, Black: 1332#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1643#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1725#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 417#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1657#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1663#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1408#(and (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1713#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), 2142#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ 2 |ULTIMATE.start_main_#t~mem12#1|)) (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (= ~counter~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), Black: 1649#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1715#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1337#(or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1699#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1655#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1709#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1707#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1645#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)), Black: 1689#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1673#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1659#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1687#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1333#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1735#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1330#(= ~counter~0 0), Black: 1639#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1641#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1679#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1681#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), 1029#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1582#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0)), Black: 1334#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1647#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1723#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1651#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), 1331#(and (= thread1Thread1of2ForFork0_~i~0 0) (= ~counter~0 0)), Black: 1335#(or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1338#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 1685#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1705#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 36#L54-1true, Black: 1675#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))), Black: 1667#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1637#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1661#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1671#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296)) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))), thread1Thread1of2ForFork0InUse, 195#(<= |ULTIMATE.start_main_~asdf~2#1| 0), thread2Thread1of2ForFork1InUse, Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-04 03:10:10,900 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,900 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,900 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,900 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([745] L41-4-->L41-4: Formula: (and (= v_~counter~0_131 (+ v_~counter~0_132 v_~C~0_89)) (= (+ v_thread1Thread1of2ForFork0_~i~0_43 1) v_thread1Thread1of2ForFork0_~i~0_42) (< (mod v_thread1Thread1of2ForFork0_~i~0_43 4294967296) (mod v_~M~0_132 4294967296))) InVars {~counter~0=v_~counter~0_132, ~M~0=v_~M~0_132, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_43, ~C~0=v_~C~0_89} OutVars{~counter~0=v_~counter~0_131, thread1Thread1of2ForFork0_#t~post1=|v_thread1Thread1of2ForFork0_#t~post1_28|, ~M~0=v_~M~0_132, thread1Thread1of2ForFork0_~i~0=v_thread1Thread1of2ForFork0_~i~0_42, ~C~0=v_~C~0_89} AuxVars[] AssignedVars[~counter~0, thread1Thread1of2ForFork0_#t~post1, thread1Thread1of2ForFork0_~i~0][849], [Black: 793#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 259#(<= |ULTIMATE.start_main_~asdf~3#1| 0), Black: 1029#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), 47#L41-4true, Black: 1035#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 593#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 590#true, 2144#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ 2 |ULTIMATE.start_main_#t~mem12#1|)) (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 46#L54-1true, Black: 265#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1256#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 112#L74-3true, 4#$Ultimate##0true, Black: 1332#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1643#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1725#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 417#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1657#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1663#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1408#(and (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1713#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1649#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1715#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1337#(or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1699#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1655#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1709#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1707#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1645#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)), Black: 1689#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1673#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1659#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1687#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1333#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1735#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1330#(= ~counter~0 0), Black: 1639#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1641#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1679#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1681#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1582#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0)), Black: 1334#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1647#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1723#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1651#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1335#(or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1338#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 1685#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1705#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 36#L54-1true, Black: 1675#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))), Black: 1667#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1661#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1671#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296)) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))), thread1Thread1of2ForFork0InUse, 195#(<= |ULTIMATE.start_main_~asdf~2#1| 0), thread2Thread1of2ForFork1InUse, 1325#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 1637#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))]) [2023-08-04 03:10:10,901 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,901 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,901 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:10,901 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 03:10:11,710 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([753] L41-4-->L41-4: Formula: (and (= v_~counter~0_137 (+ v_~counter~0_138 v_~C~0_93)) (< (mod v_thread1Thread2of2ForFork0_~i~0_38 4294967296) (mod v_~M~0_138 4294967296)) (= (+ v_thread1Thread2of2ForFork0_~i~0_38 1) v_thread1Thread2of2ForFork0_~i~0_37)) InVars {~counter~0=v_~counter~0_138, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_38, ~M~0=v_~M~0_138, ~C~0=v_~C~0_93} OutVars{~counter~0=v_~counter~0_137, thread1Thread2of2ForFork0_~i~0=v_thread1Thread2of2ForFork0_~i~0_37, thread1Thread2of2ForFork0_#t~post1=|v_thread1Thread2of2ForFork0_#t~post1_29|, ~M~0=v_~M~0_138, ~C~0=v_~C~0_93} AuxVars[] AssignedVars[~counter~0, thread1Thread2of2ForFork0_~i~0, thread1Thread2of2ForFork0_#t~post1][850], [Black: 793#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 1332#(and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 259#(<= |ULTIMATE.start_main_~asdf~3#1| 0), 47#L41-4true, Black: 1035#(and (= thread1Thread2of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 593#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 590#true, 2144#(and (not (= |ULTIMATE.start_main_~#t2~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= 0 |ULTIMATE.start_main_~asdf~2#1|) (= thread2Thread1of2ForFork1_thidvar0 (+ 2 |ULTIMATE.start_main_#t~mem12#1|)) (= thread2Thread1of2ForFork1_~i~1 0) (= thread2Thread1of2ForFork1_thidvar0 (+ (select (select |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base|) 0) 2)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 46#L54-1true, Black: 265#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 149#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 1256#(< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)), 53#L41-4true, 112#L74-3true, Black: 1643#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1725#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 417#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 1657#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1663#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1408#(and (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1713#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1649#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1715#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1337#(or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))), Black: 1699#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1655#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1709#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))))), Black: 1707#(and (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1645#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)), Black: 1689#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1673#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1659#(and (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)))), Black: 1687#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1333#(and (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1735#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), Black: 1330#(= ~counter~0 0), Black: 1639#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1641#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1679#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1681#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1582#(or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0)), 1029#(and (= thread1Thread1of2ForFork0_~i~0 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1334#(and (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1647#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1723#(and (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1651#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (< 1 (mod ~M~0 4294967296)) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 1) ~C~0)) 4294967296) 4294967296) 4294967295 ~C~0) ~counter~0) (<= (mod ~counter~0 4294967296) 0)) (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (< (mod thread2Thread1of2ForFork1_~i~1 4294967296) (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1335#(or (and (= thread2Thread1of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (and (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0))), Black: 1338#(= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)), Black: 1685#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (or (= thread2Thread2of2ForFork1_~i~1 0) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296))) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (or (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0))), Black: 1705#(and (or (= ~counter~0 (+ (* (div (+ ~counter~0 (* (- 1) ~C~0)) 4294967296) 4294967296) ~C~0)) (<= (mod ~counter~0 4294967296) 0)) (or (and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)) (= ~counter~0 (* (div ~counter~0 4294967296) 4294967296)))), 36#L54-1true, Black: 1675#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296))), Black: 1667#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (or (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (< 1 (mod ~M~0 4294967296)) (<= (mod ~counter~0 4294967296) 0)) (or (< thread2Thread1of2ForFork1_~i~1 (+ (* 4294967296 (div (+ thread2Thread1of2ForFork1_~i~1 (- 4294967295)) 4294967296)) 4294967295 (mod ~M~0 4294967296))) (<= (mod (+ ~counter~0 (* 4294967295 ~C~0)) 4294967296) 0) (<= (mod ~counter~0 4294967296) 0) (< (+ (* (div (+ ~counter~0 (- 1) (* (- 2) ~C~0)) 4294967296) 4294967296) 4294967295 (* 2 ~C~0)) ~counter~0))), Black: 1637#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0)), Black: 1661#(and (or (< (+ (* 4294967296 (div (+ ~counter~0 (- 1)) 4294967296)) 4294967295) ~counter~0) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))) (= thread2Thread1of2ForFork1_~i~1 0) (<= (* 2 ~C~0) ~counter~0) (<= ~counter~0 (* 2 ~C~0)) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 1671#(and (= thread2Thread1of2ForFork1_~i~1 1) (<= ~counter~0 ~C~0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0) (<= ~C~0 ~counter~0) (< 0 (mod (+ ~counter~0 ~C~0) 4294967296)) (< 0 (mod thread1Thread1of2ForFork0_~i~0 4294967296))), thread1Thread1of2ForFork0InUse, 195#(<= |ULTIMATE.start_main_~asdf~2#1| 0), thread2Thread1of2ForFork1InUse, 1325#(and (= thread2Thread2of2ForFork1_~i~1 0) (<= (+ (* (div ~M~0 4294967296) 4294967296) 1) ~M~0)), Black: 124#(= 0 |ULTIMATE.start_main_~asdf~0#1|)]) [2023-08-04 03:10:11,710 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 03:10:11,710 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:10:11,710 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:10:11,710 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 03:10:28,994 INFO L124 PetriNetUnfolderBase]: 105462/141526 cut-off events. [2023-08-04 03:10:28,995 INFO L125 PetriNetUnfolderBase]: For 1620333/1644061 co-relation queries the response was YES. [2023-08-04 03:10:30,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 680341 conditions, 141526 events. 105462/141526 cut-off events. For 1620333/1644061 co-relation queries the response was YES. Maximal size of possible extension queue 2928. Compared 873966 event pairs, 12556 based on Foata normal form. 20863/160236 useless extension candidates. Maximal degree in co-relation 674498. Up to 75697 conditions per place. [2023-08-04 03:10:31,047 INFO L140 encePairwiseOnDemand]: 215/235 looper letters, 1745 selfloop transitions, 296 changer transitions 0/2064 dead transitions. [2023-08-04 03:10:31,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 2064 transitions, 17289 flow [2023-08-04 03:10:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-04 03:10:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-04 03:10:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2295 transitions. [2023-08-04 03:10:31,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29593810444874274 [2023-08-04 03:10:31,050 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2295 transitions. [2023-08-04 03:10:31,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2295 transitions. [2023-08-04 03:10:31,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:10:31,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2295 transitions. [2023-08-04 03:10:31,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 69.54545454545455) internal successors, (2295), 33 states have internal predecessors, (2295), 0 states have call successors, (0), 0 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-04 03:10:31,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 235.0) internal successors, (7990), 34 states have internal predecessors, (7990), 0 states have call successors, (0), 0 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-04 03:10:31,059 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 235.0) internal successors, (7990), 34 states have internal predecessors, (7990), 0 states have call successors, (0), 0 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-04 03:10:31,059 INFO L175 Difference]: Start difference. First operand has 167 places, 444 transitions, 2855 flow. Second operand 33 states and 2295 transitions. [2023-08-04 03:10:31,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 2064 transitions, 17289 flow [2023-08-04 03:10:40,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 2064 transitions, 17077 flow, removed 106 selfloop flow, removed 0 redundant places. [2023-08-04 03:10:40,254 INFO L231 Difference]: Finished difference. Result has 221 places, 731 transitions, 6031 flow [2023-08-04 03:10:40,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=2793, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=6031, PETRI_PLACES=221, PETRI_TRANSITIONS=731} [2023-08-04 03:10:40,255 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 180 predicate places. [2023-08-04 03:10:40,255 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 731 transitions, 6031 flow [2023-08-04 03:10:40,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 65.56521739130434) internal successors, (1508), 23 states have internal predecessors, (1508), 0 states have call successors, (0), 0 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-04 03:10:40,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:10:40,255 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] [2023-08-04 03:10:40,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-04 03:10:40,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:10:40,456 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:10:40,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:10:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1212634840, now seen corresponding path program 2 times [2023-08-04 03:10:40,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:10:40,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195055711] [2023-08-04 03:10:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:10:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:10:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:10:40,860 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 03:10:40,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:10:40,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195055711] [2023-08-04 03:10:40,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195055711] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:10:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728445886] [2023-08-04 03:10:40,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 03:10:40,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:10:40,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:10:40,870 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:10:40,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 03:10:40,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 03:10:40,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:10:40,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 03:10:40,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:10:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:10:41,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:10:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 03:10:42,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728445886] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:10:42,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:10:42,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2023-08-04 03:10:42,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482511249] [2023-08-04 03:10:42,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:10:42,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 03:10:42,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:10:42,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 03:10:42,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2023-08-04 03:10:42,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 235 [2023-08-04 03:10:42,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 731 transitions, 6031 flow. Second operand has 20 states, 20 states have (on average 93.5) internal successors, (1870), 20 states have internal predecessors, (1870), 0 states have call successors, (0), 0 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-04 03:10:42,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:10:42,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 235 [2023-08-04 03:10:42,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 03:12:30,598 INFO L124 PetriNetUnfolderBase]: 319028/448332 cut-off events. [2023-08-04 03:12:30,599 INFO L125 PetriNetUnfolderBase]: For 8244010/8264963 co-relation queries the response was YES. [2023-08-04 03:12:37,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738654 conditions, 448332 events. 319028/448332 cut-off events. For 8244010/8264963 co-relation queries the response was YES. Maximal size of possible extension queue 9476. Compared 3537628 event pairs, 36267 based on Foata normal form. 25459/470743 useless extension candidates. Maximal degree in co-relation 2697663. Up to 93699 conditions per place. [2023-08-04 03:12:40,039 INFO L140 encePairwiseOnDemand]: 223/235 looper letters, 2509 selfloop transitions, 1918 changer transitions 118/4558 dead transitions. [2023-08-04 03:12:40,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 4558 transitions, 47530 flow [2023-08-04 03:12:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2023-08-04 03:12:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2023-08-04 03:12:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 8318 transitions. [2023-08-04 03:12:40,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46573348264277714 [2023-08-04 03:12:40,048 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 8318 transitions. [2023-08-04 03:12:40,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 8318 transitions. [2023-08-04 03:12:40,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 03:12:40,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 8318 transitions. [2023-08-04 03:12:40,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 109.44736842105263) internal successors, (8318), 76 states have internal predecessors, (8318), 0 states have call successors, (0), 0 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-04 03:12:40,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 235.0) internal successors, (18095), 77 states have internal predecessors, (18095), 0 states have call successors, (0), 0 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-04 03:12:40,070 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 235.0) internal successors, (18095), 77 states have internal predecessors, (18095), 0 states have call successors, (0), 0 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-04 03:12:40,070 INFO L175 Difference]: Start difference. First operand has 221 places, 731 transitions, 6031 flow. Second operand 76 states and 8318 transitions. [2023-08-04 03:12:40,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 4558 transitions, 47530 flow [2023-08-04 03:19:31,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 4558 transitions, 45899 flow, removed 647 selfloop flow, removed 6 redundant places. [2023-08-04 03:19:31,792 INFO L231 Difference]: Finished difference. Result has 359 places, 2449 transitions, 27996 flow [2023-08-04 03:19:31,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=5682, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=27996, PETRI_PLACES=359, PETRI_TRANSITIONS=2449} [2023-08-04 03:19:31,793 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 318 predicate places. [2023-08-04 03:19:31,793 INFO L495 AbstractCegarLoop]: Abstraction has has 359 places, 2449 transitions, 27996 flow [2023-08-04 03:19:31,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 93.5) internal successors, (1870), 20 states have internal predecessors, (1870), 0 states have call successors, (0), 0 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-04 03:19:31,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 03:19:31,794 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] [2023-08-04 03:19:31,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 03:19:31,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:19:31,995 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 03:19:31,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 03:19:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash 340491554, now seen corresponding path program 3 times [2023-08-04 03:19:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 03:19:31,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994421991] [2023-08-04 03:19:31,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 03:19:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 03:19:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 03:19:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 03:19:32,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 03:19:32,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994421991] [2023-08-04 03:19:32,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994421991] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 03:19:32,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179405941] [2023-08-04 03:19:32,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 03:19:32,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 03:19:32,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 03:19:32,368 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 03:19:32,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 03:19:32,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-04 03:19:32,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 03:19:32,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 03:19:32,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 03:19:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 03:19:32,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 03:19:33,223 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 03:19:33,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179405941] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 03:19:33,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 03:19:33,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2023-08-04 03:19:33,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493651218] [2023-08-04 03:19:33,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 03:19:33,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-04 03:19:33,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 03:19:33,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-04 03:19:33,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2023-08-04 03:19:33,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 235 [2023-08-04 03:19:33,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 2449 transitions, 27996 flow. Second operand has 22 states, 22 states have (on average 90.22727272727273) internal successors, (1985), 22 states have internal predecessors, (1985), 0 states have call successors, (0), 0 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-04 03:19:33,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 03:19:33,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 235 [2023-08-04 03:19:33,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand