/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/pthread-wmm_safe034_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 01:13:07,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 01:13:07,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 01:13:07,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 01:13:07,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 01:13:07,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 01:13:07,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 01:13:07,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 01:13:07,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 01:13:07,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 01:13:07,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 01:13:07,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 01:13:07,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 01:13:07,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 01:13:07,238 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 01:13:07,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 01:13:07,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 01:13:07,239 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 01:13:07,239 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 01:13:07,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 01:13:07,240 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 01:13:07,240 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 01:13:07,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 01:13:07,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 01:13:07,241 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 01:13:07,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 01:13:07,241 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 01:13:07,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 01:13:07,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 01:13:07,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 01:13:07,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:13:07,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 01:13:07,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 01:13:07,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 01:13:07,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 01:13:07,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 01:13:07,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 01:13:07,245 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 01:13:07,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 01:13:07,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 01:13:07,245 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 01:13:07,245 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 01:13:07,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 01:13:07,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 01:13:07,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 01:13:07,510 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 01:13:07,510 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 01:13:07,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe034_tso_bound2.i [2023-08-04 01:13:09,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 01:13:09,373 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 01:13:09,374 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe034_tso_bound2.i [2023-08-04 01:13:09,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ef8c18e/2579067c0e8e462098f68573c89fd65c/FLAGb5446c7b3 [2023-08-04 01:13:09,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ef8c18e/2579067c0e8e462098f68573c89fd65c [2023-08-04 01:13:09,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 01:13:09,402 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 01:13:09,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 01:13:09,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 01:13:09,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 01:13:09,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418a58c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09, skipping insertion in model container [2023-08-04 01:13:09,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,442 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 01:13:09,587 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe034_tso_bound2.i[945,958] [2023-08-04 01:13:09,781 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:13:09,795 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 01:13:09,806 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe034_tso_bound2.i[945,958] [2023-08-04 01:13:09,814 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 01:13:09,816 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 01:13:09,832 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:13:09,855 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 01:13:09,855 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 01:13:09,861 INFO L206 MainTranslator]: Completed translation [2023-08-04 01:13:09,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09 WrapperNode [2023-08-04 01:13:09,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 01:13:09,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 01:13:09,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 01:13:09,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 01:13:09,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,896 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-08-04 01:13:09,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 01:13:09,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 01:13:09,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 01:13:09,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 01:13:09,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 01:13:09,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 01:13:09,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 01:13:09,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 01:13:09,922 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (1/1) ... [2023-08-04 01:13:09,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:13:09,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:09,957 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 01:13:09,972 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 01:13:09,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 01:13:09,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 01:13:09,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 01:13:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 01:13:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 01:13:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 01:13:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 01:13:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 01:13:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 01:13:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 01:13:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 01:13:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 01:13:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 01:13:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 01:13:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 01:13:09,999 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 01:13:10,100 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 01:13:10,101 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 01:13:10,237 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 01:13:10,243 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 01:13:10,243 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 01:13:10,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:13:10 BoogieIcfgContainer [2023-08-04 01:13:10,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 01:13:10,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 01:13:10,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 01:13:10,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 01:13:10,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 01:13:09" (1/3) ... [2023-08-04 01:13:10,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224cf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:13:10, skipping insertion in model container [2023-08-04 01:13:10,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:13:09" (2/3) ... [2023-08-04 01:13:10,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224cf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:13:10, skipping insertion in model container [2023-08-04 01:13:10,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:13:10" (3/3) ... [2023-08-04 01:13:10,258 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe034_tso_bound2.i [2023-08-04 01:13:10,281 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 01:13:10,288 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 01:13:10,288 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 01:13:10,288 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 01:13:10,340 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 01:13:10,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 01:13:10,480 INFO L124 PetriNetUnfolderBase]: 30/414 cut-off events. [2023-08-04 01:13:10,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:13:10,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 414 events. 30/414 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1854 event pairs, 0 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 243. Up to 16 conditions per place. [2023-08-04 01:13:10,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 106 transitions, 227 flow [2023-08-04 01:13:10,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 171 flow [2023-08-04 01:13:10,497 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:13:10,504 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 171 flow [2023-08-04 01:13:10,506 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 171 flow [2023-08-04 01:13:10,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 171 flow [2023-08-04 01:13:10,540 INFO L124 PetriNetUnfolderBase]: 6/190 cut-off events. [2023-08-04 01:13:10,541 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:13:10,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 190 events. 6/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 585 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 131. Up to 8 conditions per place. [2023-08-04 01:13:10,544 INFO L119 LiptonReduction]: Number of co-enabled transitions 1116 [2023-08-04 01:13:12,294 INFO L134 LiptonReduction]: Checked pairs total: 2162 [2023-08-04 01:13:12,295 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-04 01:13:12,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:13:12,312 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;@49a1e4f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:13:12,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 01:13:12,316 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:13:12,317 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-08-04 01:13:12,317 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:13:12,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:12,317 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 01:13:12,318 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:13:12,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:12,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1987024987, now seen corresponding path program 1 times [2023-08-04 01:13:12,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:12,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855260733] [2023-08-04 01:13:12,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:12,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:13:12,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:13:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:13:12,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:13:12,473 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:13:12,473 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 01:13:12,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 01:13:12,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 01:13:12,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 01:13:12,476 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 01:13:12,479 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-04 01:13:12,480 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 01:13:12,480 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 01:13:12,500 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 01:13:12,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 01:13:12,649 INFO L124 PetriNetUnfolderBase]: 93/1304 cut-off events. [2023-08-04 01:13:12,650 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:13:12,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 1304 events. 93/1304 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8908 event pairs, 0 based on Foata normal form. 0/1145 useless extension candidates. Maximal degree in co-relation 945. Up to 54 conditions per place. [2023-08-04 01:13:12,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 01:13:12,663 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 99 transitions, 234 flow [2023-08-04 01:13:12,664 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:13:12,664 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 99 transitions, 234 flow [2023-08-04 01:13:12,664 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 99 transitions, 234 flow [2023-08-04 01:13:12,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 99 transitions, 234 flow [2023-08-04 01:13:12,717 INFO L124 PetriNetUnfolderBase]: 12/548 cut-off events. [2023-08-04 01:13:12,717 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:13:12,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 548 events. 12/548 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2794 event pairs, 0 based on Foata normal form. 0/524 useless extension candidates. Maximal degree in co-relation 441. Up to 27 conditions per place. [2023-08-04 01:13:12,728 INFO L119 LiptonReduction]: Number of co-enabled transitions 2988 [2023-08-04 01:13:14,328 INFO L134 LiptonReduction]: Checked pairs total: 6639 [2023-08-04 01:13:14,329 INFO L136 LiptonReduction]: Total number of compositions: 66 [2023-08-04 01:13:14,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:13:14,332 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;@49a1e4f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:13:14,332 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 01:13:14,338 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:13:14,339 INFO L124 PetriNetUnfolderBase]: 0/62 cut-off events. [2023-08-04 01:13:14,339 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 01:13:14,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:14,339 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:14,339 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:13:14,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash 232190998, now seen corresponding path program 1 times [2023-08-04 01:13:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:14,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305508212] [2023-08-04 01:13:14,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:14,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:13:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:14,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305508212] [2023-08-04 01:13:14,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305508212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:14,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:13:14,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:13:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638196341] [2023-08-04 01:13:14,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:14,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:13:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:13:14,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:13:14,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 193 [2023-08-04 01:13:14,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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 01:13:14,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:14,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 193 [2023-08-04 01:13:14,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:16,385 INFO L124 PetriNetUnfolderBase]: 12844/19664 cut-off events. [2023-08-04 01:13:16,386 INFO L125 PetriNetUnfolderBase]: For 1770/1770 co-relation queries the response was YES. [2023-08-04 01:13:16,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39351 conditions, 19664 events. 12844/19664 cut-off events. For 1770/1770 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 137183 event pairs, 9918 based on Foata normal form. 0/19237 useless extension candidates. Maximal degree in co-relation 11947. Up to 17234 conditions per place. [2023-08-04 01:13:16,530 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 01:13:16,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 180 flow [2023-08-04 01:13:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:13:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:13:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-04 01:13:16,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6286701208981001 [2023-08-04 01:13:16,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-04 01:13:16,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-04 01:13:16,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:16,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-04 01:13:16,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 01:13:16,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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 01:13:16,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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 01:13:16,557 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 112 flow. Second operand 3 states and 364 transitions. [2023-08-04 01:13:16,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 180 flow [2023-08-04 01:13:16,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 174 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 01:13:16,565 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 118 flow [2023-08-04 01:13:16,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-04 01:13:16,569 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 01:13:16,569 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 118 flow [2023-08-04 01:13:16,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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 01:13:16,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:16,570 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 01:13:16,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 01:13:16,570 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:13:16,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -239917551, now seen corresponding path program 1 times [2023-08-04 01:13:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:16,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824487540] [2023-08-04 01:13:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:16,733 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 01:13:16,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:16,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824487540] [2023-08-04 01:13:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824487540] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:13:16,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 01:13:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545777998] [2023-08-04 01:13:16,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:16,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:13:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:13:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:16,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193 [2023-08-04 01:13:16,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 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 01:13:16,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:16,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193 [2023-08-04 01:13:16,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:18,260 INFO L124 PetriNetUnfolderBase]: 12832/19625 cut-off events. [2023-08-04 01:13:18,260 INFO L125 PetriNetUnfolderBase]: For 1479/1479 co-relation queries the response was YES. [2023-08-04 01:13:18,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39027 conditions, 19625 events. 12832/19625 cut-off events. For 1479/1479 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 137371 event pairs, 7728 based on Foata normal form. 9/19225 useless extension candidates. Maximal degree in co-relation 13971. Up to 17187 conditions per place. [2023-08-04 01:13:18,410 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 31 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-04 01:13:18,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 202 flow [2023-08-04 01:13:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:13:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:13:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-08-04 01:13:18,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6072538860103627 [2023-08-04 01:13:18,414 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-08-04 01:13:18,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-08-04 01:13:18,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:18,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-08-04 01:13:18,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 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 01:13:18,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 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 01:13:18,421 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 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 01:13:18,421 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 118 flow. Second operand 5 states and 586 transitions. [2023-08-04 01:13:18,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 202 flow [2023-08-04 01:13:18,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 199 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:13:18,423 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 132 flow [2023-08-04 01:13:18,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2023-08-04 01:13:18,423 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-04 01:13:18,424 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 132 flow [2023-08-04 01:13:18,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 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 01:13:18,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:18,424 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:18,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 01:13:18,425 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:13:18,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash 156180993, now seen corresponding path program 1 times [2023-08-04 01:13:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028763687] [2023-08-04 01:13:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 01:13:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028763687] [2023-08-04 01:13:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028763687] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135657080] [2023-08-04 01:13:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:18,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:18,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:18,513 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 01:13:18,673 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 01:13:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:18,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:13:18,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:13:18,791 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:13:18,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135657080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:18,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:13:18,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:13:18,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242180389] [2023-08-04 01:13:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:18,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:13:18,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:18,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:13:18,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:18,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 193 [2023-08-04 01:13:18,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 01:13:18,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:18,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 193 [2023-08-04 01:13:18,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:19,963 INFO L124 PetriNetUnfolderBase]: 12242/18740 cut-off events. [2023-08-04 01:13:19,963 INFO L125 PetriNetUnfolderBase]: For 1366/1366 co-relation queries the response was YES. [2023-08-04 01:13:20,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37339 conditions, 18740 events. 12242/18740 cut-off events. For 1366/1366 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 130883 event pairs, 9508 based on Foata normal form. 0/18487 useless extension candidates. Maximal degree in co-relation 11408. Up to 16198 conditions per place. [2023-08-04 01:13:20,202 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 33 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-08-04 01:13:20,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 220 flow [2023-08-04 01:13:20,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:13:20,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:13:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-04 01:13:20,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6355785837651122 [2023-08-04 01:13:20,204 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-04 01:13:20,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-04 01:13:20,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:20,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-04 01:13:20,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 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 01:13:20,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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 01:13:20,207 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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 01:13:20,207 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 132 flow. Second operand 3 states and 368 transitions. [2023-08-04 01:13:20,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 220 flow [2023-08-04 01:13:20,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 213 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 01:13:20,210 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 140 flow [2023-08-04 01:13:20,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2023-08-04 01:13:20,211 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-04 01:13:20,211 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 140 flow [2023-08-04 01:13:20,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 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 01:13:20,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:20,211 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:20,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 01:13:20,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:20,417 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:13:20,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash -988090287, now seen corresponding path program 1 times [2023-08-04 01:13:20,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:20,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835087285] [2023-08-04 01:13:20,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:20,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:20,493 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 01:13:20,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:20,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835087285] [2023-08-04 01:13:20,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835087285] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:20,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253659556] [2023-08-04 01:13:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:20,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:20,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:20,502 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 01:13:20,517 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 01:13:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:20,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:13:20,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:20,624 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 01:13:20,624 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:13:20,646 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 01:13:20,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253659556] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:13:20,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:13:20,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 01:13:20,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993334166] [2023-08-04 01:13:20,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:13:20,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:13:20,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:20,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:13:20,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:13:20,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193 [2023-08-04 01:13:20,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:20,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:20,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193 [2023-08-04 01:13:20,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:21,684 INFO L124 PetriNetUnfolderBase]: 9694/14591 cut-off events. [2023-08-04 01:13:21,684 INFO L125 PetriNetUnfolderBase]: For 1233/1233 co-relation queries the response was YES. [2023-08-04 01:13:21,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29316 conditions, 14591 events. 9694/14591 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 95547 event pairs, 5616 based on Foata normal form. 3/14512 useless extension candidates. Maximal degree in co-relation 10429. Up to 12736 conditions per place. [2023-08-04 01:13:21,755 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 32 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-04 01:13:21,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 46 transitions, 217 flow [2023-08-04 01:13:21,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:13:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:13:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-04 01:13:21,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6152849740932642 [2023-08-04 01:13:21,758 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-04 01:13:21,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-04 01:13:21,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:21,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-04 01:13:21,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 01:13:21,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 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 01:13:21,762 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 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 01:13:21,762 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 140 flow. Second operand 4 states and 475 transitions. [2023-08-04 01:13:21,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 46 transitions, 217 flow [2023-08-04 01:13:21,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:13:21,764 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 135 flow [2023-08-04 01:13:21,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2023-08-04 01:13:21,765 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-04 01:13:21,765 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 135 flow [2023-08-04 01:13:21,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:21,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:21,766 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:21,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 01:13:21,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:21,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:13:21,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:21,972 INFO L85 PathProgramCache]: Analyzing trace with hash 808684443, now seen corresponding path program 1 times [2023-08-04 01:13:21,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:21,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398905663] [2023-08-04 01:13:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:21,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:22,085 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 01:13:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398905663] [2023-08-04 01:13:22,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398905663] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:22,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981647255] [2023-08-04 01:13:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:22,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:22,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:22,088 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 01:13:22,117 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 01:13:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:22,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:13:22,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:22,200 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 01:13:22,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:13:22,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981647255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:22,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:13:22,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 01:13:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336361767] [2023-08-04 01:13:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:22,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:13:22,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:22,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:13:22,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:13:22,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193 [2023-08-04 01:13:22,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 01:13:22,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:22,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193 [2023-08-04 01:13:22,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:23,011 INFO L124 PetriNetUnfolderBase]: 9478/14173 cut-off events. [2023-08-04 01:13:23,012 INFO L125 PetriNetUnfolderBase]: For 1006/1006 co-relation queries the response was YES. [2023-08-04 01:13:23,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28560 conditions, 14173 events. 9478/14173 cut-off events. For 1006/1006 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 91665 event pairs, 2182 based on Foata normal form. 81/14253 useless extension candidates. Maximal degree in co-relation 10157. Up to 11907 conditions per place. [2023-08-04 01:13:23,124 INFO L140 encePairwiseOnDemand]: 189/193 looper letters, 44 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-08-04 01:13:23,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 269 flow [2023-08-04 01:13:23,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:13:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:13:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-08-04 01:13:23,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6196891191709845 [2023-08-04 01:13:23,128 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-08-04 01:13:23,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-08-04 01:13:23,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:23,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-08-04 01:13:23,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 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 01:13:23,138 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 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 01:13:23,139 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 193.0) internal successors, (1158), 6 states have internal predecessors, (1158), 0 states have call successors, (0), 0 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 01:13:23,140 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 135 flow. Second operand 5 states and 598 transitions. [2023-08-04 01:13:23,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 269 flow [2023-08-04 01:13:23,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 262 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 01:13:23,142 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 145 flow [2023-08-04 01:13:23,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2023-08-04 01:13:23,145 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-04 01:13:23,145 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 145 flow [2023-08-04 01:13:23,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 01:13:23,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:23,146 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:23,156 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 01:13:23,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:23,352 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:13:23,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1576963012, now seen corresponding path program 1 times [2023-08-04 01:13:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004088933] [2023-08-04 01:13:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:13:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004088933] [2023-08-04 01:13:23,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004088933] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:23,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956240174] [2023-08-04 01:13:23,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:23,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:23,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:23,426 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 01:13:23,451 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 01:13:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:23,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:13:23,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:23,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:13:23,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:13:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:13:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956240174] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:13:23,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:13:23,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:13:23,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173934049] [2023-08-04 01:13:23,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:13:23,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:13:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:23,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:13:23,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:23,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 193 [2023-08-04 01:13:23,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 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 01:13:23,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:23,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 193 [2023-08-04 01:13:23,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:24,179 INFO L124 PetriNetUnfolderBase]: 7588/11203 cut-off events. [2023-08-04 01:13:24,179 INFO L125 PetriNetUnfolderBase]: For 1324/1324 co-relation queries the response was YES. [2023-08-04 01:13:24,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22923 conditions, 11203 events. 7588/11203 cut-off events. For 1324/1324 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 68991 event pairs, 4450 based on Foata normal form. 27/11229 useless extension candidates. Maximal degree in co-relation 8129. Up to 9394 conditions per place. [2023-08-04 01:13:24,248 INFO L140 encePairwiseOnDemand]: 190/193 looper letters, 40 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-08-04 01:13:24,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 255 flow [2023-08-04 01:13:24,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:13:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:13:24,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 01:13:24,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6256476683937824 [2023-08-04 01:13:24,252 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 01:13:24,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 01:13:24,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:24,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 01:13:24,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 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 01:13:24,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 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 01:13:24,257 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 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 01:13:24,257 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 145 flow. Second operand 4 states and 483 transitions. [2023-08-04 01:13:24,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 255 flow [2023-08-04 01:13:24,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 250 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 01:13:24,260 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 138 flow [2023-08-04 01:13:24,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2023-08-04 01:13:24,262 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-04 01:13:24,262 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 138 flow [2023-08-04 01:13:24,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 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 01:13:24,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:24,263 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:24,271 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 01:13:24,469 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 01:13:24,470 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 01:13:24,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1509952786, now seen corresponding path program 1 times [2023-08-04 01:13:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:24,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799914120] [2023-08-04 01:13:24,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:24,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:13:24,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:24,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799914120] [2023-08-04 01:13:24,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799914120] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:24,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060831358] [2023-08-04 01:13:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:24,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:24,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:24,559 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 01:13:24,563 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 01:13:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:24,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:13:24,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:13:24,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:13:24,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060831358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:24,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:13:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 01:13:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208271478] [2023-08-04 01:13:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:24,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:13:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:24,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:13:24,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:24,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 193 [2023-08-04 01:13:24,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 138 flow. Second operand has 4 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 01:13:24,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:24,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 193 [2023-08-04 01:13:24,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:25,166 INFO L124 PetriNetUnfolderBase]: 4672/7036 cut-off events. [2023-08-04 01:13:25,167 INFO L125 PetriNetUnfolderBase]: For 1198/1198 co-relation queries the response was YES. [2023-08-04 01:13:25,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14895 conditions, 7036 events. 4672/7036 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 40731 event pairs, 568 based on Foata normal form. 729/7764 useless extension candidates. Maximal degree in co-relation 7349. Up to 4212 conditions per place. [2023-08-04 01:13:25,188 INFO L140 encePairwiseOnDemand]: 191/193 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2023-08-04 01:13:25,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 262 flow [2023-08-04 01:13:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:13:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:13:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-04 01:13:25,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.633419689119171 [2023-08-04 01:13:25,190 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-04 01:13:25,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-04 01:13:25,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:25,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-04 01:13:25,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 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 01:13:25,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 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 01:13:25,192 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 193.0) internal successors, (965), 5 states have internal predecessors, (965), 0 states have call successors, (0), 0 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 01:13:25,192 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 138 flow. Second operand 4 states and 489 transitions. [2023-08-04 01:13:25,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 262 flow [2023-08-04 01:13:25,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 55 transitions, 255 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 01:13:25,217 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2023-08-04 01:13:25,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=193, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2023-08-04 01:13:25,218 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-04 01:13:25,218 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2023-08-04 01:13:25,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 01:13:25,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 01:13:25,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 01:13:25,219 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 01:13:25,225 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 01:13:25,424 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 01:13:25,425 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:25,425 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-04 01:13:25,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 01:13:25,529 INFO L124 PetriNetUnfolderBase]: 93/1304 cut-off events. [2023-08-04 01:13:25,529 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 01:13:25,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 1304 events. 93/1304 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8908 event pairs, 0 based on Foata normal form. 0/1145 useless extension candidates. Maximal degree in co-relation 945. Up to 54 conditions per place. [2023-08-04 01:13:25,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 127 transitions, 290 flow [2023-08-04 01:13:25,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 112 transitions, 248 flow [2023-08-04 01:13:25,536 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:13:25,536 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 112 transitions, 248 flow [2023-08-04 01:13:25,537 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 112 transitions, 248 flow [2023-08-04 01:13:25,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 112 transitions, 248 flow [2023-08-04 01:13:25,607 INFO L124 PetriNetUnfolderBase]: 66/967 cut-off events. [2023-08-04 01:13:25,607 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 01:13:25,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1039 conditions, 967 events. 66/967 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6008 event pairs, 0 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 717. Up to 54 conditions per place. [2023-08-04 01:13:25,619 INFO L119 LiptonReduction]: Number of co-enabled transitions 3996 [2023-08-04 01:13:27,295 INFO L134 LiptonReduction]: Checked pairs total: 7935 [2023-08-04 01:13:27,296 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-08-04 01:13:27,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 01:13:27,300 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;@49a1e4f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:13:27,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 01:13:27,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:13:27,302 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-08-04 01:13:27,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:13:27,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:27,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 01:13:27,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:13:27,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash 621838518, now seen corresponding path program 1 times [2023-08-04 01:13:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120419644] [2023-08-04 01:13:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:27,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:27,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 01:13:27,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:27,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120419644] [2023-08-04 01:13:27,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120419644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:27,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:13:27,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:13:27,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387484523] [2023-08-04 01:13:27,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:27,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:13:27,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:27,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:13:27,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:13:27,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 207 [2023-08-04 01:13:27,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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 01:13:27,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:27,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 207 [2023-08-04 01:13:27,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:30,120 INFO L124 PetriNetUnfolderBase]: 33046/47771 cut-off events. [2023-08-04 01:13:30,121 INFO L125 PetriNetUnfolderBase]: For 1425/1425 co-relation queries the response was YES. [2023-08-04 01:13:30,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93162 conditions, 47771 events. 33046/47771 cut-off events. For 1425/1425 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 334140 event pairs, 26064 based on Foata normal form. 0/45433 useless extension candidates. Maximal degree in co-relation 26554. Up to 43520 conditions per place. [2023-08-04 01:13:30,450 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 31 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 01:13:30,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 174 flow [2023-08-04 01:13:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:13:30,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:13:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 01:13:30,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909822866344605 [2023-08-04 01:13:30,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 01:13:30,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 01:13:30,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:30,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 01:13:30,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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 01:13:30,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 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 01:13:30,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 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 01:13:30,455 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 100 flow. Second operand 3 states and 367 transitions. [2023-08-04 01:13:30,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 174 flow [2023-08-04 01:13:30,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 01:13:30,457 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 112 flow [2023-08-04 01:13:30,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-04 01:13:30,457 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 01:13:30,457 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 112 flow [2023-08-04 01:13:30,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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 01:13:30,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:30,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:30,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 01:13:30,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:13:30,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:30,459 INFO L85 PathProgramCache]: Analyzing trace with hash -890753855, now seen corresponding path program 1 times [2023-08-04 01:13:30,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:30,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531077306] [2023-08-04 01:13:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:30,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:30,503 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 01:13:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531077306] [2023-08-04 01:13:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531077306] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398043622] [2023-08-04 01:13:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:30,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:30,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:30,505 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 01:13:30,514 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 01:13:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:30,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:13:30,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:30,607 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 01:13:30,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:13:30,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398043622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:30,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:13:30,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:13:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686378121] [2023-08-04 01:13:30,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:30,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:13:30,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:30,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:13:30,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:30,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 207 [2023-08-04 01:13:30,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 01:13:30,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:30,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 207 [2023-08-04 01:13:30,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:32,663 INFO L124 PetriNetUnfolderBase]: 31406/44873 cut-off events. [2023-08-04 01:13:32,664 INFO L125 PetriNetUnfolderBase]: For 1143/1143 co-relation queries the response was YES. [2023-08-04 01:13:32,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87754 conditions, 44873 events. 31406/44873 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 1589. Compared 307315 event pairs, 24928 based on Foata normal form. 0/42784 useless extension candidates. Maximal degree in co-relation 87717. Up to 40987 conditions per place. [2023-08-04 01:13:32,979 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 36 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-04 01:13:32,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 204 flow [2023-08-04 01:13:32,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:13:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:13:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-04 01:13:32,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5974235104669887 [2023-08-04 01:13:32,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-04 01:13:32,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-04 01:13:32,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:32,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-04 01:13:32,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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 01:13:32,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 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 01:13:32,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 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 01:13:32,984 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 112 flow. Second operand 3 states and 371 transitions. [2023-08-04 01:13:32,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 204 flow [2023-08-04 01:13:32,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:13:32,987 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 122 flow [2023-08-04 01:13:32,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2023-08-04 01:13:32,987 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-04 01:13:32,987 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 122 flow [2023-08-04 01:13:32,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 01:13:32,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:32,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:33,003 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 01:13:33,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:33,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:13:33,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:33,196 INFO L85 PathProgramCache]: Analyzing trace with hash 493468303, now seen corresponding path program 1 times [2023-08-04 01:13:33,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:33,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663902633] [2023-08-04 01:13:33,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:33,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:33,234 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 01:13:33,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:33,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663902633] [2023-08-04 01:13:33,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663902633] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:33,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891650809] [2023-08-04 01:13:33,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:33,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:33,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:33,236 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 01:13:33,239 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 01:13:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:33,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 01:13:33,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:33,317 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 01:13:33,317 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:13:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891650809] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:33,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:13:33,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 01:13:33,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535477883] [2023-08-04 01:13:33,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:33,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:13:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:33,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:13:33,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:33,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 207 [2023-08-04 01:13:33,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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 01:13:33,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:33,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 207 [2023-08-04 01:13:33,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:35,602 INFO L124 PetriNetUnfolderBase]: 30734/43358 cut-off events. [2023-08-04 01:13:35,602 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2023-08-04 01:13:35,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85613 conditions, 43358 events. 30734/43358 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 1567. Compared 290488 event pairs, 23582 based on Foata normal form. 0/41626 useless extension candidates. Maximal degree in co-relation 24344. Up to 37757 conditions per place. [2023-08-04 01:13:35,857 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 41 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 01:13:35,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 232 flow [2023-08-04 01:13:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:13:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:13:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-04 01:13:35,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6038647342995169 [2023-08-04 01:13:35,858 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-04 01:13:35,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-04 01:13:35,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:35,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-04 01:13:35,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:35,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 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 01:13:35,861 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 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 01:13:35,861 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 122 flow. Second operand 3 states and 375 transitions. [2023-08-04 01:13:35,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 232 flow [2023-08-04 01:13:35,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:13:35,863 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 132 flow [2023-08-04 01:13:35,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-04 01:13:35,864 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-04 01:13:35,864 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 132 flow [2023-08-04 01:13:35,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 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 01:13:35,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:35,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:35,873 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 01:13:36,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:36,070 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:13:36,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1808195894, now seen corresponding path program 1 times [2023-08-04 01:13:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:36,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968886745] [2023-08-04 01:13:36,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:36,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:36,102 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 01:13:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968886745] [2023-08-04 01:13:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968886745] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145356311] [2023-08-04 01:13:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:36,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:36,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:36,104 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 01:13:36,129 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 01:13:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:36,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:13:36,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:36,202 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 01:13:36,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:13:36,217 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 01:13:36,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145356311] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:13:36,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:13:36,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:13:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796429605] [2023-08-04 01:13:36,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:13:36,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:13:36,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:36,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:13:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:36,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 207 [2023-08-04 01:13:36,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:36,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:36,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 207 [2023-08-04 01:13:36,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:38,267 INFO L124 PetriNetUnfolderBase]: 24232/33893 cut-off events. [2023-08-04 01:13:38,268 INFO L125 PetriNetUnfolderBase]: For 3624/3624 co-relation queries the response was YES. [2023-08-04 01:13:38,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69782 conditions, 33893 events. 24232/33893 cut-off events. For 3624/3624 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 213758 event pairs, 14820 based on Foata normal form. 3/33868 useless extension candidates. Maximal degree in co-relation 24810. Up to 31258 conditions per place. [2023-08-04 01:13:38,562 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 36 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 01:13:38,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 228 flow [2023-08-04 01:13:38,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:13:38,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:13:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-04 01:13:38,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5785024154589372 [2023-08-04 01:13:38,564 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-04 01:13:38,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-04 01:13:38,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:38,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-04 01:13:38,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 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 01:13:38,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 01:13:38,568 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 01:13:38,568 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 132 flow. Second operand 4 states and 479 transitions. [2023-08-04 01:13:38,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 228 flow [2023-08-04 01:13:38,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:13:38,573 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 144 flow [2023-08-04 01:13:38,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2023-08-04 01:13:38,573 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-04 01:13:38,574 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 144 flow [2023-08-04 01:13:38,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:38,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:38,574 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:38,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 01:13:38,779 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,SelfDestructingSolverStorable11 [2023-08-04 01:13:38,780 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:13:38,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:38,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1460060414, now seen corresponding path program 1 times [2023-08-04 01:13:38,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:38,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356161954] [2023-08-04 01:13:38,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:38,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 01:13:38,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356161954] [2023-08-04 01:13:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356161954] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:38,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122342143] [2023-08-04 01:13:38,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:38,833 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 01:13:38,836 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 01:13:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:38,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:13:38,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:38,930 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 01:13:38,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:13:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 01:13:38,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122342143] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:13:38,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:13:38,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:13:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663391172] [2023-08-04 01:13:38,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:13:38,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:13:38,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:38,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:13:38,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:38,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 207 [2023-08-04 01:13:38,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:38,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:38,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 207 [2023-08-04 01:13:38,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:40,519 INFO L124 PetriNetUnfolderBase]: 19198/26485 cut-off events. [2023-08-04 01:13:40,519 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2023-08-04 01:13:40,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54371 conditions, 26485 events. 19198/26485 cut-off events. For 2439/2439 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 159969 event pairs, 11902 based on Foata normal form. 27/26511 useless extension candidates. Maximal degree in co-relation 19295. Up to 23785 conditions per place. [2023-08-04 01:13:40,721 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 44 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-04 01:13:40,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 272 flow [2023-08-04 01:13:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:13:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:13:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-04 01:13:40,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5881642512077294 [2023-08-04 01:13:40,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-04 01:13:40,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-04 01:13:40,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:40,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-04 01:13:40,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 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 01:13:40,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 01:13:40,726 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 01:13:40,726 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 144 flow. Second operand 4 states and 487 transitions. [2023-08-04 01:13:40,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 272 flow [2023-08-04 01:13:40,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 57 transitions, 265 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:13:40,731 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 151 flow [2023-08-04 01:13:40,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=64, PETRI_TRANSITIONS=41} [2023-08-04 01:13:40,732 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-04 01:13:40,732 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 151 flow [2023-08-04 01:13:40,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:13:40,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:40,732 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:13:40,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 01:13:40,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 01:13:40,937 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:13:40,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash 532466159, now seen corresponding path program 1 times [2023-08-04 01:13:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:40,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171174705] [2023-08-04 01:13:40,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:40,989 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:13:40,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:40,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171174705] [2023-08-04 01:13:40,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171174705] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:13:40,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613259093] [2023-08-04 01:13:40,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:40,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:13:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:13:40,992 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 01:13:41,004 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 01:13:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:41,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:13:41,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:13:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:13:41,096 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:13:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 01:13:41,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613259093] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:13:41,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:13:41,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 01:13:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006059407] [2023-08-04 01:13:41,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:13:41,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:13:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:41,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:13:41,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:13:41,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 207 [2023-08-04 01:13:41,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 41 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 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 01:13:41,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:41,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 207 [2023-08-04 01:13:41,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:42,262 INFO L124 PetriNetUnfolderBase]: 17362/23209 cut-off events. [2023-08-04 01:13:42,262 INFO L125 PetriNetUnfolderBase]: For 2377/2377 co-relation queries the response was YES. [2023-08-04 01:13:42,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48754 conditions, 23209 events. 17362/23209 cut-off events. For 2377/2377 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 127913 event pairs, 6886 based on Foata normal form. 243/23451 useless extension candidates. Maximal degree in co-relation 17297. Up to 11794 conditions per place. [2023-08-04 01:13:42,427 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 52 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-04 01:13:42,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 311 flow [2023-08-04 01:13:42,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:13:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:13:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-04 01:13:42,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2023-08-04 01:13:42,429 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-04 01:13:42,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-04 01:13:42,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:42,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-04 01:13:42,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 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 01:13:42,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 01:13:42,432 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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 01:13:42,432 INFO L175 Difference]: Start difference. First operand has 64 places, 41 transitions, 151 flow. Second operand 4 states and 495 transitions. [2023-08-04 01:13:42,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 311 flow [2023-08-04 01:13:42,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 304 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:13:42,436 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 158 flow [2023-08-04 01:13:42,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=66, PETRI_TRANSITIONS=41} [2023-08-04 01:13:42,436 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-04 01:13:42,437 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 158 flow [2023-08-04 01:13:42,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.0) internal successors, (570), 5 states have internal predecessors, (570), 0 states have call successors, (0), 0 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 01:13:42,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:42,437 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] [2023-08-04 01:13:42,447 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 01:13:42,642 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,SelfDestructingSolverStorable13 [2023-08-04 01:13:42,642 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:13:42,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -447653865, now seen corresponding path program 1 times [2023-08-04 01:13:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444713728] [2023-08-04 01:13:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:42,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:42,805 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 01:13:42,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:42,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444713728] [2023-08-04 01:13:42,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444713728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:42,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:13:42,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 01:13:42,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197497322] [2023-08-04 01:13:42,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:42,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:13:42,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:42,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:13:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:13:42,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 207 [2023-08-04 01:13:42,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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 01:13:42,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:42,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 207 [2023-08-04 01:13:42,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:52,828 INFO L124 PetriNetUnfolderBase]: 135854/170677 cut-off events. [2023-08-04 01:13:52,828 INFO L125 PetriNetUnfolderBase]: For 82111/82111 co-relation queries the response was YES. [2023-08-04 01:13:53,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388451 conditions, 170677 events. 135854/170677 cut-off events. For 82111/82111 co-relation queries the response was YES. Maximal size of possible extension queue 4931. Compared 952109 event pairs, 55970 based on Foata normal form. 3088/173680 useless extension candidates. Maximal degree in co-relation 388360. Up to 115574 conditions per place. [2023-08-04 01:13:54,231 INFO L140 encePairwiseOnDemand]: 197/207 looper letters, 64 selfloop transitions, 9 changer transitions 0/76 dead transitions. [2023-08-04 01:13:54,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 444 flow [2023-08-04 01:13:54,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:13:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:13:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-04 01:13:54,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6119162640901772 [2023-08-04 01:13:54,232 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-04 01:13:54,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-04 01:13:54,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:13:54,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-04 01:13:54,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 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 01:13:54,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 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 01:13:54,235 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 207.0) internal successors, (828), 4 states have internal predecessors, (828), 0 states have call successors, (0), 0 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 01:13:54,235 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 158 flow. Second operand 3 states and 380 transitions. [2023-08-04 01:13:54,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 444 flow [2023-08-04 01:13:54,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 430 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 01:13:54,526 INFO L231 Difference]: Finished difference. Result has 67 places, 49 transitions, 221 flow [2023-08-04 01:13:54,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=221, PETRI_PLACES=67, PETRI_TRANSITIONS=49} [2023-08-04 01:13:54,527 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-08-04 01:13:54,527 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 49 transitions, 221 flow [2023-08-04 01:13:54,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 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 01:13:54,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:13:54,527 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] [2023-08-04 01:13:54,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 01:13:54,528 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:13:54,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:13:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -992368794, now seen corresponding path program 1 times [2023-08-04 01:13:54,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:13:54,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588354792] [2023-08-04 01:13:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:13:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:13:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:13:54,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 01:13:54,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:13:54,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588354792] [2023-08-04 01:13:54,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588354792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:13:54,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:13:54,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:13:54,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384558517] [2023-08-04 01:13:54,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:13:54,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:13:54,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:13:54,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:13:54,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:13:54,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 207 [2023-08-04 01:13:54,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 49 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 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 01:13:54,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:13:54,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 207 [2023-08-04 01:13:54,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:13:55,458 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 451#(= 0 |ULTIMATE.start_main_~asdf~2#1|), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 449#true, 64#L787-6true, 13#L731true, 58#L743true, 82#L763true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:55,459 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-08-04 01:13:55,459 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 01:13:55,459 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 01:13:55,459 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 01:13:55,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 451#(= 0 |ULTIMATE.start_main_~asdf~2#1|), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 449#true, 64#L787-6true, 13#L731true, 93#L748true, 82#L763true, Black: 601#true, 92#L726true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:55,491 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is not cut-off event [2023-08-04 01:13:55,491 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 01:13:55,491 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 01:13:55,491 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is not cut-off event [2023-08-04 01:13:55,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 451#(= 0 |ULTIMATE.start_main_~asdf~2#1|), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 449#true, 64#L787-6true, 13#L731true, 93#L748true, 82#L763true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:55,647 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is not cut-off event [2023-08-04 01:13:55,647 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-08-04 01:13:55,647 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-08-04 01:13:55,647 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is not cut-off event [2023-08-04 01:13:56,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 13#L731true, 58#L743true, 82#L763true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:56,079 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-08-04 01:13:56,079 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 01:13:56,079 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 01:13:56,079 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 01:13:56,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 13#L731true, 93#L748true, 82#L763true, Black: 601#true, 92#L726true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:56,140 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is not cut-off event [2023-08-04 01:13:56,140 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 01:13:56,140 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 01:13:56,140 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is not cut-off event [2023-08-04 01:13:56,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 13#L731true, 93#L748true, 82#L763true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:56,536 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,536 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,536 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,536 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,536 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, 36#L787-5true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 13#L731true, 58#L743true, 82#L763true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:56,536 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,536 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,536 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,536 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,624 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, 36#L787-5true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 13#L731true, 93#L748true, 82#L763true, Black: 601#true, 92#L726true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:56,624 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,624 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,624 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:56,624 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is not cut-off event [2023-08-04 01:13:57,148 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([458] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][58], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, 36#L787-5true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 13#L731true, 93#L748true, 82#L763true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:57,149 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,149 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 107#L763true, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 13#L731true, 64#L787-6true, 58#L743true, 68#$Ultimate##0true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:57,150 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,150 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,150 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,150 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,295 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 13#L731true, 64#L787-6true, 93#L748true, 68#$Ultimate##0true, 92#L726true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:57,295 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,295 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,295 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,295 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is not cut-off event [2023-08-04 01:13:57,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 64#L787-6true, 13#L731true, 93#L748true, 68#$Ultimate##0true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:57,968 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-08-04 01:13:57,968 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:57,968 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:57,968 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:57,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, 43#L760true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 64#L787-6true, 13#L731true, 58#L743true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:57,968 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-08-04 01:13:57,968 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:57,968 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:57,968 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:58,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, 43#L760true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 64#L787-6true, 13#L731true, 93#L748true, Black: 601#true, 92#L726true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:58,124 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is not cut-off event [2023-08-04 01:13:58,124 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:58,124 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:58,124 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is not cut-off event [2023-08-04 01:13:58,832 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, 43#L760true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 449#true, 64#L787-6true, 13#L731true, 93#L748true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:58,832 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-04 01:13:58,832 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:58,832 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:58,833 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:58,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 58#L743true, 68#$Ultimate##0true, P1Thread1of2ForFork1InUse, Black: 601#true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:58,833 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-04 01:13:58,833 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:58,833 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:58,834 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:59,016 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, 68#$Ultimate##0true, Black: 601#true, 92#L726true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:59,016 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-04 01:13:59,017 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:59,017 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:59,017 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-04 01:13:59,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, 68#$Ultimate##0true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:59,767 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-08-04 01:13:59,768 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:13:59,768 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:13:59,768 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:13:59,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, 43#L760true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 58#L743true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:13:59,770 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-08-04 01:13:59,770 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:13:59,770 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:13:59,770 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:13:59,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 114#P1EXITtrue, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread2of2ForFork0InUse, 102#L748true, 97#$Ultimate##0true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 601#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 68#$Ultimate##0true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 607#true]) [2023-08-04 01:13:59,774 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-04 01:13:59,774 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 01:13:59,774 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 01:13:59,774 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-04 01:14:00,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, 43#L760true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, Black: 601#true, 92#L726true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:14:00,200 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is not cut-off event [2023-08-04 01:14:00,200 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:14:00,200 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:14:00,200 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is not cut-off event [2023-08-04 01:14:00,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L760-->L763: Formula: (= v_~z~0_2 1) InVars {} OutVars{~z~0=v_~z~0_2} AuxVars[] AssignedVars[~z~0][72], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 107#L763true, 102#L748true, 43#L760true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 40#L787-11true, 609#(= ~__unbuffered_cnt~0 0), 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, Black: 601#true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:14:00,871 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is not cut-off event [2023-08-04 01:14:00,871 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:14:00,871 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:14:00,872 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is not cut-off event [2023-08-04 01:14:00,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 114#P1EXITtrue, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread2of2ForFork0InUse, 102#L748true, 43#L760true, 97#$Ultimate##0true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 601#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 607#true]) [2023-08-04 01:14:00,881 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:14:00,882 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:00,882 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:00,882 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:00,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 114#P1EXITtrue, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 90#L760true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 601#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 68#$Ultimate##0true, P1Thread1of2ForFork1InUse, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 607#true]) [2023-08-04 01:14:00,882 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:14:00,882 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:00,883 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:00,883 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [120#L726true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 83#P2EXITtrue, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread2of2ForFork0InUse, 102#L748true, 97#$Ultimate##0true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 601#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 93#L748true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 607#true]) [2023-08-04 01:14:01,127 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,127 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,127 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,127 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 83#P2EXITtrue, P2Thread2of2ForFork2InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, 97#$Ultimate##0true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 601#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L726true, P1Thread1of2ForFork1InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 607#true]) [2023-08-04 01:14:01,395 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,395 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,395 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,396 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 01:14:01,981 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 114#P1EXITtrue, P2Thread2of2ForFork2InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, 43#L760true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 90#L760true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 601#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, 607#true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 01:14:01,981 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:14:01,981 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:01,981 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:01,981 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 83#P2EXITtrue, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread2of2ForFork0InUse, 102#L748true, 97#$Ultimate##0true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 601#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 607#true]) [2023-08-04 01:14:02,002 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,002 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,002 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,002 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [120#L726true, P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 83#P2EXITtrue, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 90#L760true, 601#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 93#L748true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, 607#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 01:14:02,013 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,013 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,013 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,013 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, 83#P2EXITtrue, P2Thread2of2ForFork2InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 90#L760true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 601#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 92#L726true, P1Thread1of2ForFork1InUse, 607#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 01:14:02,198 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,198 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,198 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,198 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-08-04 01:14:02,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 83#P2EXITtrue, P0Thread1of2ForFork0InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 65#L731true, 90#L760true, 601#true, Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, 607#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 01:14:02,419 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 01:14:02,419 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 01:14:02,419 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 01:14:02,419 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 01:14:03,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, 9#P0EXITtrue, P2Thread1of2ForFork2InUse, 83#P2EXITtrue, P2Thread2of2ForFork2InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread1of2ForFork0InUse, 107#L763true, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 601#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, 607#true, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 01:14:03,254 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 01:14:03,254 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 01:14:03,254 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 01:14:03,254 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 01:14:03,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, 9#P0EXITtrue, P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 102#L748true, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 601#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 76#P2EXITtrue, 13#L731true, 93#L748true, 82#L763true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 607#true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 01:14:03,254 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 01:14:03,254 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 01:14:03,254 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 01:14:03,254 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 01:14:03,331 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([621] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 2 v_~z~0_In_1) (= v_~__unbuffered_p1_EAX~0_In_1 0) (= v_~__unbuffered_p0_EAX~0_In_1 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_Out_2) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2| (mod v_~main$tmp_guard1~0_Out_2 256)) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1| 0))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ~z~0=v_~z~0_In_1, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_Out_2|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_In_1, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_Out_2|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_In_1, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_In_1|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_Out_2, ~z~0=v_~z~0_In_1} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][93], [P1Thread2of2ForFork1InUse, 9#P0EXITtrue, P2Thread1of2ForFork2InUse, 83#P2EXITtrue, P2Thread2of2ForFork2InUse, 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P0Thread1of2ForFork0InUse, 107#L763true, P0Thread2of2ForFork0InUse, 118#P1EXITtrue, Black: 165#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 140#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 452#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 601#true, Black: 211#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 13#L731true, 93#L748true, Black: 603#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), P1Thread1of2ForFork1InUse, Black: 220#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 607#true, Black: 324#(<= |ULTIMATE.start_main_~asdf~1#1| 1)]) [2023-08-04 01:14:03,331 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-04 01:14:03,331 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 01:14:03,331 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 01:14:03,331 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 01:14:03,368 INFO L124 PetriNetUnfolderBase]: 93903/124379 cut-off events. [2023-08-04 01:14:03,369 INFO L125 PetriNetUnfolderBase]: For 74349/78214 co-relation queries the response was YES. [2023-08-04 01:14:04,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308839 conditions, 124379 events. 93903/124379 cut-off events. For 74349/78214 co-relation queries the response was YES. Maximal size of possible extension queue 6711. Compared 830580 event pairs, 22237 based on Foata normal form. 3818/115476 useless extension candidates. Maximal degree in co-relation 189155. Up to 88314 conditions per place. [2023-08-04 01:14:04,685 INFO L140 encePairwiseOnDemand]: 198/207 looper letters, 79 selfloop transitions, 14 changer transitions 0/108 dead transitions. [2023-08-04 01:14:04,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 108 transitions, 624 flow [2023-08-04 01:14:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:14:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:14:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 601 transitions. [2023-08-04 01:14:04,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806763285024155 [2023-08-04 01:14:04,687 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 601 transitions. [2023-08-04 01:14:04,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 601 transitions. [2023-08-04 01:14:04,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:14:04,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 601 transitions. [2023-08-04 01:14:04,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 0 states have call successors, (0), 0 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 01:14:04,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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 01:14:04,690 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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 01:14:04,690 INFO L175 Difference]: Start difference. First operand has 67 places, 49 transitions, 221 flow. Second operand 5 states and 601 transitions. [2023-08-04 01:14:04,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 108 transitions, 624 flow [2023-08-04 01:14:04,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:14:04,905 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 312 flow [2023-08-04 01:14:04,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2023-08-04 01:14:04,906 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places. [2023-08-04 01:14:04,906 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 312 flow [2023-08-04 01:14:04,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 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 01:14:04,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:14:04,906 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] [2023-08-04 01:14:04,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 01:14:04,906 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:14:04,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:14:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1105944551, now seen corresponding path program 1 times [2023-08-04 01:14:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:14:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443421165] [2023-08-04 01:14:04,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:14:04,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:14:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:14:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:14:05,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:14:05,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443421165] [2023-08-04 01:14:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443421165] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:14:05,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960766135] [2023-08-04 01:14:05,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:14:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:14:05,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:14:05,108 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 01:14:05,113 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 01:14:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:14:05,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-04 01:14:05,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:14:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:14:05,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:14:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 01:14:05,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960766135] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:14:05,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:14:05,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 13 [2023-08-04 01:14:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466595782] [2023-08-04 01:14:05,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:14:05,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-04 01:14:05,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:14:05,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-04 01:14:05,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-08-04 01:14:05,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 207 [2023-08-04 01:14:05,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 312 flow. Second operand has 15 states, 15 states have (on average 94.13333333333334) internal successors, (1412), 15 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:14:05,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:14:05,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 207 [2023-08-04 01:14:05,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:14:30,012 INFO L124 PetriNetUnfolderBase]: 259440/338428 cut-off events. [2023-08-04 01:14:30,012 INFO L125 PetriNetUnfolderBase]: For 385811/385811 co-relation queries the response was YES. [2023-08-04 01:14:31,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109979 conditions, 338428 events. 259440/338428 cut-off events. For 385811/385811 co-relation queries the response was YES. Maximal size of possible extension queue 11746. Compared 2235236 event pairs, 1853 based on Foata normal form. 10951/349361 useless extension candidates. Maximal degree in co-relation 1109871. Up to 118707 conditions per place. [2023-08-04 01:14:32,477 INFO L140 encePairwiseOnDemand]: 188/207 looper letters, 339 selfloop transitions, 313 changer transitions 362/1017 dead transitions. [2023-08-04 01:14:32,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 1017 transitions, 6594 flow [2023-08-04 01:14:32,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-04 01:14:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-04 01:14:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4461 transitions. [2023-08-04 01:14:32,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538768115942029 [2023-08-04 01:14:32,487 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 4461 transitions. [2023-08-04 01:14:32,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 4461 transitions. [2023-08-04 01:14:32,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:14:32,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 4461 transitions. [2023-08-04 01:14:32,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 111.525) internal successors, (4461), 40 states have internal predecessors, (4461), 0 states have call successors, (0), 0 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 01:14:32,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 207.0) internal successors, (8487), 41 states have internal predecessors, (8487), 0 states have call successors, (0), 0 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 01:14:32,511 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 207.0) internal successors, (8487), 41 states have internal predecessors, (8487), 0 states have call successors, (0), 0 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 01:14:32,511 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 312 flow. Second operand 40 states and 4461 transitions. [2023-08-04 01:14:32,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 1017 transitions, 6594 flow [2023-08-04 01:14:35,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 1017 transitions, 6561 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:14:35,607 INFO L231 Difference]: Finished difference. Result has 143 places, 409 transitions, 3268 flow [2023-08-04 01:14:35,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3268, PETRI_PLACES=143, PETRI_TRANSITIONS=409} [2023-08-04 01:14:35,608 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 92 predicate places. [2023-08-04 01:14:35,608 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 409 transitions, 3268 flow [2023-08-04 01:14:35,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 94.13333333333334) internal successors, (1412), 15 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:14:35,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:14:35,609 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] [2023-08-04 01:14:35,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-04 01:14:35,813 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,SelfDestructingSolverStorable16 [2023-08-04 01:14:35,813 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 01:14:35,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:14:35,814 INFO L85 PathProgramCache]: Analyzing trace with hash 936451601, now seen corresponding path program 1 times [2023-08-04 01:14:35,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:14:35,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374490278] [2023-08-04 01:14:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:14:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:14:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:14:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:14:35,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:14:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374490278] [2023-08-04 01:14:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374490278] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:14:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825092332] [2023-08-04 01:14:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:14:35,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:14:35,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:14:35,958 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 01:14:35,965 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 01:14:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:14:36,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-04 01:14:36,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:14:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:14:36,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:14:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 01:14:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825092332] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:14:36,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:14:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 18 [2023-08-04 01:14:36,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449272958] [2023-08-04 01:14:36,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:14:36,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-04 01:14:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:14:36,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-04 01:14:36,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2023-08-04 01:14:36,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 207 [2023-08-04 01:14:36,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 409 transitions, 3268 flow. Second operand has 20 states, 20 states have (on average 90.6) internal successors, (1812), 20 states have internal predecessors, (1812), 0 states have call successors, (0), 0 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 01:14:36,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:14:36,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 207 [2023-08-04 01:14:36,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand