/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_safe001_tso_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 00:02:13,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 00:02:13,405 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 00:02:13,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 00:02:13,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 00:02:13,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 00:02:13,414 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 00:02:13,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 00:02:13,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 00:02:13,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 00:02:13,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 00:02:13,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 00:02:13,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 00:02:13,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 00:02:13,448 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 00:02:13,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 00:02:13,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 00:02:13,448 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 00:02:13,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 00:02:13,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 00:02:13,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 00:02:13,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 00:02:13,450 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 00:02:13,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 00:02:13,451 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 00:02:13,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 00:02:13,451 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 00:02:13,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 00:02:13,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 00:02:13,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 00:02:13,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:02:13,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 00:02:13,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 00:02:13,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 00:02:13,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 00:02:13,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 00:02:13,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 00:02:13,454 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 00:02:13,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 00:02:13,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 00:02:13,455 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 00:02:13,455 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 00:02:13,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 00:02:13,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 00:02:13,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 00:02:13,784 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 00:02:13,784 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 00:02:13,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe001_tso_bound2.i [2023-08-04 00:02:15,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 00:02:15,305 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 00:02:15,305 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe001_tso_bound2.i [2023-08-04 00:02:15,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f5c0086/9235e302ada941639e9af71385af9462/FLAG842e6b843 [2023-08-04 00:02:15,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f5c0086/9235e302ada941639e9af71385af9462 [2023-08-04 00:02:15,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 00:02:15,344 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 00:02:15,345 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 00:02:15,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 00:02:15,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 00:02:15,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37952640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15, skipping insertion in model container [2023-08-04 00:02:15,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,420 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 00:02:15,598 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_safe001_tso_bound2.i[945,958] [2023-08-04 00:02:15,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:02:15,789 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 00:02:15,801 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_safe001_tso_bound2.i[945,958] [2023-08-04 00:02:15,821 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 00:02:15,824 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 00:02:15,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:02:15,878 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:02:15,878 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:02:15,884 INFO L206 MainTranslator]: Completed translation [2023-08-04 00:02:15,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15 WrapperNode [2023-08-04 00:02:15,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 00:02:15,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 00:02:15,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 00:02:15,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 00:02:15,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,933 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2023-08-04 00:02:15,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 00:02:15,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 00:02:15,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 00:02:15,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 00:02:15,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 00:02:15,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 00:02:15,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 00:02:15,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 00:02:15,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (1/1) ... [2023-08-04 00:02:15,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:02:16,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:16,026 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 00:02:16,043 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 00:02:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 00:02:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 00:02:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 00:02:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 00:02:16,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 00:02:16,071 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 00:02:16,071 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 00:02:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 00:02:16,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 00:02:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 00:02:16,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 00:02:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 00:02:16,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 00:02:16,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 00:02:16,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 00:02:16,074 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 00:02:16,195 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 00:02:16,196 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 00:02:16,366 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 00:02:16,372 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 00:02:16,373 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 00:02:16,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:02:16 BoogieIcfgContainer [2023-08-04 00:02:16,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 00:02:16,377 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 00:02:16,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 00:02:16,384 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 00:02:16,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 12:02:15" (1/3) ... [2023-08-04 00:02:16,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad554d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:02:16, skipping insertion in model container [2023-08-04 00:02:16,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:02:15" (2/3) ... [2023-08-04 00:02:16,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad554d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:02:16, skipping insertion in model container [2023-08-04 00:02:16,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:02:16" (3/3) ... [2023-08-04 00:02:16,386 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe001_tso_bound2.i [2023-08-04 00:02:16,396 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 00:02:16,408 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 00:02:16,408 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 00:02:16,408 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 00:02:16,480 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:02:16,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 225 flow [2023-08-04 00:02:16,617 INFO L124 PetriNetUnfolderBase]: 30/413 cut-off events. [2023-08-04 00:02:16,617 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:02:16,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 413 events. 30/413 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1864 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 242. Up to 16 conditions per place. [2023-08-04 00:02:16,626 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 105 transitions, 225 flow [2023-08-04 00:02:16,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 169 flow [2023-08-04 00:02:16,632 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:02:16,640 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 169 flow [2023-08-04 00:02:16,642 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 169 flow [2023-08-04 00:02:16,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 169 flow [2023-08-04 00:02:16,676 INFO L124 PetriNetUnfolderBase]: 6/189 cut-off events. [2023-08-04 00:02:16,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:02:16,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 189 events. 6/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 586 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-08-04 00:02:16,678 INFO L119 LiptonReduction]: Number of co-enabled transitions 1116 [2023-08-04 00:02:18,301 INFO L134 LiptonReduction]: Checked pairs total: 2124 [2023-08-04 00:02:18,304 INFO L136 LiptonReduction]: Total number of compositions: 59 [2023-08-04 00:02:18,342 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:02:18,352 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;@3092bdc8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:02:18,353 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 00:02:18,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:02:18,364 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2023-08-04 00:02:18,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:02:18,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:18,366 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 00:02:18,366 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:02:18,372 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1897377976, now seen corresponding path program 1 times [2023-08-04 00:02:18,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:18,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544820886] [2023-08-04 00:02:18,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:02:18,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:02:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:02:18,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:02:18,564 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:02:18,565 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 00:02:18,566 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 00:02:18,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 00:02:18,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 00:02:18,568 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 00:02:18,572 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-04 00:02:18,573 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 00:02:18,573 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 00:02:18,603 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:02:18,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 288 flow [2023-08-04 00:02:18,830 INFO L124 PetriNetUnfolderBase]: 93/1303 cut-off events. [2023-08-04 00:02:18,830 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:02:18,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1303 events. 93/1303 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8914 event pairs, 0 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 944. Up to 54 conditions per place. [2023-08-04 00:02:18,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 288 flow [2023-08-04 00:02:18,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 98 transitions, 232 flow [2023-08-04 00:02:18,845 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:02:18,845 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 98 transitions, 232 flow [2023-08-04 00:02:18,846 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 98 transitions, 232 flow [2023-08-04 00:02:18,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 98 transitions, 232 flow [2023-08-04 00:02:18,909 INFO L124 PetriNetUnfolderBase]: 12/547 cut-off events. [2023-08-04 00:02:18,910 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:02:18,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 547 events. 12/547 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2783 event pairs, 0 based on Foata normal form. 0/523 useless extension candidates. Maximal degree in co-relation 440. Up to 27 conditions per place. [2023-08-04 00:02:18,920 INFO L119 LiptonReduction]: Number of co-enabled transitions 2988 [2023-08-04 00:02:20,516 INFO L134 LiptonReduction]: Checked pairs total: 6743 [2023-08-04 00:02:20,516 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-04 00:02:20,518 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:02:20,519 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;@3092bdc8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:02:20,519 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 00:02:20,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:02:20,526 INFO L124 PetriNetUnfolderBase]: 0/62 cut-off events. [2023-08-04 00:02:20,526 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 00:02:20,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:20,527 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 00:02:20,527 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 00:02:20,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:20,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1615950921, now seen corresponding path program 1 times [2023-08-04 00:02:20,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:20,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116912162] [2023-08-04 00:02:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:20,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:20,696 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 00:02:20,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:20,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116912162] [2023-08-04 00:02:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116912162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:02:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:02:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141534902] [2023-08-04 00:02:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:20,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:02:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:02:20,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:02:20,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 191 [2023-08-04 00:02:20,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 00:02:20,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:20,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 191 [2023-08-04 00:02:20,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:22,656 INFO L124 PetriNetUnfolderBase]: 12844/19670 cut-off events. [2023-08-04 00:02:22,657 INFO L125 PetriNetUnfolderBase]: For 1812/1812 co-relation queries the response was YES. [2023-08-04 00:02:22,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39357 conditions, 19670 events. 12844/19670 cut-off events. For 1812/1812 co-relation queries the response was YES. Maximal size of possible extension queue 771. Compared 138053 event pairs, 9918 based on Foata normal form. 0/19217 useless extension candidates. Maximal degree in co-relation 11953. Up to 17234 conditions per place. [2023-08-04 00:02:22,820 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 28 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 00:02:22,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 180 flow [2023-08-04 00:02:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:02:22,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:02:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-04 00:02:22,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6300174520069808 [2023-08-04 00:02:22,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-04 00:02:22,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-04 00:02:22,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:22,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-04 00:02:22,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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 00:02:22,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 00:02:22,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 00:02:22,851 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 112 flow. Second operand 3 states and 361 transitions. [2023-08-04 00:02:22,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 180 flow [2023-08-04 00:02:22,857 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 00:02:22,859 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 118 flow [2023-08-04 00:02:22,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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 00:02:22,864 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 00:02:22,864 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 118 flow [2023-08-04 00:02:22,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states 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 00:02:22,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:22,865 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 00:02:22,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 00:02:22,865 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 00:02:22,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:22,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1435834998, now seen corresponding path program 1 times [2023-08-04 00:02:22,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:22,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048165429] [2023-08-04 00:02:22,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:22,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:22,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:02:22,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:22,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048165429] [2023-08-04 00:02:22,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048165429] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:22,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216485366] [2023-08-04 00:02:22,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:22,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:22,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:22,985 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 00:02:22,995 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 00:02:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:23,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:02:23,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:23,141 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 00:02:23,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:02:23,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216485366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:23,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:02:23,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:02:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790156276] [2023-08-04 00:02:23,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:23,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:02:23,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:02:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:02:23,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 191 [2023-08-04 00:02:23,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 00:02:23,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:23,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 191 [2023-08-04 00:02:23,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:24,938 INFO L124 PetriNetUnfolderBase]: 12832/19625 cut-off events. [2023-08-04 00:02:24,939 INFO L125 PetriNetUnfolderBase]: For 1479/1479 co-relation queries the response was YES. [2023-08-04 00:02:25,017 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 771. Compared 137798 event pairs, 7728 based on Foata normal form. 9/19226 useless extension candidates. Maximal degree in co-relation 13971. Up to 17187 conditions per place. [2023-08-04 00:02:25,101 INFO L140 encePairwiseOnDemand]: 187/191 looper letters, 31 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-04 00:02:25,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 202 flow [2023-08-04 00:02:25,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:02:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:02:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2023-08-04 00:02:25,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6083769633507854 [2023-08-04 00:02:25,107 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions. [2023-08-04 00:02:25,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions. [2023-08-04 00:02:25,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:25,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions. [2023-08-04 00:02:25,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states 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 00:02:25,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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 00:02:25,114 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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 00:02:25,114 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 118 flow. Second operand 5 states and 581 transitions. [2023-08-04 00:02:25,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 202 flow [2023-08-04 00:02:25,116 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 00:02:25,117 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 132 flow [2023-08-04 00:02:25,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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 00:02:25,118 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-08-04 00:02:25,118 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 132 flow [2023-08-04 00:02:25,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 00:02:25,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:25,120 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:02:25,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 00:02:25,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:25,326 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 00:02:25,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:25,327 INFO L85 PathProgramCache]: Analyzing trace with hash 710187106, now seen corresponding path program 1 times [2023-08-04 00:02:25,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:25,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665590522] [2023-08-04 00:02:25,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:25,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:25,403 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 00:02:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665590522] [2023-08-04 00:02:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665590522] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:25,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166503824] [2023-08-04 00:02:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:25,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:25,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:25,410 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 00:02:25,416 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 00:02:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:25,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:02:25,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:25,495 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 00:02:25,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:02:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166503824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:02:25,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:02:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182992377] [2023-08-04 00:02:25,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:25,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:02:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:02:25,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:25,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 191 [2023-08-04 00:02:25,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 132 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 00:02:25,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:25,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 191 [2023-08-04 00:02:25,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:27,036 INFO L124 PetriNetUnfolderBase]: 12242/18740 cut-off events. [2023-08-04 00:02:27,036 INFO L125 PetriNetUnfolderBase]: For 1366/1366 co-relation queries the response was YES. [2023-08-04 00:02:27,086 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 131163 event pairs, 9508 based on Foata normal form. 0/18488 useless extension candidates. Maximal degree in co-relation 11408. Up to 16198 conditions per place. [2023-08-04 00:02:27,166 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 33 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-08-04 00:02:27,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 47 transitions, 220 flow [2023-08-04 00:02:27,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:02:27,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:02:27,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-04 00:02:27,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6369982547993019 [2023-08-04 00:02:27,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-04 00:02:27,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-04 00:02:27,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:27,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-04 00:02:27,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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 00:02:27,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 00:02:27,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 states 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 00:02:27,172 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 132 flow. Second operand 3 states and 365 transitions. [2023-08-04 00:02:27,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 47 transitions, 220 flow [2023-08-04 00:02:27,174 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 00:02:27,175 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 140 flow [2023-08-04 00:02:27,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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 00:02:27,177 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-04 00:02:27,179 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 140 flow [2023-08-04 00:02:27,180 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 00:02:27,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:27,184 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:02:27,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 00:02:27,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 00:02:27,391 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 00:02:27,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash 344596618, now seen corresponding path program 1 times [2023-08-04 00:02:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:27,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563399971] [2023-08-04 00:02:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:27,441 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 00:02:27,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563399971] [2023-08-04 00:02:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563399971] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12110348] [2023-08-04 00:02:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:27,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:27,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:27,445 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 00:02:27,448 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 00:02:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:27,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:02:27,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:27,548 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 00:02:27,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:02:27,569 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 00:02:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12110348] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:02:27,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:02:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:02:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696720460] [2023-08-04 00:02:27,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:02:27,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:02:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:02:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:27,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 191 [2023-08-04 00:02:27,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 140 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 00:02:27,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:27,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 191 [2023-08-04 00:02:27,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:28,677 INFO L124 PetriNetUnfolderBase]: 9694/14591 cut-off events. [2023-08-04 00:02:28,678 INFO L125 PetriNetUnfolderBase]: For 1233/1233 co-relation queries the response was YES. [2023-08-04 00:02:28,743 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 95796 event pairs, 5616 based on Foata normal form. 3/14513 useless extension candidates. Maximal degree in co-relation 10429. Up to 12736 conditions per place. [2023-08-04 00:02:28,807 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 32 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-04 00:02:28,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 46 transitions, 217 flow [2023-08-04 00:02:28,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:02:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:02:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-08-04 00:02:28,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6164921465968587 [2023-08-04 00:02:28,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-08-04 00:02:28,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-08-04 00:02:28,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:28,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-08-04 00:02:28,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 00:02:28,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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 00:02:28,815 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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 00:02:28,815 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 140 flow. Second operand 4 states and 471 transitions. [2023-08-04 00:02:28,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 46 transitions, 217 flow [2023-08-04 00:02:28,817 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 00:02:28,819 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 135 flow [2023-08-04 00:02:28,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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 00:02:28,821 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-04 00:02:28,821 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 135 flow [2023-08-04 00:02:28,823 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 00:02:28,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:28,823 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:02:28,833 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 00:02:29,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:29,031 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 00:02:29,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1927378284, now seen corresponding path program 1 times [2023-08-04 00:02:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299601625] [2023-08-04 00:02:29,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:29,131 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 00:02:29,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:29,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299601625] [2023-08-04 00:02:29,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299601625] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:29,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593502640] [2023-08-04 00:02:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:29,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:29,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:29,138 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 00:02:29,141 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 00:02:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:29,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:02:29,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:29,250 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 00:02:29,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:02:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593502640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:29,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:02:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 00:02:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809498452] [2023-08-04 00:02:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:29,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:02:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:29,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:02:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:02:29,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 191 [2023-08-04 00:02:29,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 39 transitions, 135 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 00:02:29,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:29,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 191 [2023-08-04 00:02:29,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:30,272 INFO L124 PetriNetUnfolderBase]: 9478/14173 cut-off events. [2023-08-04 00:02:30,272 INFO L125 PetriNetUnfolderBase]: For 1006/1006 co-relation queries the response was YES. [2023-08-04 00:02:30,293 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 91991 event pairs, 2182 based on Foata normal form. 81/14254 useless extension candidates. Maximal degree in co-relation 10157. Up to 11907 conditions per place. [2023-08-04 00:02:30,338 INFO L140 encePairwiseOnDemand]: 187/191 looper letters, 44 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-08-04 00:02:30,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 58 transitions, 269 flow [2023-08-04 00:02:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:02:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:02:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-04 00:02:30,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6209424083769634 [2023-08-04 00:02:30,344 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-04 00:02:30,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-04 00:02:30,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:30,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-04 00:02:30,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states 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 00:02:30,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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 00:02:30,349 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 191.0) internal successors, (1146), 6 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states 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 00:02:30,349 INFO L175 Difference]: Start difference. First operand has 60 places, 39 transitions, 135 flow. Second operand 5 states and 593 transitions. [2023-08-04 00:02:30,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 58 transitions, 269 flow [2023-08-04 00:02:30,353 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 00:02:30,354 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 145 flow [2023-08-04 00:02:30,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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 00:02:30,357 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-08-04 00:02:30,358 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 145 flow [2023-08-04 00:02:30,359 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 00:02:30,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:30,359 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 00:02:30,368 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 00:02:30,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:30,565 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 00:02:30,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1509189181, now seen corresponding path program 1 times [2023-08-04 00:02:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635288735] [2023-08-04 00:02:30,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:30,648 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 00:02:30,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635288735] [2023-08-04 00:02:30,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635288735] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:30,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18904217] [2023-08-04 00:02:30,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:30,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:30,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:30,651 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 00:02:30,654 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 00:02:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:30,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:02:30,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:30,771 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 00:02:30,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:02:30,786 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 00:02:30,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18904217] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:02:30,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:02:30,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:02:30,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144850168] [2023-08-04 00:02:30,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:02:30,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:02:30,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:30,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:02:30,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:30,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 191 [2023-08-04 00:02:30,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:02:30,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:30,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 191 [2023-08-04 00:02:30,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:31,571 INFO L124 PetriNetUnfolderBase]: 7588/11203 cut-off events. [2023-08-04 00:02:31,571 INFO L125 PetriNetUnfolderBase]: For 1324/1324 co-relation queries the response was YES. [2023-08-04 00:02:31,591 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 69166 event pairs, 4450 based on Foata normal form. 27/11230 useless extension candidates. Maximal degree in co-relation 8129. Up to 9394 conditions per place. [2023-08-04 00:02:31,628 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 40 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-08-04 00:02:31,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 53 transitions, 255 flow [2023-08-04 00:02:31,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:02:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:02:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-04 00:02:31,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6269633507853403 [2023-08-04 00:02:31,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-04 00:02:31,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-04 00:02:31,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:31,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-04 00:02:31,636 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 00:02:31,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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 00:02:31,642 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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 00:02:31,642 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 145 flow. Second operand 4 states and 479 transitions. [2023-08-04 00:02:31,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 53 transitions, 255 flow [2023-08-04 00:02:31,644 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 00:02:31,645 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 138 flow [2023-08-04 00:02:31,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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 00:02:31,647 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-04 00:02:31,647 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 138 flow [2023-08-04 00:02:31,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:02:31,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:31,647 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 00:02:31,656 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 00:02:31,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:31,853 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 00:02:31,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:31,854 INFO L85 PathProgramCache]: Analyzing trace with hash -424250929, now seen corresponding path program 1 times [2023-08-04 00:02:31,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:31,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093518719] [2023-08-04 00:02:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:31,927 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 00:02:31,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:31,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093518719] [2023-08-04 00:02:31,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093518719] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:31,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569975627] [2023-08-04 00:02:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:31,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:31,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:31,929 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 00:02:31,932 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 00:02:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:32,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:02:32,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:32,040 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 00:02:32,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:02:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [569975627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:32,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:02:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:02:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943662830] [2023-08-04 00:02:32,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:32,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:02:32,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:02:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:32,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 191 [2023-08-04 00:02:32,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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 00:02:32,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:32,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 191 [2023-08-04 00:02:32,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:32,511 INFO L124 PetriNetUnfolderBase]: 4672/7036 cut-off events. [2023-08-04 00:02:32,511 INFO L125 PetriNetUnfolderBase]: For 1198/1198 co-relation queries the response was YES. [2023-08-04 00:02:32,523 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 40997 event pairs, 568 based on Foata normal form. 729/7765 useless extension candidates. Maximal degree in co-relation 7349. Up to 4212 conditions per place. [2023-08-04 00:02:32,527 INFO L140 encePairwiseOnDemand]: 189/191 looper letters, 0 selfloop transitions, 0 changer transitions 55/55 dead transitions. [2023-08-04 00:02:32,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 55 transitions, 262 flow [2023-08-04 00:02:32,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:02:32,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:02:32,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-08-04 00:02:32,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6348167539267016 [2023-08-04 00:02:32,528 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-08-04 00:02:32,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-08-04 00:02:32,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:32,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-08-04 00:02:32,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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 00:02:32,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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 00:02:32,532 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 states 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 00:02:32,532 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 138 flow. Second operand 4 states and 485 transitions. [2023-08-04 00:02:32,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 55 transitions, 262 flow [2023-08-04 00:02:32,548 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 00:02:32,548 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2023-08-04 00:02:32,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, 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 00:02:32,549 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-04 00:02:32,549 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2023-08-04 00:02:32,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states 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 00:02:32,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 00:02:32,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 00:02:32,550 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 00:02:32,555 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 00:02:32,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:32,751 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:02:32,751 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-04 00:02:32,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 288 flow [2023-08-04 00:02:32,859 INFO L124 PetriNetUnfolderBase]: 93/1303 cut-off events. [2023-08-04 00:02:32,859 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:02:32,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1401 conditions, 1303 events. 93/1303 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8914 event pairs, 0 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 944. Up to 54 conditions per place. [2023-08-04 00:02:32,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 288 flow [2023-08-04 00:02:32,870 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 111 transitions, 246 flow [2023-08-04 00:02:32,871 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:02:32,871 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 111 transitions, 246 flow [2023-08-04 00:02:32,871 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 111 transitions, 246 flow [2023-08-04 00:02:32,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 111 transitions, 246 flow [2023-08-04 00:02:32,942 INFO L124 PetriNetUnfolderBase]: 66/966 cut-off events. [2023-08-04 00:02:32,943 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 00:02:32,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 966 events. 66/966 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6026 event pairs, 0 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 716. Up to 54 conditions per place. [2023-08-04 00:02:32,961 INFO L119 LiptonReduction]: Number of co-enabled transitions 3996 [2023-08-04 00:02:34,659 INFO L134 LiptonReduction]: Checked pairs total: 8224 [2023-08-04 00:02:34,659 INFO L136 LiptonReduction]: Total number of compositions: 81 [2023-08-04 00:02:34,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 00:02:34,661 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;@3092bdc8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:02:34,661 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 00:02:34,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:02:34,664 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2023-08-04 00:02:34,664 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:02:34,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:34,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 00:02:34,664 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:02:34,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:34,665 INFO L85 PathProgramCache]: Analyzing trace with hash 19936159, now seen corresponding path program 1 times [2023-08-04 00:02:34,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:34,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503692683] [2023-08-04 00:02:34,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:34,684 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 00:02:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503692683] [2023-08-04 00:02:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503692683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:02:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:02:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552476365] [2023-08-04 00:02:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:34,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:02:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:34,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:02:34,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:02:34,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 207 [2023-08-04 00:02:34,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 00:02:34,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:34,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 207 [2023-08-04 00:02:34,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:37,548 INFO L124 PetriNetUnfolderBase]: 33046/47771 cut-off events. [2023-08-04 00:02:37,548 INFO L125 PetriNetUnfolderBase]: For 1425/1425 co-relation queries the response was YES. [2023-08-04 00:02:37,743 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 1625. Compared 334888 event pairs, 26064 based on Foata normal form. 0/45434 useless extension candidates. Maximal degree in co-relation 26554. Up to 43520 conditions per place. [2023-08-04 00:02:37,915 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 31 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 00:02:37,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 174 flow [2023-08-04 00:02:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:02:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:02:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2023-08-04 00:02:37,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5877616747181964 [2023-08-04 00:02:37,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 365 transitions. [2023-08-04 00:02:37,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 365 transitions. [2023-08-04 00:02:37,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:37,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 365 transitions. [2023-08-04 00:02:37,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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 00:02:37,920 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 00:02:37,920 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 00:02:37,921 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 102 flow. Second operand 3 states and 365 transitions. [2023-08-04 00:02:37,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 174 flow [2023-08-04 00:02:37,921 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 00:02:37,923 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 112 flow [2023-08-04 00:02:37,923 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 00:02:37,925 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-04 00:02:37,925 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 112 flow [2023-08-04 00:02:37,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 00:02:37,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:37,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:02:37,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 00:02:37,926 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:02:37,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:37,926 INFO L85 PathProgramCache]: Analyzing trace with hash -510963461, now seen corresponding path program 1 times [2023-08-04 00:02:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:37,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059152962] [2023-08-04 00:02:37,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:37,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:37,979 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 00:02:37,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:37,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059152962] [2023-08-04 00:02:37,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059152962] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:37,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119973960] [2023-08-04 00:02:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:37,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:37,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:37,986 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 00:02:38,018 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 00:02:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:38,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:02:38,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:38,084 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 00:02:38,084 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:02:38,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119973960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:38,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:02:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:02:38,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256113033] [2023-08-04 00:02:38,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:38,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:02:38,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:38,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:02:38,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:38,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 207 [2023-08-04 00:02:38,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 112 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 00:02:38,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:38,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 207 [2023-08-04 00:02:38,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:40,895 INFO L124 PetriNetUnfolderBase]: 31406/44873 cut-off events. [2023-08-04 00:02:40,896 INFO L125 PetriNetUnfolderBase]: For 1143/1143 co-relation queries the response was YES. [2023-08-04 00:02:41,054 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 1591. Compared 307947 event pairs, 24928 based on Foata normal form. 0/42785 useless extension candidates. Maximal degree in co-relation 87717. Up to 40987 conditions per place. [2023-08-04 00:02:41,173 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 36 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-04 00:02:41,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 204 flow [2023-08-04 00:02:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:02:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:02:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2023-08-04 00:02:41,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2023-08-04 00:02:41,175 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2023-08-04 00:02:41,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2023-08-04 00:02:41,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:41,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2023-08-04 00:02:41,177 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 00:02:41,178 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 00:02:41,178 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 00:02:41,178 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 112 flow. Second operand 3 states and 368 transitions. [2023-08-04 00:02:41,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 204 flow [2023-08-04 00:02:41,179 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 00:02:41,180 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 122 flow [2023-08-04 00:02:41,180 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 00:02:41,180 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-08-04 00:02:41,181 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 122 flow [2023-08-04 00:02:41,181 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 00:02:41,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:41,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:02:41,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-04 00:02:41,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:41,387 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:02:41,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:41,387 INFO L85 PathProgramCache]: Analyzing trace with hash 657530822, now seen corresponding path program 1 times [2023-08-04 00:02:41,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:41,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889097759] [2023-08-04 00:02:41,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:41,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:41,423 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 00:02:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889097759] [2023-08-04 00:02:41,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889097759] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:41,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753640619] [2023-08-04 00:02:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:41,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:41,426 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 00:02:41,429 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 00:02:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:41,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:02:41,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:41,514 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 00:02:41,514 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:02:41,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753640619] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:41,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:02:41,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:02:41,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510145253] [2023-08-04 00:02:41,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:41,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:02:41,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:41,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:02:41,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:41,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 207 [2023-08-04 00:02:41,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 122 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 00:02:41,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:41,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 207 [2023-08-04 00:02:41,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:44,183 INFO L124 PetriNetUnfolderBase]: 30734/43358 cut-off events. [2023-08-04 00:02:44,183 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2023-08-04 00:02:44,349 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 291142 event pairs, 23582 based on Foata normal form. 0/41627 useless extension candidates. Maximal degree in co-relation 24344. Up to 37757 conditions per place. [2023-08-04 00:02:44,486 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 41 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 00:02:44,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 232 flow [2023-08-04 00:02:44,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:02:44,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:02:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-04 00:02:44,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5990338164251208 [2023-08-04 00:02:44,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-04 00:02:44,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-04 00:02:44,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:44,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-04 00:02:44,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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 00:02:44,492 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 00:02:44,492 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 00:02:44,492 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 122 flow. Second operand 3 states and 372 transitions. [2023-08-04 00:02:44,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 232 flow [2023-08-04 00:02:44,494 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 00:02:44,495 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 132 flow [2023-08-04 00:02:44,495 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 00:02:44,496 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-04 00:02:44,496 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 132 flow [2023-08-04 00:02:44,496 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 00:02:44,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:44,496 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 00:02:44,506 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 00:02:44,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 00:02:44,706 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:02:44,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -919629305, now seen corresponding path program 1 times [2023-08-04 00:02:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:44,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592117771] [2023-08-04 00:02:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:44,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:44,752 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 00:02:44,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:44,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592117771] [2023-08-04 00:02:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592117771] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:44,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014328473] [2023-08-04 00:02:44,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:44,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:44,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:44,755 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 00:02:44,758 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 00:02:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:44,841 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:02:44,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:44,855 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 00:02:44,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:02:44,870 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 00:02:44,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014328473] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:02:44,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:02:44,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:02:44,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647024763] [2023-08-04 00:02:44,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:02:44,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:02:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:44,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:02:44,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:44,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 207 [2023-08-04 00:02:44,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 132 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 00:02:44,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:44,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 207 [2023-08-04 00:02:44,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:46,983 INFO L124 PetriNetUnfolderBase]: 24232/33893 cut-off events. [2023-08-04 00:02:46,984 INFO L125 PetriNetUnfolderBase]: For 3624/3624 co-relation queries the response was YES. [2023-08-04 00:02:47,098 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 214533 event pairs, 14820 based on Foata normal form. 3/33869 useless extension candidates. Maximal degree in co-relation 24810. Up to 31258 conditions per place. [2023-08-04 00:02:47,191 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 36 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 00:02:47,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 49 transitions, 228 flow [2023-08-04 00:02:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:02:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:02:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-04 00:02:47,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5736714975845411 [2023-08-04 00:02:47,193 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-04 00:02:47,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-04 00:02:47,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:47,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-04 00:02:47,194 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 00:02:47,196 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 00:02:47,196 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 00:02:47,196 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 132 flow. Second operand 4 states and 475 transitions. [2023-08-04 00:02:47,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 49 transitions, 228 flow [2023-08-04 00:02:47,200 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 00:02:47,204 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 144 flow [2023-08-04 00:02:47,204 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 00:02:47,205 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-08-04 00:02:47,205 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 144 flow [2023-08-04 00:02:47,208 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 00:02:47,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:47,208 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 00:02:47,219 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 00:02:47,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:47,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:02:47,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1747466661, now seen corresponding path program 1 times [2023-08-04 00:02:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124515812] [2023-08-04 00:02:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:47,461 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 00:02:47,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124515812] [2023-08-04 00:02:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124515812] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626762453] [2023-08-04 00:02:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:47,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:47,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:47,464 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 00:02:47,468 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 00:02:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:47,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:02:47,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:47,571 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 00:02:47,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:02:47,586 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 00:02:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626762453] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:02:47,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:02:47,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:02:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703794038] [2023-08-04 00:02:47,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:02:47,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:02:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:47,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:02:47,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:47,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 207 [2023-08-04 00:02:47,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 00:02:47,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:47,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 207 [2023-08-04 00:02:47,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:49,281 INFO L124 PetriNetUnfolderBase]: 19198/26485 cut-off events. [2023-08-04 00:02:49,282 INFO L125 PetriNetUnfolderBase]: For 2439/2439 co-relation queries the response was YES. [2023-08-04 00:02:49,376 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 160531 event pairs, 11902 based on Foata normal form. 27/26512 useless extension candidates. Maximal degree in co-relation 19295. Up to 23785 conditions per place. [2023-08-04 00:02:49,453 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 44 selfloop transitions, 3 changer transitions 1/57 dead transitions. [2023-08-04 00:02:49,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 272 flow [2023-08-04 00:02:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:02:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:02:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 00:02:49,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2023-08-04 00:02:49,455 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 00:02:49,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 00:02:49,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:49,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 00:02:49,456 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 00:02:49,457 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 00:02:49,458 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 00:02:49,458 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 144 flow. Second operand 4 states and 483 transitions. [2023-08-04 00:02:49,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 272 flow [2023-08-04 00:02:49,462 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 00:02:49,464 INFO L231 Difference]: Finished difference. Result has 64 places, 41 transitions, 151 flow [2023-08-04 00:02:49,464 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 00:02:49,465 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-04 00:02:49,465 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 41 transitions, 151 flow [2023-08-04 00:02:49,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.8) internal successors, (564), 5 states have internal predecessors, (564), 0 states have call successors, (0), 0 states 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 00:02:49,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:49,466 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 00:02:49,471 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 00:02:49,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 00:02:49,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:02:49,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:49,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1304609093, now seen corresponding path program 1 times [2023-08-04 00:02:49,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:49,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36851038] [2023-08-04 00:02:49,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:49,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:49,747 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 00:02:49,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:49,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36851038] [2023-08-04 00:02:49,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36851038] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:02:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225283710] [2023-08-04 00:02:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:02:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:02:49,754 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 00:02:49,757 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 00:02:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:49,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:02:49,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:02:49,858 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 00:02:49,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:02:49,873 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 00:02:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225283710] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:02:49,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:02:49,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:02:49,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821327888] [2023-08-04 00:02:49,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:02:49,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:02:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:02:49,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:02:49,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 207 [2023-08-04 00:02:49,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 41 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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 00:02:49,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:49,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 207 [2023-08-04 00:02:49,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:51,658 INFO L124 PetriNetUnfolderBase]: 17362/23209 cut-off events. [2023-08-04 00:02:51,658 INFO L125 PetriNetUnfolderBase]: For 2377/2377 co-relation queries the response was YES. [2023-08-04 00:02:51,726 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 128594 event pairs, 6886 based on Foata normal form. 243/23452 useless extension candidates. Maximal degree in co-relation 17297. Up to 11794 conditions per place. [2023-08-04 00:02:51,789 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 52 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-04 00:02:51,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 311 flow [2023-08-04 00:02:51,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:02:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:02:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-04 00:02:51,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5929951690821256 [2023-08-04 00:02:51,791 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-04 00:02:51,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-04 00:02:51,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:51,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-04 00:02:51,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 00:02:51,794 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 00:02:51,794 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 00:02:51,794 INFO L175 Difference]: Start difference. First operand has 64 places, 41 transitions, 151 flow. Second operand 4 states and 491 transitions. [2023-08-04 00:02:51,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 311 flow [2023-08-04 00:02:51,796 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 00:02:51,797 INFO L231 Difference]: Finished difference. Result has 66 places, 41 transitions, 158 flow [2023-08-04 00:02:51,798 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 00:02:51,798 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-04 00:02:51,798 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 158 flow [2023-08-04 00:02:51,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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 00:02:51,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:51,799 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 00:02:51,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 00:02:52,001 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,SelfDestructingSolverStorable13 [2023-08-04 00:02:52,002 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:02:52,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash 588542855, now seen corresponding path program 1 times [2023-08-04 00:02:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:52,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054243433] [2023-08-04 00:02:52,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:52,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:52,189 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 00:02:52,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:52,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054243433] [2023-08-04 00:02:52,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054243433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:52,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:02:52,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 00:02:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512233822] [2023-08-04 00:02:52,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:52,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:02:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:52,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:02:52,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:02:52,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 207 [2023-08-04 00:02:52,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 41 transitions, 158 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 00:02:52,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:52,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 207 [2023-08-04 00:02:52,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:02:54,585 INFO L124 PetriNetUnfolderBase]: 26698/36611 cut-off events. [2023-08-04 00:02:54,586 INFO L125 PetriNetUnfolderBase]: For 18468/18468 co-relation queries the response was YES. [2023-08-04 00:02:54,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81377 conditions, 36611 events. 26698/36611 cut-off events. For 18468/18468 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 227893 event pairs, 8312 based on Foata normal form. 36/36541 useless extension candidates. Maximal degree in co-relation 60155. Up to 33421 conditions per place. [2023-08-04 00:02:54,853 INFO L140 encePairwiseOnDemand]: 201/207 looper letters, 56 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2023-08-04 00:02:54,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 68 transitions, 404 flow [2023-08-04 00:02:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:02:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:02:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-08-04 00:02:54,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6167471819645732 [2023-08-04 00:02:54,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-08-04 00:02:54,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-08-04 00:02:54,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:02:54,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-08-04 00:02:54,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 00:02:54,858 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 00:02:54,858 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 00:02:54,858 INFO L175 Difference]: Start difference. First operand has 66 places, 41 transitions, 158 flow. Second operand 3 states and 383 transitions. [2023-08-04 00:02:54,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 68 transitions, 404 flow [2023-08-04 00:02:54,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 390 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 00:02:54,867 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 184 flow [2023-08-04 00:02:54,868 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-04 00:02:54,869 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-04 00:02:54,869 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 184 flow [2023-08-04 00:02:54,869 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 00:02:54,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:02:54,869 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 00:02:54,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 00:02:54,870 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:02:54,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:02:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1064957609, now seen corresponding path program 1 times [2023-08-04 00:02:54,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:02:54,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429497245] [2023-08-04 00:02:54,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:02:54,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:02:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:02:55,014 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 00:02:55,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:02:55,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429497245] [2023-08-04 00:02:55,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429497245] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:02:55,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:02:55,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:02:55,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779580516] [2023-08-04 00:02:55,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:02:55,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:02:55,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:02:55,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:02:55,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:02:55,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 207 [2023-08-04 00:02:55,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 00:02:55,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:02:55,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 207 [2023-08-04 00:02:55,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:03:06,224 INFO L124 PetriNetUnfolderBase]: 144917/181862 cut-off events. [2023-08-04 00:03:06,225 INFO L125 PetriNetUnfolderBase]: For 93418/93418 co-relation queries the response was YES. [2023-08-04 00:03:07,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440352 conditions, 181862 events. 144917/181862 cut-off events. For 93418/93418 co-relation queries the response was YES. Maximal size of possible extension queue 5181. Compared 1002775 event pairs, 12860 based on Foata normal form. 3936/185746 useless extension candidates. Maximal degree in co-relation 198706. Up to 88946 conditions per place. [2023-08-04 00:03:07,560 INFO L140 encePairwiseOnDemand]: 193/207 looper letters, 83 selfloop transitions, 21 changer transitions 0/107 dead transitions. [2023-08-04 00:03:07,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 636 flow [2023-08-04 00:03:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:03:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:03:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-08-04 00:03:07,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5785024154589372 [2023-08-04 00:03:07,562 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-08-04 00:03:07,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-08-04 00:03:07,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:03:07,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-08-04 00:03:07,564 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 00:03:07,565 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 00:03:07,565 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 00:03:07,566 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 184 flow. Second operand 4 states and 479 transitions. [2023-08-04 00:03:07,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 636 flow [2023-08-04 00:03:07,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 107 transitions, 623 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:03:07,836 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 355 flow [2023-08-04 00:03:07,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=355, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2023-08-04 00:03:07,837 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-08-04 00:03:07,837 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 355 flow [2023-08-04 00:03:07,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.5) internal successors, (410), 4 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 00:03:07,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:03:07,838 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 00:03:07,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 00:03:07,838 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:03:07,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:03:07,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1559766304, now seen corresponding path program 1 times [2023-08-04 00:03:07,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:03:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715720090] [2023-08-04 00:03:07,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:03:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:03:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:03:07,991 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 00:03:07,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:03:07,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715720090] [2023-08-04 00:03:07,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715720090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:03:07,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:03:07,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:03:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278415808] [2023-08-04 00:03:07,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:03:07,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:03:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:03:07,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:03:07,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:03:08,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 207 [2023-08-04 00:03:08,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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 00:03:08,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:03:08,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 207 [2023-08-04 00:03:08,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:03:23,760 INFO L124 PetriNetUnfolderBase]: 176606/226111 cut-off events. [2023-08-04 00:03:23,760 INFO L125 PetriNetUnfolderBase]: For 251758/254987 co-relation queries the response was YES. [2023-08-04 00:03:25,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708634 conditions, 226111 events. 176606/226111 cut-off events. For 251758/254987 co-relation queries the response was YES. Maximal size of possible extension queue 7498. Compared 1391012 event pairs, 56384 based on Foata normal form. 2130/226609 useless extension candidates. Maximal degree in co-relation 355770. Up to 107361 conditions per place. [2023-08-04 00:03:26,315 INFO L140 encePairwiseOnDemand]: 202/207 looper letters, 81 selfloop transitions, 10 changer transitions 0/102 dead transitions. [2023-08-04 00:03:26,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 102 transitions, 719 flow [2023-08-04 00:03:26,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:03:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:03:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-04 00:03:26,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6215780998389694 [2023-08-04 00:03:26,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-04 00:03:26,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-04 00:03:26,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:03:26,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-04 00:03:26,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states 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 00:03:26,320 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 00:03:26,320 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 00:03:26,320 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 355 flow. Second operand 3 states and 386 transitions. [2023-08-04 00:03:26,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 102 transitions, 719 flow [2023-08-04 00:03:26,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 719 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:03:26,516 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 453 flow [2023-08-04 00:03:26,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2023-08-04 00:03:26,516 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-08-04 00:03:26,516 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 453 flow [2023-08-04 00:03:26,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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 00:03:26,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:03:26,517 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 00:03:26,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 00:03:26,517 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:03:26,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:03:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1180537184, now seen corresponding path program 1 times [2023-08-04 00:03:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:03:26,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716215720] [2023-08-04 00:03:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:03:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:03:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:03:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:03:26,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:03:26,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716215720] [2023-08-04 00:03:26,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716215720] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:03:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083348929] [2023-08-04 00:03:26,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:03:26,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:03:26,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:03:26,683 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 00:03:26,686 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 00:03:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:03:26,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 00:03:26,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:03:26,831 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 00:03:26,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:03:26,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083348929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:03:26,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:03:26,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2023-08-04 00:03:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051470967] [2023-08-04 00:03:26,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:03:26,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:03:26,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:03:26,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:03:26,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:03:26,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 207 [2023-08-04 00:03:26,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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 00:03:26,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:03:26,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 207 [2023-08-04 00:03:26,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:03:40,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L727-->P0EXIT: Formula: (and (= |v_P0Thread2of2ForFork0_#res.base_11| 0) (= |v_P0Thread2of2ForFork0_#res.offset_11| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P0Thread2of2ForFork0_#res.base=|v_P0Thread2of2ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P0Thread2of2ForFork0_#res.offset=|v_P0Thread2of2ForFork0_#res.offset_11|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread2of2ForFork0_#res.offset][20], [608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P2Thread1of2ForFork2InUse, 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), P2Thread2of2ForFork2InUse, 18#P0EXITtrue, P0Thread1of2ForFork0InUse, 88#L781-6true, P0Thread2of2ForFork0InUse, 619#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L757true, 106#P0EXITtrue, Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 448#true, Black: 602#(<= ~x~0 0), 23#L757true, Black: 605#true, Black: 607#(= ~y~0 0), Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 116#P1EXITtrue, 112#P1EXITtrue, 613#true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:03:40,778 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 00:03:40,778 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:03:40,779 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:03:40,779 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:03:42,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L727-->P0EXIT: Formula: (and (= |v_P0Thread2of2ForFork0_#res.base_11| 0) (= |v_P0Thread2of2ForFork0_#res.offset_11| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P0Thread2of2ForFork0_#res.base=|v_P0Thread2of2ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P0Thread2of2ForFork0_#res.offset=|v_P0Thread2of2ForFork0_#res.offset_11|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread2of2ForFork0_#res.offset][20], [608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, 18#P0EXITtrue, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 619#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L757true, 106#P0EXITtrue, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 602#(<= ~x~0 0), 23#L757true, Black: 605#true, Black: 607#(= ~y~0 0), 59#L781-11true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 116#P1EXITtrue, 112#P1EXITtrue, 613#true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:03:42,000 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 00:03:42,000 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:03:42,000 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:03:42,000 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:03:42,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L727-->P0EXIT: Formula: (and (= |v_P0Thread2of2ForFork0_#res.base_11| 0) (= |v_P0Thread2of2ForFork0_#res.offset_11| 0) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P0Thread2of2ForFork0_#res.base=|v_P0Thread2of2ForFork0_#res.base_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P0Thread2of2ForFork0_#res.offset=|v_P0Thread2of2ForFork0_#res.offset_11|} AuxVars[] AssignedVars[P0Thread2of2ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread2of2ForFork0_#res.offset][20], [P2Thread1of2ForFork2InUse, 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 18#P0EXITtrue, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 619#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 94#L757true, 106#P0EXITtrue, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 602#(<= ~x~0 0), 23#L757true, Black: 605#true, Black: 607#(= ~y~0 0), Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), 116#P1EXITtrue, 25#L786true, 112#P1EXITtrue, 613#true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:03:42,136 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-04 00:03:42,136 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 00:03:42,136 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 00:03:42,136 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-04 00:03:42,198 INFO L124 PetriNetUnfolderBase]: 150549/199205 cut-off events. [2023-08-04 00:03:42,198 INFO L125 PetriNetUnfolderBase]: For 265201/270270 co-relation queries the response was YES. [2023-08-04 00:03:43,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652867 conditions, 199205 events. 150549/199205 cut-off events. For 265201/270270 co-relation queries the response was YES. Maximal size of possible extension queue 7853. Compared 1359401 event pairs, 46635 based on Foata normal form. 275/189597 useless extension candidates. Maximal degree in co-relation 652775. Up to 149544 conditions per place. [2023-08-04 00:03:44,451 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 74 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2023-08-04 00:03:44,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 110 transitions, 812 flow [2023-08-04 00:03:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:03:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:03:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-04 00:03:44,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2023-08-04 00:03:44,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-04 00:03:44,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-04 00:03:44,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:03:44,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-04 00:03:44,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states 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 00:03:44,455 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 00:03:44,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 00:03:44,455 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 453 flow. Second operand 3 states and 387 transitions. [2023-08-04 00:03:44,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 110 transitions, 812 flow [2023-08-04 00:03:45,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 110 transitions, 792 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 00:03:45,339 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 478 flow [2023-08-04 00:03:45,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2023-08-04 00:03:45,340 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-08-04 00:03:45,340 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 478 flow [2023-08-04 00:03:45,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states 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 00:03:45,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:03:45,340 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] [2023-08-04 00:03:45,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-04 00:03:45,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 00:03:45,541 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:03:45,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:03:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1642111620, now seen corresponding path program 1 times [2023-08-04 00:03:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:03:45,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912021044] [2023-08-04 00:03:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:03:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:03:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:03:45,669 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 00:03:45,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:03:45,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912021044] [2023-08-04 00:03:45,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912021044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:03:45,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:03:45,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 00:03:45,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203576230] [2023-08-04 00:03:45,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:03:45,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:03:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:03:45,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:03:45,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:03:45,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 207 [2023-08-04 00:03:45,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 478 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 00:03:45,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:03:45,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 207 [2023-08-04 00:03:45,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:04:15,917 INFO L124 PetriNetUnfolderBase]: 301103/379536 cut-off events. [2023-08-04 00:04:15,917 INFO L125 PetriNetUnfolderBase]: For 635206/635206 co-relation queries the response was YES. [2023-08-04 00:04:18,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1332325 conditions, 379536 events. 301103/379536 cut-off events. For 635206/635206 co-relation queries the response was YES. Maximal size of possible extension queue 12640. Compared 2326617 event pairs, 38387 based on Foata normal form. 2844/382328 useless extension candidates. Maximal degree in co-relation 953044. Up to 178407 conditions per place. [2023-08-04 00:04:19,427 INFO L140 encePairwiseOnDemand]: 193/207 looper letters, 128 selfloop transitions, 31 changer transitions 4/166 dead transitions. [2023-08-04 00:04:19,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 166 transitions, 1306 flow [2023-08-04 00:04:19,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:04:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:04:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2023-08-04 00:04:19,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5729468599033817 [2023-08-04 00:04:19,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2023-08-04 00:04:19,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2023-08-04 00:04:19,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:04:19,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2023-08-04 00:04:19,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states 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 00:04:19,433 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 00:04:19,433 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 00:04:19,433 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 478 flow. Second operand 5 states and 593 transitions. [2023-08-04 00:04:19,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 166 transitions, 1306 flow [2023-08-04 00:04:19,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 166 transitions, 1295 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:04:19,557 INFO L231 Difference]: Finished difference. Result has 82 places, 97 transitions, 778 flow [2023-08-04 00:04:19,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=778, PETRI_PLACES=82, PETRI_TRANSITIONS=97} [2023-08-04 00:04:19,558 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 31 predicate places. [2023-08-04 00:04:19,558 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 97 transitions, 778 flow [2023-08-04 00:04:19,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states 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 00:04:19,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:04:19,558 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] [2023-08-04 00:04:19,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 00:04:19,559 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:04:19,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:04:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1989327379, now seen corresponding path program 1 times [2023-08-04 00:04:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:04:19,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547595196] [2023-08-04 00:04:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:04:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:04:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:04:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:04:19,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:04:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547595196] [2023-08-04 00:04:19,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547595196] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:04:19,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102045806] [2023-08-04 00:04:19,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:04:19,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:04:19,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:04:19,686 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:04:19,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 00:04:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:04:19,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-04 00:04:19,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:04:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:04:19,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:04:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 00:04:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102045806] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:04:19,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:04:19,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 7 [2023-08-04 00:04:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145678823] [2023-08-04 00:04:19,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:04:19,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-04 00:04:19,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:04:19,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-04 00:04:19,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-04 00:04:20,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 207 [2023-08-04 00:04:20,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 97 transitions, 778 flow. Second operand has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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 00:04:20,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:04:20,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 207 [2023-08-04 00:04:20,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:05:41,838 INFO L124 PetriNetUnfolderBase]: 670229/848642 cut-off events. [2023-08-04 00:05:41,839 INFO L125 PetriNetUnfolderBase]: For 2043197/2043197 co-relation queries the response was YES. [2023-08-04 00:05:47,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3294486 conditions, 848642 events. 670229/848642 cut-off events. For 2043197/2043197 co-relation queries the response was YES. Maximal size of possible extension queue 31143. Compared 5769654 event pairs, 48398 based on Foata normal form. 4728/853318 useless extension candidates. Maximal degree in co-relation 1241073. Up to 183100 conditions per place. [2023-08-04 00:05:50,231 INFO L140 encePairwiseOnDemand]: 193/207 looper letters, 268 selfloop transitions, 89 changer transitions 18/378 dead transitions. [2023-08-04 00:05:50,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 378 transitions, 3619 flow [2023-08-04 00:05:50,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-04 00:05:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-04 00:05:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1079 transitions. [2023-08-04 00:05:50,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5791733762748256 [2023-08-04 00:05:50,235 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1079 transitions. [2023-08-04 00:05:50,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1079 transitions. [2023-08-04 00:05:50,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:05:50,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1079 transitions. [2023-08-04 00:05:50,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 119.88888888888889) internal successors, (1079), 9 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states 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 00:05:50,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states 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 00:05:50,240 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 207.0) internal successors, (2070), 10 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states 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 00:05:50,240 INFO L175 Difference]: Start difference. First operand has 82 places, 97 transitions, 778 flow. Second operand 9 states and 1079 transitions. [2023-08-04 00:05:50,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 378 transitions, 3619 flow [2023-08-04 00:09:22,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 378 transitions, 3614 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:09:22,292 INFO L231 Difference]: Finished difference. Result has 93 places, 161 transitions, 1740 flow [2023-08-04 00:09:22,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1740, PETRI_PLACES=93, PETRI_TRANSITIONS=161} [2023-08-04 00:09:22,292 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2023-08-04 00:09:22,292 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 161 transitions, 1740 flow [2023-08-04 00:09:22,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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 00:09:22,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:09:22,293 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] [2023-08-04 00:09:22,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 00:09:22,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2023-08-04 00:09:22,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:09:22,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:09:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash -7945153, now seen corresponding path program 2 times [2023-08-04 00:09:22,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:09:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585228055] [2023-08-04 00:09:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:09:22,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:09:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:09:22,638 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 00:09:22,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:09:22,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585228055] [2023-08-04 00:09:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585228055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:09:22,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:09:22,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:09:22,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407909976] [2023-08-04 00:09:22,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:09:22,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:09:22,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:09:22,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:09:22,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:09:22,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 207 [2023-08-04 00:09:22,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 161 transitions, 1740 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 00:09:22,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:09:22,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 207 [2023-08-04 00:09:22,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:09:49,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, 18#P0EXITtrue, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, 722#(= ~__unbuffered_p2_EAX~0 0), P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 733#(= ~__unbuffered_p0_EAX~0 0), Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 96#L742true, Black: 719#true, Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 9#L739true, Black: 607#(= ~y~0 0), 37#$Ultimate##0true, 80#P2EXITtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 730#true, 25#L786true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P1Thread2of2ForFork1InUse]) [2023-08-04 00:09:49,146 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 00:09:49,146 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 00:09:49,146 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 00:09:49,146 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 00:09:50,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 722#(= ~__unbuffered_p2_EAX~0 0), 79#$Ultimate##0true, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 733#(= ~__unbuffered_p0_EAX~0 0), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 106#P0EXITtrue, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 719#true, 96#L742true, Black: 602#(<= ~x~0 0), 605#true, 23#L757true, 9#L739true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 730#true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:50,570 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-04 00:09:50,570 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 00:09:50,570 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 00:09:50,570 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-04 00:09:56,591 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 106#P0EXITtrue, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P1Thread2of2ForFork1InUse]) [2023-08-04 00:09:56,592 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,592 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,592 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,592 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 106#P0EXITtrue, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:56,592 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,592 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,592 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,592 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:56,617 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,617 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,617 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,617 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,630 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, 112#P1EXITtrue, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:56,630 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,630 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,630 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,630 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 87#P2EXITtrue, Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 730#true, Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P1Thread2of2ForFork1InUse]) [2023-08-04 00:09:56,636 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,636 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,636 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,636 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,636 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, 87#P2EXITtrue, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 730#true, Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:56,636 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,636 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,637 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:56,637 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-04 00:09:57,954 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 615#(= ~y~0 1), 100#L727true, Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:57,955 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2023-08-04 00:09:57,955 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 00:09:57,955 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 00:09:57,955 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 00:09:57,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 112#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:57,961 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is not cut-off event [2023-08-04 00:09:57,961 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 00:09:57,961 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 00:09:57,961 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is not cut-off event [2023-08-04 00:09:58,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 106#P0EXITtrue, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 730#true, Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:58,758 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,758 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,758 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,758 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,775 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 87#P2EXITtrue, Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 106#P0EXITtrue, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1), P1Thread2of2ForFork1InUse]) [2023-08-04 00:09:58,776 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,776 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,777 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,777 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, 87#P2EXITtrue, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 106#P0EXITtrue, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 730#true, Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 25#L786true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:58,777 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,777 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,777 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,777 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, 25#L786true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 112#P1EXITtrue, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:58,787 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,787 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,787 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,787 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,797 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 87#P2EXITtrue, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, 25#L786true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:58,797 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,797 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,797 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,797 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 87#P2EXITtrue, Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, 112#P1EXITtrue, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:58,804 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,804 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,804 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:58,804 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-04 00:09:59,363 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 106#P0EXITtrue, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:59,363 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,364 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,364 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,364 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, 23#L757true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, 112#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:59,379 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,379 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,379 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,379 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 87#P2EXITtrue, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 615#(= ~y~0 1), 100#L727true, Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:59,380 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,380 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,380 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,381 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 118#L742true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 87#P2EXITtrue, Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 615#(= ~y~0 1), 100#L727true, Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 112#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:59,384 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,384 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,384 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,385 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is not cut-off event [2023-08-04 00:09:59,597 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 87#P2EXITtrue, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 106#P0EXITtrue, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:59,597 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 00:09:59,597 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:09:59,598 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:09:59,598 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:09:59,604 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([589] L757-->P2EXIT: Formula: (and (= |v_P2Thread2of2ForFork2_#res.offset_12| 0) (= |v_P2Thread2of2ForFork2_#res.base_12| 0) (= (+ v_~__unbuffered_cnt~0_76 1) v_~__unbuffered_cnt~0_75)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76} OutVars{P2Thread2of2ForFork2_#res.base=|v_P2Thread2of2ForFork2_#res.base_12|, P2Thread2of2ForFork2_#res.offset=|v_P2Thread2of2ForFork2_#res.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} AuxVars[] AssignedVars[P2Thread2of2ForFork2_#res.base, P2Thread2of2ForFork2_#res.offset, ~__unbuffered_cnt~0][209], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 87#P2EXITtrue, Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 80#P2EXITtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), 25#L786true, 112#P1EXITtrue, Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:59,604 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-04 00:09:59,604 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:09:59,604 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:09:59,604 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-04 00:09:59,854 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, 87#P2EXITtrue, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 106#P0EXITtrue, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 96#L742true, Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:59,854 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-04 00:09:59,855 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-04 00:09:59,855 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-04 00:09:59,855 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-04 00:09:59,859 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([613] L786-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15| 0) (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~__unbuffered_p2_EAX~0_38 1) (= 2 v_~__unbuffered_p0_EAX~0_38) (= v_~x~0_39 2) (= v_~y~0_51 2))) 1 0) 0) 0 1)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_13|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_38, ~y~0=v_~y~0_51, ~x~0=v_~x~0_39} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][242], [P2Thread1of2ForFork2InUse, P2Thread2of2ForFork2InUse, P0Thread1of2ForFork0InUse, P0Thread2of2ForFork0InUse, 948#true, Black: 139#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 87#P2EXITtrue, Black: 626#(<= ~__unbuffered_p0_EAX~0 0), 94#L757true, 730#true, Black: 451#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 723#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 210#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 722#(= ~__unbuffered_p2_EAX~0 0), Black: 602#(<= ~x~0 0), 605#true, Black: 608#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), Black: 607#(= ~y~0 0), 110#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, 100#L727true, Black: 615#(= ~y~0 1), Black: 164#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 734#(or (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p0_EAX~0 2))), 719#true, 116#P1EXITtrue, 112#P1EXITtrue, Black: 839#(not (= ~__unbuffered_p0_EAX~0 2)), Black: 733#(= ~__unbuffered_p0_EAX~0 0), 35#L724true, P1Thread1of2ForFork1InUse, Black: 323#(<= |ULTIMATE.start_main_~asdf~1#1| 1), P1Thread2of2ForFork1InUse, Black: 219#(<= |ULTIMATE.start_main_~asdf~0#1| 1)]) [2023-08-04 00:09:59,859 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is not cut-off event [2023-08-04 00:09:59,859 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-04 00:09:59,859 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-04 00:09:59,859 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is not cut-off event [2023-08-04 00:10:00,558 INFO L124 PetriNetUnfolderBase]: 254742/342678 cut-off events. [2023-08-04 00:10:00,558 INFO L125 PetriNetUnfolderBase]: For 1821618/1889718 co-relation queries the response was YES. [2023-08-04 00:10:03,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375214 conditions, 342678 events. 254742/342678 cut-off events. For 1821618/1889718 co-relation queries the response was YES. Maximal size of possible extension queue 19210. Compared 2679624 event pairs, 51161 based on Foata normal form. 15483/339393 useless extension candidates. Maximal degree in co-relation 1038695. Up to 303253 conditions per place. [2023-08-04 00:10:05,131 INFO L140 encePairwiseOnDemand]: 199/207 looper letters, 159 selfloop transitions, 7 changer transitions 4/243 dead transitions. [2023-08-04 00:10:05,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 243 transitions, 2911 flow [2023-08-04 00:10:05,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:10:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:10:05,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-04 00:10:05,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.605475040257649 [2023-08-04 00:10:05,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-04 00:10:05,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-04 00:10:05,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:10:05,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-04 00:10:05,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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 00:10:05,139 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 00:10:05,139 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 00:10:05,139 INFO L175 Difference]: Start difference. First operand has 93 places, 161 transitions, 1740 flow. Second operand 3 states and 376 transitions. [2023-08-04 00:10:05,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 243 transitions, 2911 flow [2023-08-04 00:10:52,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 243 transitions, 2842 flow, removed 32 selfloop flow, removed 1 redundant places. [2023-08-04 00:10:52,674 INFO L231 Difference]: Finished difference. Result has 95 places, 167 transitions, 1746 flow [2023-08-04 00:10:52,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=1699, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1746, PETRI_PLACES=95, PETRI_TRANSITIONS=167} [2023-08-04 00:10:52,674 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places. [2023-08-04 00:10:52,675 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 167 transitions, 1746 flow [2023-08-04 00:10:52,675 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 00:10:52,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:10:52,675 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 00:10:52,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-04 00:10:52,675 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:10:52,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:10:52,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1976161129, now seen corresponding path program 1 times [2023-08-04 00:10:52,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:10:52,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460740384] [2023-08-04 00:10:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:10:52,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:10:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:10:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 00:10:52,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:10:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460740384] [2023-08-04 00:10:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460740384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:10:52,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:10:52,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 00:10:52,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714043555] [2023-08-04 00:10:52,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:10:52,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:10:52,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:10:52,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:10:52,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:10:52,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 207 [2023-08-04 00:10:52,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 167 transitions, 1746 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states 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 00:10:52,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:10:52,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 207 [2023-08-04 00:10:52,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:12:07,947 INFO L124 PetriNetUnfolderBase]: 524947/678780 cut-off events. [2023-08-04 00:12:07,948 INFO L125 PetriNetUnfolderBase]: For 3054460/3054460 co-relation queries the response was YES. [2023-08-04 00:12:12,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3197636 conditions, 678780 events. 524947/678780 cut-off events. For 3054460/3054460 co-relation queries the response was YES. Maximal size of possible extension queue 25756. Compared 4794668 event pairs, 86389 based on Foata normal form. 1115/679798 useless extension candidates. Maximal degree in co-relation 3197504. Up to 341707 conditions per place. [2023-08-04 00:12:14,097 INFO L140 encePairwiseOnDemand]: 193/207 looper letters, 211 selfloop transitions, 109 changer transitions 6/329 dead transitions. [2023-08-04 00:12:14,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 329 transitions, 3862 flow [2023-08-04 00:12:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:12:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:12:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-04 00:12:14,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942028985507246 [2023-08-04 00:12:14,101 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-04 00:12:14,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-04 00:12:14,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:12:14,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-04 00:12:14,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 00:12:14,104 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 00:12:14,104 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 00:12:14,104 INFO L175 Difference]: Start difference. First operand has 95 places, 167 transitions, 1746 flow. Second operand 4 states and 492 transitions. [2023-08-04 00:12:14,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 329 transitions, 3862 flow Received shutdown request... [2023-08-04 00:14:01,978 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 00:14:02,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Cannot interrupt operation gracefully because timeout expired. Forcing shutdown