/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_power.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 18:13:13,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 18:13:13,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 18:13:13,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 18:13:13,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 18:13:13,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 18:13:13,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 18:13:13,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 18:13:13,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 18:13:13,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 18:13:13,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 18:13:13,156 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 18:13:13,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 18:13:13,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 18:13:13,156 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 18:13:13,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 18:13:13,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 18:13:13,157 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 18:13:13,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 18:13:13,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 18:13:13,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 18:13:13,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 18:13:13,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 18:13:13,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 18:13:13,160 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 18:13:13,160 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 18:13:13,160 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 18:13:13,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 18:13:13,161 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 18:13:13,161 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 18:13:13,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:13:13,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 18:13:13,162 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 18:13:13,162 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 18:13:13,162 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 18:13:13,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 18:13:13,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 18:13:13,162 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 18:13:13,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 18:13:13,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 18:13:13,163 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 18:13:13,163 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 18:13:13,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 18:13:13,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 18:13:13,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 18:13:13,313 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 18:13:13,313 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 18:13:13,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_power.oepc_bound2.i [2023-08-03 18:13:14,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 18:13:14,484 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 18:13:14,485 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_power.oepc_bound2.i [2023-08-03 18:13:14,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247a530f9/b0c5bb70183d48e8bef21505ac9378e1/FLAG47b107499 [2023-08-03 18:13:14,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247a530f9/b0c5bb70183d48e8bef21505ac9378e1 [2023-08-03 18:13:14,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 18:13:14,517 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 18:13:14,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 18:13:14,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 18:13:14,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 18:13:14,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29693943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14, skipping insertion in model container [2023-08-03 18:13:14,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 18:13:14,664 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_safe012_power.oepc_bound2.i[995,1008] [2023-08-03 18:13:14,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:13:14,798 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 18:13:14,805 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_safe012_power.oepc_bound2.i[995,1008] [2023-08-03 18:13:14,810 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 18:13:14,811 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 18:13:14,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:13:14,859 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:13:14,859 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:13:14,863 INFO L206 MainTranslator]: Completed translation [2023-08-03 18:13:14,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14 WrapperNode [2023-08-03 18:13:14,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 18:13:14,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 18:13:14,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 18:13:14,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 18:13:14,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,915 INFO L138 Inliner]: procedures = 176, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 162 [2023-08-03 18:13:14,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 18:13:14,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 18:13:14,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 18:13:14,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 18:13:14,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 18:13:14,948 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 18:13:14,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 18:13:14,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 18:13:14,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (1/1) ... [2023-08-03 18:13:14,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:13:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:13:14,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 18:13:14,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 18:13:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-03 18:13:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 18:13:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 18:13:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 18:13:15,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 18:13:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 18:13:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 18:13:15,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 18:13:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 18:13:15,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 18:13:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 18:13:15,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 18:13:15,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 18:13:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 18:13:15,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 18:13:15,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 18:13:15,013 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 18:13:15,115 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 18:13:15,117 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 18:13:15,371 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 18:13:15,500 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 18:13:15,500 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 18:13:15,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:13:15 BoogieIcfgContainer [2023-08-03 18:13:15,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 18:13:15,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 18:13:15,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 18:13:15,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 18:13:15,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 06:13:14" (1/3) ... [2023-08-03 18:13:15,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a02e4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:13:15, skipping insertion in model container [2023-08-03 18:13:15,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:13:14" (2/3) ... [2023-08-03 18:13:15,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a02e4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:13:15, skipping insertion in model container [2023-08-03 18:13:15,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:13:15" (3/3) ... [2023-08-03 18:13:15,508 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe012_power.oepc_bound2.i [2023-08-03 18:13:15,513 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 18:13:15,518 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 18:13:15,519 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-03 18:13:15,519 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 18:13:15,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:13:15,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 307 flow [2023-08-03 18:13:15,696 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-03 18:13:15,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:13:15,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 464 events. 30/464 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1957 event pairs, 0 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 285. Up to 16 conditions per place. [2023-08-03 18:13:15,701 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 146 transitions, 307 flow [2023-08-03 18:13:15,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 134 transitions, 283 flow [2023-08-03 18:13:15,707 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:13:15,712 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 134 transitions, 283 flow [2023-08-03 18:13:15,714 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 134 transitions, 283 flow [2023-08-03 18:13:15,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 134 transitions, 283 flow [2023-08-03 18:13:15,753 INFO L124 PetriNetUnfolderBase]: 22/368 cut-off events. [2023-08-03 18:13:15,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:13:15,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 368 events. 22/368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1411 event pairs, 0 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 237. Up to 16 conditions per place. [2023-08-03 18:13:15,757 INFO L119 LiptonReduction]: Number of co-enabled transitions 1806 [2023-08-03 18:13:21,396 INFO L134 LiptonReduction]: Checked pairs total: 4444 [2023-08-03 18:13:21,397 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-08-03 18:13:21,406 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:13:21,410 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;@2ccd32e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:13:21,410 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 18:13:21,413 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:13:21,414 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2023-08-03 18:13:21,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:13:21,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:13:21,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 18:13:21,414 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:13:21,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:13:21,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1453337198, now seen corresponding path program 1 times [2023-08-03 18:13:21,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:13:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529420219] [2023-08-03 18:13:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:13:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:13:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:13:21,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:13:21,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529420219] [2023-08-03 18:13:21,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529420219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:13:21,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:13:21,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:13:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298514399] [2023-08-03 18:13:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:13:21,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:13:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:13:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:13:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:13:21,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 257 [2023-08-03 18:13:21,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:21,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:13:21,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 257 [2023-08-03 18:13:21,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:13:21,831 INFO L124 PetriNetUnfolderBase]: 624/1094 cut-off events. [2023-08-03 18:13:21,831 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-03 18:13:21,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2188 conditions, 1094 events. 624/1094 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5847 event pairs, 494 based on Foata normal form. 0/998 useless extension candidates. Maximal degree in co-relation 2171. Up to 1012 conditions per place. [2023-08-03 18:13:21,837 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 23 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-03 18:13:21,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 127 flow [2023-08-03 18:13:21,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:13:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:13:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-03 18:13:21,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356679636835279 [2023-08-03 18:13:21,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-03 18:13:21,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-03 18:13:21,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:13:21,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-03 18:13:21,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:21,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:21,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:21,860 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 71 flow. Second operand 3 states and 413 transitions. [2023-08-03 18:13:21,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 127 flow [2023-08-03 18:13:21,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 31 transitions, 127 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 18:13:21,863 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 79 flow [2023-08-03 18:13:21,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-03 18:13:21,866 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-08-03 18:13:21,866 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 79 flow [2023-08-03 18:13:21,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:21,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:13:21,866 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 18:13:21,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 18:13:21,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:13:21,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:13:21,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1446150951, now seen corresponding path program 1 times [2023-08-03 18:13:21,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:13:21,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081005702] [2023-08-03 18:13:21,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:13:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:13:21,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:13:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:13:21,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:13:21,929 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:13:21,930 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2023-08-03 18:13:21,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-03 18:13:21,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-03 18:13:21,931 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-03 18:13:21,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 18:13:21,932 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 18:13:21,939 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 18:13:21,939 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 18:13:21,980 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:13:21,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 168 transitions, 372 flow [2023-08-03 18:13:22,091 INFO L124 PetriNetUnfolderBase]: 93/1387 cut-off events. [2023-08-03 18:13:22,092 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 18:13:22,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1485 conditions, 1387 events. 93/1387 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9388 event pairs, 0 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 1010. Up to 54 conditions per place. [2023-08-03 18:13:22,095 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 168 transitions, 372 flow [2023-08-03 18:13:22,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 156 transitions, 348 flow [2023-08-03 18:13:22,097 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:13:22,097 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 156 transitions, 348 flow [2023-08-03 18:13:22,097 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 165 places, 156 transitions, 348 flow [2023-08-03 18:13:22,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 156 transitions, 348 flow [2023-08-03 18:13:22,167 INFO L124 PetriNetUnfolderBase]: 66/1063 cut-off events. [2023-08-03 18:13:22,167 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 18:13:22,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 1063 events. 66/1063 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6582 event pairs, 0 based on Foata normal form. 0/958 useless extension candidates. Maximal degree in co-relation 794. Up to 54 conditions per place. [2023-08-03 18:13:22,180 INFO L119 LiptonReduction]: Number of co-enabled transitions 4444 [2023-08-03 18:13:29,211 INFO L134 LiptonReduction]: Checked pairs total: 12999 [2023-08-03 18:13:29,211 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-03 18:13:29,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:13:29,213 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;@2ccd32e6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:13:29,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-03 18:13:29,216 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:13:29,216 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-08-03 18:13:29,216 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:13:29,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:13:29,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 18:13:29,216 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:13:29,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:13:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1950230608, now seen corresponding path program 1 times [2023-08-03 18:13:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:13:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040229966] [2023-08-03 18:13:29,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:13:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:13:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:13:29,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:13:29,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040229966] [2023-08-03 18:13:29,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040229966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:13:29,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:13:29,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:13:29,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916768079] [2023-08-03 18:13:29,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:13:29,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:13:29,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:13:29,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:13:29,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:13:29,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 285 [2023-08-03 18:13:29,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:29,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:13:29,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 285 [2023-08-03 18:13:29,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:13:41,222 INFO L124 PetriNetUnfolderBase]: 67656/94648 cut-off events. [2023-08-03 18:13:41,222 INFO L125 PetriNetUnfolderBase]: For 2232/2232 co-relation queries the response was YES. [2023-08-03 18:13:41,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185215 conditions, 94648 events. 67656/94648 cut-off events. For 2232/2232 co-relation queries the response was YES. Maximal size of possible extension queue 2893. Compared 665072 event pairs, 54330 based on Foata normal form. 0/90150 useless extension candidates. Maximal degree in co-relation 52848. Up to 87646 conditions per place. [2023-08-03 18:13:41,771 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 34 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-03 18:13:41,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 48 transitions, 204 flow [2023-08-03 18:13:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:13:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:13:41,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-08-03 18:13:41,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-08-03 18:13:41,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-08-03 18:13:41,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-08-03 18:13:41,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:13:41,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-08-03 18:13:41,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 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-03 18:13:41,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:41,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:41,781 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 124 flow. Second operand 3 states and 475 transitions. [2023-08-03 18:13:41,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 48 transitions, 204 flow [2023-08-03 18:13:41,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 48 transitions, 198 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 18:13:41,787 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 130 flow [2023-08-03 18:13:41,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-03 18:13:41,787 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2023-08-03 18:13:41,787 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 130 flow [2023-08-03 18:13:41,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:41,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:13:41,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:13:41,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 18:13:41,788 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:13:41,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:13:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash -9791027, now seen corresponding path program 1 times [2023-08-03 18:13:41,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:13:41,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958276827] [2023-08-03 18:13:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:41,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:13:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:13:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:13:41,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:13:41,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958276827] [2023-08-03 18:13:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958276827] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:13:41,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362035553] [2023-08-03 18:13:41,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:41,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:13:41,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:13:41,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:13:41,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 18:13:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:13:41,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 18:13:41,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:13:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-03 18:13:41,989 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:13:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362035553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:13:41,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:13:41,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 18:13:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321511019] [2023-08-03 18:13:41,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:13:41,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:13:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:13:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:13:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:13:41,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 285 [2023-08-03 18:13:41,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:41,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:13:41,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 285 [2023-08-03 18:13:41,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:13:53,290 INFO L124 PetriNetUnfolderBase]: 64142/88304 cut-off events. [2023-08-03 18:13:53,290 INFO L125 PetriNetUnfolderBase]: For 1719/1719 co-relation queries the response was YES. [2023-08-03 18:13:53,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173608 conditions, 88304 events. 64142/88304 cut-off events. For 1719/1719 co-relation queries the response was YES. Maximal size of possible extension queue 2830. Compared 602332 event pairs, 51808 based on Foata normal form. 0/84703 useless extension candidates. Maximal degree in co-relation 173571. Up to 82507 conditions per place. [2023-08-03 18:13:53,740 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 39 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-03 18:13:53,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 228 flow [2023-08-03 18:13:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:13:53,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:13:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2023-08-03 18:13:53,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.560233918128655 [2023-08-03 18:13:53,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 479 transitions. [2023-08-03 18:13:53,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 479 transitions. [2023-08-03 18:13:53,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:13:53,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 479 transitions. [2023-08-03 18:13:53,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 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-03 18:13:53,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:53,744 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:53,745 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 130 flow. Second operand 3 states and 479 transitions. [2023-08-03 18:13:53,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 228 flow [2023-08-03 18:13:53,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:13:53,746 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 140 flow [2023-08-03 18:13:53,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-08-03 18:13:53,747 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 5 predicate places. [2023-08-03 18:13:53,747 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 140 flow [2023-08-03 18:13:53,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:53,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:13:53,747 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 18:13:53,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 18:13:53,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:13:53,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:13:53,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:13:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash -714833590, now seen corresponding path program 1 times [2023-08-03 18:13:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:13:53,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615570947] [2023-08-03 18:13:53,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:13:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:13:54,008 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-03 18:13:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:13:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615570947] [2023-08-03 18:13:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615570947] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:13:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280504038] [2023-08-03 18:13:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:13:54,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:13:54,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:13:54,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:13:54,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 18:13:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:13:54,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 18:13:54,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:13:54,146 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-03 18:13:54,147 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:13:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280504038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:13:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:13:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 18:13:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250328437] [2023-08-03 18:13:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:13:54,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:13:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:13:54,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:13:54,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 18:13:54,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-03 18:13:54,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:13:54,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:13:54,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-03 18:13:54,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:05,199 INFO L124 PetriNetUnfolderBase]: 64130/88143 cut-off events. [2023-08-03 18:14:05,200 INFO L125 PetriNetUnfolderBase]: For 1863/1863 co-relation queries the response was YES. [2023-08-03 18:14:05,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173757 conditions, 88143 events. 64130/88143 cut-off events. For 1863/1863 co-relation queries the response was YES. Maximal size of possible extension queue 2818. Compared 595283 event pairs, 42576 based on Foata normal form. 9/84911 useless extension candidates. Maximal degree in co-relation 49698. Up to 82585 conditions per place. [2023-08-03 18:14:05,671 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 38 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-08-03 18:14:05,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 53 transitions, 241 flow [2023-08-03 18:14:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:14:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:14:05,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 767 transitions. [2023-08-03 18:14:05,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5382456140350877 [2023-08-03 18:14:05,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 767 transitions. [2023-08-03 18:14:05,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 767 transitions. [2023-08-03 18:14:05,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:05,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 767 transitions. [2023-08-03 18:14:05,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:05,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:05,678 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:05,679 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 140 flow. Second operand 5 states and 767 transitions. [2023-08-03 18:14:05,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 53 transitions, 241 flow [2023-08-03 18:14:05,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 53 transitions, 237 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 18:14:05,680 INFO L231 Difference]: Finished difference. Result has 65 places, 46 transitions, 156 flow [2023-08-03 18:14:05,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2023-08-03 18:14:05,681 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2023-08-03 18:14:05,681 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 46 transitions, 156 flow [2023-08-03 18:14:05,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:05,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:05,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:14:05,688 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-03 18:14:05,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:05,885 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:14:05,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:05,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1207752839, now seen corresponding path program 1 times [2023-08-03 18:14:05,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165144288] [2023-08-03 18:14:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:05,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:05,961 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-03 18:14:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165144288] [2023-08-03 18:14:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165144288] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:14:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605796632] [2023-08-03 18:14:05,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:05,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:05,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:14:05,964 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:14:05,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-03 18:14:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:06,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 18:14:06,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:14:06,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-03 18:14:06,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:14:06,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605796632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:14:06,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:14:06,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 18:14:06,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858398417] [2023-08-03 18:14:06,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:14:06,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:14:06,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:06,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:14:06,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:14:06,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 285 [2023-08-03 18:14:06,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 46 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:06,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:06,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 285 [2023-08-03 18:14:06,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:16,508 INFO L124 PetriNetUnfolderBase]: 63122/85880 cut-off events. [2023-08-03 18:14:16,508 INFO L125 PetriNetUnfolderBase]: For 1033/1033 co-relation queries the response was YES. [2023-08-03 18:14:16,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170204 conditions, 85880 events. 63122/85880 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 2836. Compared 573352 event pairs, 48578 based on Foata normal form. 0/82423 useless extension candidates. Maximal degree in co-relation 48704. Up to 78296 conditions per place. [2023-08-03 18:14:16,965 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 46 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-03 18:14:16,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 278 flow [2023-08-03 18:14:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:14:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:14:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-08-03 18:14:16,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5660818713450292 [2023-08-03 18:14:16,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-08-03 18:14:16,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-08-03 18:14:16,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:16,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-08-03 18:14:16,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:16,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:16,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:16,970 INFO L175 Difference]: Start difference. First operand has 65 places, 46 transitions, 156 flow. Second operand 3 states and 484 transitions. [2023-08-03 18:14:16,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 278 flow [2023-08-03 18:14:16,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 271 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-03 18:14:16,974 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 161 flow [2023-08-03 18:14:16,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2023-08-03 18:14:16,976 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-08-03 18:14:16,977 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 161 flow [2023-08-03 18:14:16,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:16,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:16,977 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:14:16,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-03 18:14:17,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:17,181 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:14:17,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:17,182 INFO L85 PathProgramCache]: Analyzing trace with hash -825035244, now seen corresponding path program 1 times [2023-08-03 18:14:17,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:17,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991251593] [2023-08-03 18:14:17,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:17,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 18:14:17,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991251593] [2023-08-03 18:14:17,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991251593] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:14:17,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768229339] [2023-08-03 18:14:17,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:17,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:17,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:14:17,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:14:17,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-03 18:14:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:17,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:14:17,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:14:17,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 18:14:17,335 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:14:17,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-03 18:14:17,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768229339] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:14:17,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:14:17,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 18:14:17,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005562810] [2023-08-03 18:14:17,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:14:17,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:14:17,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:17,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:14:17,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:14:17,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-03 18:14:17,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:17,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:17,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-03 18:14:17,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:26,099 INFO L124 PetriNetUnfolderBase]: 49600/66620 cut-off events. [2023-08-03 18:14:26,099 INFO L125 PetriNetUnfolderBase]: For 5709/5709 co-relation queries the response was YES. [2023-08-03 18:14:26,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136885 conditions, 66620 events. 49600/66620 cut-off events. For 5709/5709 co-relation queries the response was YES. Maximal size of possible extension queue 2262. Compared 415162 event pairs, 31554 based on Foata normal form. 3/66163 useless extension candidates. Maximal degree in co-relation 48613. Up to 63118 conditions per place. [2023-08-03 18:14:26,442 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 39 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-08-03 18:14:26,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 53 transitions, 253 flow [2023-08-03 18:14:26,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:14:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:14:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 621 transitions. [2023-08-03 18:14:26,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5447368421052632 [2023-08-03 18:14:26,445 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 621 transitions. [2023-08-03 18:14:26,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 621 transitions. [2023-08-03 18:14:26,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:26,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 621 transitions. [2023-08-03 18:14:26,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:26,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:26,447 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:26,448 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 161 flow. Second operand 4 states and 621 transitions. [2023-08-03 18:14:26,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 53 transitions, 253 flow [2023-08-03 18:14:26,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 53 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:14:26,450 INFO L231 Difference]: Finished difference. Result has 68 places, 46 transitions, 157 flow [2023-08-03 18:14:26,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=68, PETRI_TRANSITIONS=46} [2023-08-03 18:14:26,451 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2023-08-03 18:14:26,451 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 46 transitions, 157 flow [2023-08-03 18:14:26,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:26,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:26,451 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:14:26,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-03 18:14:26,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:26,655 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:14:26,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash -613467920, now seen corresponding path program 1 times [2023-08-03 18:14:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167478888] [2023-08-03 18:14:26,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:26,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:26,706 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-03 18:14:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167478888] [2023-08-03 18:14:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167478888] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:14:26,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556102370] [2023-08-03 18:14:26,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:26,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:26,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:14:26,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:14:26,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-03 18:14:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:26,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 18:14:26,806 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:14:26,818 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-03 18:14:26,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:14:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556102370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:14:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:14:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 18:14:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224771168] [2023-08-03 18:14:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:14:26,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:14:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:14:26,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 18:14:26,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-03 18:14:26,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 46 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:26,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:26,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-03 18:14:26,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:35,458 INFO L124 PetriNetUnfolderBase]: 49384/66175 cut-off events. [2023-08-03 18:14:35,458 INFO L125 PetriNetUnfolderBase]: For 5218/5218 co-relation queries the response was YES. [2023-08-03 18:14:35,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135697 conditions, 66175 events. 49384/66175 cut-off events. For 5218/5218 co-relation queries the response was YES. Maximal size of possible extension queue 2262. Compared 411526 event pairs, 15898 based on Foata normal form. 81/65823 useless extension candidates. Maximal degree in co-relation 48197. Up to 62289 conditions per place. [2023-08-03 18:14:35,808 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 51 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2023-08-03 18:14:35,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 65 transitions, 307 flow [2023-08-03 18:14:35,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:14:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:14:35,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 779 transitions. [2023-08-03 18:14:35,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2023-08-03 18:14:35,810 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 779 transitions. [2023-08-03 18:14:35,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 779 transitions. [2023-08-03 18:14:35,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:35,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 779 transitions. [2023-08-03 18:14:35,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:35,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:35,813 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:35,813 INFO L175 Difference]: Start difference. First operand has 68 places, 46 transitions, 157 flow. Second operand 5 states and 779 transitions. [2023-08-03 18:14:35,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 65 transitions, 307 flow [2023-08-03 18:14:35,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 300 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-03 18:14:35,817 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 169 flow [2023-08-03 18:14:35,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-08-03 18:14:35,817 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2023-08-03 18:14:35,817 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 169 flow [2023-08-03 18:14:35,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:35,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:35,818 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:14:35,832 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-03 18:14:36,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:36,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:14:36,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:36,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1778740579, now seen corresponding path program 1 times [2023-08-03 18:14:36,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:36,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504872093] [2023-08-03 18:14:36,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:36,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:36,090 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-03 18:14:36,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:36,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504872093] [2023-08-03 18:14:36,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504872093] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:14:36,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991431518] [2023-08-03 18:14:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:36,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:36,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:14:36,093 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:14:36,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-03 18:14:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:36,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:14:36,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:14:36,209 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-03 18:14:36,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:14:36,220 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-03 18:14:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991431518] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:14:36,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:14:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 18:14:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215561771] [2023-08-03 18:14:36,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:14:36,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:14:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:36,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:14:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:14:36,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-03 18:14:36,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:36,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:36,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-03 18:14:36,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:42,920 INFO L124 PetriNetUnfolderBase]: 38827/51514 cut-off events. [2023-08-03 18:14:42,920 INFO L125 PetriNetUnfolderBase]: For 4510/4510 co-relation queries the response was YES. [2023-08-03 18:14:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105895 conditions, 51514 events. 38827/51514 cut-off events. For 4510/4510 co-relation queries the response was YES. Maximal size of possible extension queue 1955. Compared 309001 event pairs, 25213 based on Foata normal form. 27/51216 useless extension candidates. Maximal degree in co-relation 37532. Up to 48490 conditions per place. [2023-08-03 18:14:43,161 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 47 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-03 18:14:43,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 60 transitions, 291 flow [2023-08-03 18:14:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:14:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:14:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 629 transitions. [2023-08-03 18:14:43,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5517543859649123 [2023-08-03 18:14:43,163 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 629 transitions. [2023-08-03 18:14:43,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 629 transitions. [2023-08-03 18:14:43,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:43,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 629 transitions. [2023-08-03 18:14:43,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:43,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:43,165 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:43,165 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 169 flow. Second operand 4 states and 629 transitions. [2023-08-03 18:14:43,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 60 transitions, 291 flow [2023-08-03 18:14:43,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 286 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 18:14:43,168 INFO L231 Difference]: Finished difference. Result has 70 places, 45 transitions, 160 flow [2023-08-03 18:14:43,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=70, PETRI_TRANSITIONS=45} [2023-08-03 18:14:43,169 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2023-08-03 18:14:43,169 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 45 transitions, 160 flow [2023-08-03 18:14:43,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:43,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:43,169 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:14:43,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-03 18:14:43,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:43,373 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:14:43,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1128523510, now seen corresponding path program 1 times [2023-08-03 18:14:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:43,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876803218] [2023-08-03 18:14:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:43,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:43,423 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-03 18:14:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:43,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876803218] [2023-08-03 18:14:43,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876803218] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:14:43,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821297448] [2023-08-03 18:14:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:43,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:43,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:14:43,426 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:14:43,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-03 18:14:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:43,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:14:43,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:14:43,551 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-03 18:14:43,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:14:43,564 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-03 18:14:43,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821297448] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:14:43,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:14:43,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 18:14:43,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955389771] [2023-08-03 18:14:43,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:14:43,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:14:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:43,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:14:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:14:43,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-03 18:14:43,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 45 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:43,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:43,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-03 18:14:43,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:49,540 INFO L124 PetriNetUnfolderBase]: 35506/46294 cut-off events. [2023-08-03 18:14:49,540 INFO L125 PetriNetUnfolderBase]: For 3088/3088 co-relation queries the response was YES. [2023-08-03 18:14:49,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96166 conditions, 46294 events. 35506/46294 cut-off events. For 3088/3088 co-relation queries the response was YES. Maximal size of possible extension queue 1782. Compared 260527 event pairs, 15364 based on Foata normal form. 324/46617 useless extension candidates. Maximal degree in co-relation 34073. Up to 27643 conditions per place. [2023-08-03 18:14:49,751 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 58 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-08-03 18:14:49,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 72 transitions, 338 flow [2023-08-03 18:14:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:14:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:14:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2023-08-03 18:14:49,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5622807017543859 [2023-08-03 18:14:49,754 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 641 transitions. [2023-08-03 18:14:49,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 641 transitions. [2023-08-03 18:14:49,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:49,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 641 transitions. [2023-08-03 18:14:49,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.25) internal successors, (641), 4 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:49,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:49,756 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:49,756 INFO L175 Difference]: Start difference. First operand has 70 places, 45 transitions, 160 flow. Second operand 4 states and 641 transitions. [2023-08-03 18:14:49,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 72 transitions, 338 flow [2023-08-03 18:14:49,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 332 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 18:14:49,759 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 174 flow [2023-08-03 18:14:49,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2023-08-03 18:14:49,759 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2023-08-03 18:14:49,759 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 174 flow [2023-08-03 18:14:49,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:49,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:49,760 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:14:49,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-03 18:14:49,964 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-03 18:14:49,965 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:14:49,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:49,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1172198418, now seen corresponding path program 1 times [2023-08-03 18:14:49,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:49,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474510642] [2023-08-03 18:14:49,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:49,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 18:14:50,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474510642] [2023-08-03 18:14:50,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474510642] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:14:50,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797857179] [2023-08-03 18:14:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:50,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:14:50,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:14:50,022 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:14:50,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-03 18:14:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:50,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 18:14:50,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:14:50,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 18:14:50,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:14:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797857179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:14:50,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:14:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 18:14:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061197203] [2023-08-03 18:14:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:14:50,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:14:50,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:14:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 18:14:50,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 285 [2023-08-03 18:14:50,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 46 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:50,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:50,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 285 [2023-08-03 18:14:50,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:14:55,214 INFO L124 PetriNetUnfolderBase]: 30106/38950 cut-off events. [2023-08-03 18:14:55,214 INFO L125 PetriNetUnfolderBase]: For 11104/11104 co-relation queries the response was YES. [2023-08-03 18:14:55,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86465 conditions, 38950 events. 30106/38950 cut-off events. For 11104/11104 co-relation queries the response was YES. Maximal size of possible extension queue 1402. Compared 208174 event pairs, 568 based on Foata normal form. 1296/40245 useless extension candidates. Maximal degree in co-relation 30551. Up to 26784 conditions per place. [2023-08-03 18:14:55,406 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 66 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-03 18:14:55,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 78 transitions, 372 flow [2023-08-03 18:14:55,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:14:55,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:14:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 793 transitions. [2023-08-03 18:14:55,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5564912280701755 [2023-08-03 18:14:55,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 793 transitions. [2023-08-03 18:14:55,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 793 transitions. [2023-08-03 18:14:55,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:14:55,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 793 transitions. [2023-08-03 18:14:55,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:55,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:55,411 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:55,411 INFO L175 Difference]: Start difference. First operand has 72 places, 46 transitions, 174 flow. Second operand 5 states and 793 transitions. [2023-08-03 18:14:55,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 78 transitions, 372 flow [2023-08-03 18:14:55,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 78 transitions, 365 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 18:14:55,434 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 163 flow [2023-08-03 18:14:55,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2023-08-03 18:14:55,434 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2023-08-03 18:14:55,435 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 163 flow [2023-08-03 18:14:55,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:55,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:14:55,435 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-03 18:14:55,440 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-03 18:14:55,636 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-03 18:14:55,637 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:14:55,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:14:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1978413169, now seen corresponding path program 1 times [2023-08-03 18:14:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:14:55,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485801597] [2023-08-03 18:14:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:14:55,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:14:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:14:55,807 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-03 18:14:55,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:14:55,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485801597] [2023-08-03 18:14:55,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485801597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:14:55,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:14:55,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 18:14:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425847682] [2023-08-03 18:14:55,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:14:55,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:14:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:14:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:14:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:14:55,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 285 [2023-08-03 18:14:55,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:14:55,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:14:55,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 285 [2023-08-03 18:14:55,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:15:00,762 INFO L124 PetriNetUnfolderBase]: 29410/40255 cut-off events. [2023-08-03 18:15:00,762 INFO L125 PetriNetUnfolderBase]: For 15571/15571 co-relation queries the response was YES. [2023-08-03 18:15:00,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85957 conditions, 40255 events. 29410/40255 cut-off events. For 15571/15571 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 259546 event pairs, 4386 based on Foata normal form. 144/40251 useless extension candidates. Maximal degree in co-relation 85881. Up to 34665 conditions per place. [2023-08-03 18:15:00,984 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 62 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2023-08-03 18:15:00,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 423 flow [2023-08-03 18:15:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:15:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:15:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2023-08-03 18:15:00,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2023-08-03 18:15:00,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2023-08-03 18:15:00,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2023-08-03 18:15:00,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:15:00,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2023-08-03 18:15:00,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:00,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:00,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:00,988 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 163 flow. Second operand 3 states and 510 transitions. [2023-08-03 18:15:00,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 423 flow [2023-08-03 18:15:00,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 74 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 18:15:00,992 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 177 flow [2023-08-03 18:15:00,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2023-08-03 18:15:00,992 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 15 predicate places. [2023-08-03 18:15:00,993 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 177 flow [2023-08-03 18:15:00,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:00,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:00,993 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] [2023-08-03 18:15:00,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-03 18:15:00,993 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:15:00,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1201265248, now seen corresponding path program 1 times [2023-08-03 18:15:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:00,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433567481] [2023-08-03 18:15:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:01,160 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-03 18:15:01,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:15:01,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433567481] [2023-08-03 18:15:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433567481] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:15:01,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:15:01,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 18:15:01,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255138996] [2023-08-03 18:15:01,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:15:01,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:15:01,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:15:01,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:15:01,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:15:01,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 285 [2023-08-03 18:15:01,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 46 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:01,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:15:01,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 285 [2023-08-03 18:15:01,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:15:06,300 INFO L124 PetriNetUnfolderBase]: 29080/38923 cut-off events. [2023-08-03 18:15:06,301 INFO L125 PetriNetUnfolderBase]: For 15256/15256 co-relation queries the response was YES. [2023-08-03 18:15:06,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91310 conditions, 38923 events. 29080/38923 cut-off events. For 15256/15256 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 228674 event pairs, 5600 based on Foata normal form. 72/38995 useless extension candidates. Maximal degree in co-relation 57695. Up to 33238 conditions per place. [2023-08-03 18:15:06,491 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 52 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2023-08-03 18:15:06,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 64 transitions, 351 flow [2023-08-03 18:15:06,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:15:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:15:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2023-08-03 18:15:06,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5719298245614035 [2023-08-03 18:15:06,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2023-08-03 18:15:06,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2023-08-03 18:15:06,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:15:06,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2023-08-03 18:15:06,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:06,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:06,496 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:06,496 INFO L175 Difference]: Start difference. First operand has 72 places, 46 transitions, 177 flow. Second operand 3 states and 489 transitions. [2023-08-03 18:15:06,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 64 transitions, 351 flow [2023-08-03 18:15:06,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 64 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:15:06,503 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 193 flow [2023-08-03 18:15:06,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-08-03 18:15:06,503 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2023-08-03 18:15:06,503 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 193 flow [2023-08-03 18:15:06,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:06,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:06,504 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-03 18:15:06,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-03 18:15:06,504 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:15:06,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1604967073, now seen corresponding path program 1 times [2023-08-03 18:15:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:06,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993817470] [2023-08-03 18:15:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:06,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:06,647 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-03 18:15:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:15:06,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993817470] [2023-08-03 18:15:06,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993817470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:15:06,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:15:06,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:15:06,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678948083] [2023-08-03 18:15:06,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:15:06,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 18:15:06,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:15:06,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 18:15:06,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 18:15:06,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 285 [2023-08-03 18:15:06,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:06,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:15:06,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 285 [2023-08-03 18:15:06,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:15:21,000 INFO L124 PetriNetUnfolderBase]: 79972/103603 cut-off events. [2023-08-03 18:15:21,000 INFO L125 PetriNetUnfolderBase]: For 57020/57020 co-relation queries the response was YES. [2023-08-03 18:15:21,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253001 conditions, 103603 events. 79972/103603 cut-off events. For 57020/57020 co-relation queries the response was YES. Maximal size of possible extension queue 3763. Compared 636244 event pairs, 11386 based on Foata normal form. 1920/105352 useless extension candidates. Maximal degree in co-relation 91602. Up to 46909 conditions per place. [2023-08-03 18:15:21,605 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 86 selfloop transitions, 7 changer transitions 2/102 dead transitions. [2023-08-03 18:15:21,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 102 transitions, 581 flow [2023-08-03 18:15:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:15:21,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:15:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 657 transitions. [2023-08-03 18:15:21,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5763157894736842 [2023-08-03 18:15:21,607 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 657 transitions. [2023-08-03 18:15:21,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 657 transitions. [2023-08-03 18:15:21,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:15:21,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 657 transitions. [2023-08-03 18:15:21,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:21,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:21,609 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:21,609 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 193 flow. Second operand 4 states and 657 transitions. [2023-08-03 18:15:21,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 102 transitions, 581 flow [2023-08-03 18:15:21,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 102 transitions, 576 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:15:21,633 INFO L231 Difference]: Finished difference. Result has 78 places, 54 transitions, 249 flow [2023-08-03 18:15:21,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=78, PETRI_TRANSITIONS=54} [2023-08-03 18:15:21,634 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places. [2023-08-03 18:15:21,634 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 54 transitions, 249 flow [2023-08-03 18:15:21,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:21,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:21,634 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-03 18:15:21,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-03 18:15:21,634 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:15:21,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1290614400, now seen corresponding path program 1 times [2023-08-03 18:15:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652216344] [2023-08-03 18:15:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:21,790 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-03 18:15:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:15:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652216344] [2023-08-03 18:15:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652216344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:15:21,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:15:21,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 18:15:21,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494743635] [2023-08-03 18:15:21,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:15:21,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 18:15:21,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:15:21,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 18:15:21,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-03 18:15:21,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 285 [2023-08-03 18:15:21,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 54 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:21,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:15:21,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 285 [2023-08-03 18:15:21,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:15:32,731 INFO L124 PetriNetUnfolderBase]: 60695/78421 cut-off events. [2023-08-03 18:15:32,731 INFO L125 PetriNetUnfolderBase]: For 63110/63590 co-relation queries the response was YES. [2023-08-03 18:15:33,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208542 conditions, 78421 events. 60695/78421 cut-off events. For 63110/63590 co-relation queries the response was YES. Maximal size of possible extension queue 3293. Compared 468164 event pairs, 12445 based on Foata normal form. 3078/80184 useless extension candidates. Maximal degree in co-relation 134616. Up to 62259 conditions per place. [2023-08-03 18:15:33,215 INFO L140 encePairwiseOnDemand]: 276/285 looper letters, 111 selfloop transitions, 13 changer transitions 2/137 dead transitions. [2023-08-03 18:15:33,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 137 transitions, 864 flow [2023-08-03 18:15:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:15:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:15:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 785 transitions. [2023-08-03 18:15:33,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5508771929824562 [2023-08-03 18:15:33,217 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 785 transitions. [2023-08-03 18:15:33,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 785 transitions. [2023-08-03 18:15:33,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:15:33,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 785 transitions. [2023-08-03 18:15:33,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:33,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:33,220 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 285.0) internal successors, (1710), 6 states have internal predecessors, (1710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:33,220 INFO L175 Difference]: Start difference. First operand has 78 places, 54 transitions, 249 flow. Second operand 5 states and 785 transitions. [2023-08-03 18:15:33,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 137 transitions, 864 flow [2023-08-03 18:15:33,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 137 transitions, 847 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:15:33,237 INFO L231 Difference]: Finished difference. Result has 84 places, 66 transitions, 347 flow [2023-08-03 18:15:33,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2023-08-03 18:15:33,238 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2023-08-03 18:15:33,238 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 347 flow [2023-08-03 18:15:33,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:33,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:33,238 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] [2023-08-03 18:15:33,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-03 18:15:33,238 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:15:33,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:33,239 INFO L85 PathProgramCache]: Analyzing trace with hash 354343920, now seen corresponding path program 1 times [2023-08-03 18:15:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:33,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568034435] [2023-08-03 18:15:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:33,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-03 18:15:34,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:15:34,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568034435] [2023-08-03 18:15:34,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568034435] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:15:34,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039916756] [2023-08-03 18:15:34,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:34,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:15:34,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:15:34,187 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:15:34,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-03 18:15:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:34,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-03 18:15:34,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:15:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 18:15:34,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:15:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-03 18:15:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039916756] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:15:34,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:15:34,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 12 [2023-08-03 18:15:34,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508150000] [2023-08-03 18:15:34,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:15:34,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-03 18:15:34,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:15:34,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-03 18:15:34,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-08-03 18:15:34,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 285 [2023-08-03 18:15:34,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 347 flow. Second operand has 13 states, 13 states have (on average 126.38461538461539) internal successors, (1643), 13 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:34,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:15:34,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 285 [2023-08-03 18:15:34,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:15:51,608 INFO L124 PetriNetUnfolderBase]: 89663/117053 cut-off events. [2023-08-03 18:15:51,608 INFO L125 PetriNetUnfolderBase]: For 134277/135300 co-relation queries the response was YES. [2023-08-03 18:15:52,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392743 conditions, 117053 events. 89663/117053 cut-off events. For 134277/135300 co-relation queries the response was YES. Maximal size of possible extension queue 4290. Compared 717542 event pairs, 6675 based on Foata normal form. 4666/120200 useless extension candidates. Maximal degree in co-relation 392647. Up to 44646 conditions per place. [2023-08-03 18:15:52,444 INFO L140 encePairwiseOnDemand]: 268/285 looper letters, 370 selfloop transitions, 106 changer transitions 12/497 dead transitions. [2023-08-03 18:15:52,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 497 transitions, 3444 flow [2023-08-03 18:15:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-03 18:15:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-03 18:15:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3397 transitions. [2023-08-03 18:15:52,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4767719298245614 [2023-08-03 18:15:52,449 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3397 transitions. [2023-08-03 18:15:52,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3397 transitions. [2023-08-03 18:15:52,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:15:52,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3397 transitions. [2023-08-03 18:15:52,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 135.88) internal successors, (3397), 25 states have internal predecessors, (3397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:52,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 285.0) internal successors, (7410), 26 states have internal predecessors, (7410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:52,461 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 285.0) internal successors, (7410), 26 states have internal predecessors, (7410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:52,461 INFO L175 Difference]: Start difference. First operand has 84 places, 66 transitions, 347 flow. Second operand 25 states and 3397 transitions. [2023-08-03 18:15:52,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 497 transitions, 3444 flow [2023-08-03 18:15:52,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 497 transitions, 3427 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:15:52,743 INFO L231 Difference]: Finished difference. Result has 126 places, 173 transitions, 1392 flow [2023-08-03 18:15:52,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1392, PETRI_PLACES=126, PETRI_TRANSITIONS=173} [2023-08-03 18:15:52,744 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 69 predicate places. [2023-08-03 18:15:52,744 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 173 transitions, 1392 flow [2023-08-03 18:15:52,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 126.38461538461539) internal successors, (1643), 13 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:15:52,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:15:52,744 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:15:52,749 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-03 18:15:52,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-03 18:15:52,948 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:15:52,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:15:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash -934081602, now seen corresponding path program 1 times [2023-08-03 18:15:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:15:52,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839064508] [2023-08-03 18:15:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:52,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:15:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-03 18:15:55,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:15:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839064508] [2023-08-03 18:15:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839064508] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:15:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003141273] [2023-08-03 18:15:55,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:15:55,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:15:55,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:15:55,146 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:15:55,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-03 18:15:55,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:15:55,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 91 conjunts are in the unsatisfiable core [2023-08-03 18:15:55,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:15:55,319 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-03 18:15:55,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-03 18:15:55,365 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-03 18:15:55,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-03 18:15:55,532 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-03 18:15:55,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-03 18:15:55,728 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 18:15:55,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 18:15:56,071 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-03 18:15:56,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-03 18:15:56,358 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-03 18:15:56,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-03 18:15:56,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-03 18:15:56,514 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-03 18:15:56,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-03 18:15:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-03 18:15:56,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:16:06,111 WARN L233 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:16:16,908 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 62 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:16:29,071 WARN L233 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 85 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:16:39,004 WARN L233 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 57 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:16:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-03 18:16:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003141273] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:16:39,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:16:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 35 [2023-08-03 18:16:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989195997] [2023-08-03 18:16:39,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:16:39,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-03 18:16:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:16:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-03 18:16:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1097, Unknown=5, NotChecked=0, Total=1332 [2023-08-03 18:16:41,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:16:43,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:16:45,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:16:48,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:16:50,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:16:52,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:16:54,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:16:55,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 285 [2023-08-03 18:16:55,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 173 transitions, 1392 flow. Second operand has 37 states, 37 states have (on average 106.51351351351352) internal successors, (3941), 37 states have internal predecessors, (3941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:16:55,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:16:55,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 285 [2023-08-03 18:16:55,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:17:10,223 WARN L233 SmtUtils]: Spent 14.45s on a formula simplification. DAG size of input: 245 DAG size of output: 124 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:17:15,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:17:34,265 WARN L233 SmtUtils]: Spent 18.39s on a formula simplification. DAG size of input: 214 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:17:44,776 WARN L233 SmtUtils]: Spent 6.75s on a formula simplification. DAG size of input: 237 DAG size of output: 121 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:17:47,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:17:53,690 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 181 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:18:18,583 WARN L233 SmtUtils]: Spent 18.31s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:18:20,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:18:23,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:18:40,718 WARN L233 SmtUtils]: Spent 15.29s on a formula simplification. DAG size of input: 218 DAG size of output: 163 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:18:54,024 WARN L233 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:19:11,356 WARN L233 SmtUtils]: Spent 16.27s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:19:13,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:19:15,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:19:17,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:19:24,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:19:27,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:19:31,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:19:41,907 WARN L233 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 217 DAG size of output: 171 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:19:46,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:19:54,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:19:56,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:20:17,042 WARN L233 SmtUtils]: Spent 16.32s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:20:19,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:20:24,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:20:41,499 WARN L233 SmtUtils]: Spent 15.46s on a formula simplification. DAG size of input: 221 DAG size of output: 166 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:20:46,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:20:48,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:21:09,466 WARN L233 SmtUtils]: Spent 8.57s on a formula simplification. DAG size of input: 157 DAG size of output: 151 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-03 18:21:36,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:21:43,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:21:45,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-03 18:21:48,413 INFO L124 PetriNetUnfolderBase]: 155196/204733 cut-off events. [2023-08-03 18:21:48,414 INFO L125 PetriNetUnfolderBase]: For 1096938/1098105 co-relation queries the response was YES. [2023-08-03 18:21:50,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925772 conditions, 204733 events. 155196/204733 cut-off events. For 1096938/1098105 co-relation queries the response was YES. Maximal size of possible extension queue 8141. Compared 1357015 event pairs, 15462 based on Foata normal form. 418/202522 useless extension candidates. Maximal degree in co-relation 925589. Up to 125659 conditions per place. [2023-08-03 18:21:50,868 INFO L140 encePairwiseOnDemand]: 265/285 looper letters, 808 selfloop transitions, 662 changer transitions 44/1523 dead transitions. [2023-08-03 18:21:50,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1523 transitions, 14125 flow [2023-08-03 18:21:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-08-03 18:21:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2023-08-03 18:21:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 9967 transitions. [2023-08-03 18:21:50,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066503467972256 [2023-08-03 18:21:50,879 INFO L72 ComplementDD]: Start complementDD. Operand 86 states and 9967 transitions. [2023-08-03 18:21:50,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 9967 transitions. [2023-08-03 18:21:50,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:21:50,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 86 states and 9967 transitions. [2023-08-03 18:21:50,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 87 states, 86 states have (on average 115.8953488372093) internal successors, (9967), 86 states have internal predecessors, (9967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:21:50,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 87 states, 87 states have (on average 285.0) internal successors, (24795), 87 states have internal predecessors, (24795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:21:50,914 INFO L81 ComplementDD]: Finished complementDD. Result has 87 states, 87 states have (on average 285.0) internal successors, (24795), 87 states have internal predecessors, (24795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:21:50,914 INFO L175 Difference]: Start difference. First operand has 126 places, 173 transitions, 1392 flow. Second operand 86 states and 9967 transitions. [2023-08-03 18:21:50,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 1523 transitions, 14125 flow [2023-08-03 18:23:54,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 1523 transitions, 12630 flow, removed 693 selfloop flow, removed 3 redundant places. [2023-08-03 18:23:54,747 INFO L231 Difference]: Finished difference. Result has 248 places, 801 transitions, 7848 flow [2023-08-03 18:23:54,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=7848, PETRI_PLACES=248, PETRI_TRANSITIONS=801} [2023-08-03 18:23:54,747 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 191 predicate places. [2023-08-03 18:23:54,748 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 801 transitions, 7848 flow [2023-08-03 18:23:54,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 106.51351351351352) internal successors, (3941), 37 states have internal predecessors, (3941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:23:54,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:23:54,748 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:23:54,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-03 18:23:54,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-03 18:23:54,949 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-03 18:23:54,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:23:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1710592711, now seen corresponding path program 1 times [2023-08-03 18:23:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:23:54,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067674596] [2023-08-03 18:23:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:23:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:23:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:23:55,006 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:23:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:23:55,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:23:55,058 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:23:55,058 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-03 18:23:55,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-03 18:23:55,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-03 18:23:55,059 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-03 18:23:55,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-03 18:23:55,059 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:23:55,061 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 18:23:55,061 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 18:23:55,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 06:23:55 BasicIcfg [2023-08-03 18:23:55,169 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 18:23:55,170 INFO L158 Benchmark]: Toolchain (without parser) took 640652.84ms. Allocated memory was 352.3MB in the beginning and 15.1GB in the end (delta: 14.8GB). Free memory was 291.9MB in the beginning and 12.1GB in the end (delta: -11.8GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-08-03 18:23:55,170 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 352.3MB. Free memory was 302.7MB in the beginning and 302.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 18:23:55,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.40ms. Allocated memory is still 352.3MB. Free memory was 291.7MB in the beginning and 267.7MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 18:23:55,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.08ms. Allocated memory was 352.3MB in the beginning and 557.8MB in the end (delta: 205.5MB). Free memory was 267.7MB in the beginning and 522.9MB in the end (delta: -255.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.0GB. [2023-08-03 18:23:55,171 INFO L158 Benchmark]: Boogie Preprocessor took 31.73ms. Allocated memory is still 557.8MB. Free memory was 522.9MB in the beginning and 520.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:23:55,171 INFO L158 Benchmark]: RCFGBuilder took 554.05ms. Allocated memory is still 557.8MB. Free memory was 520.3MB in the beginning and 454.9MB in the end (delta: 65.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.0GB. [2023-08-03 18:23:55,173 INFO L158 Benchmark]: TraceAbstraction took 639665.94ms. Allocated memory was 557.8MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 454.1MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-08-03 18:23:55,174 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 352.3MB. Free memory was 302.7MB in the beginning and 302.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 346.40ms. Allocated memory is still 352.3MB. Free memory was 291.7MB in the beginning and 267.7MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.08ms. Allocated memory was 352.3MB in the beginning and 557.8MB in the end (delta: 205.5MB). Free memory was 267.7MB in the beginning and 522.9MB in the end (delta: -255.1MB). Peak memory consumption was 10.0MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.73ms. Allocated memory is still 557.8MB. Free memory was 522.9MB in the beginning and 520.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 554.05ms. Allocated memory is still 557.8MB. Free memory was 520.3MB in the beginning and 454.9MB in the end (delta: 65.5MB). Peak memory consumption was 65.0MB. Max. memory is 16.0GB. * TraceAbstraction took 639665.94ms. Allocated memory was 557.8MB in the beginning and 15.1GB in the end (delta: 14.6GB). Free memory was 454.1MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 137 PlacesBefore, 35 PlacesAfterwards, 134 TransitionsBefore, 28 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 111 TotalNumberOfCompositions, 4444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2129, independent: 1949, independent conditional: 0, independent unconditional: 1949, dependent: 180, dependent conditional: 0, dependent unconditional: 180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 949, independent: 913, independent conditional: 0, independent unconditional: 913, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2129, independent: 1036, independent conditional: 0, independent unconditional: 1036, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 949, unknown conditional: 0, unknown unconditional: 949] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 165 PlacesBefore, 57 PlacesAfterwards, 156 TransitionsBefore, 44 TransitionsAfterwards, 4444 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 4 ChoiceCompositions, 117 TotalNumberOfCompositions, 12999 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5106, independent: 4791, independent conditional: 0, independent unconditional: 4791, dependent: 315, dependent conditional: 0, dependent unconditional: 315, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2205, independent: 2146, independent conditional: 0, independent unconditional: 2146, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5106, independent: 2645, independent conditional: 0, independent unconditional: 2645, dependent: 256, dependent conditional: 0, dependent unconditional: 256, unknown: 2205, unknown conditional: 0, unknown unconditional: 2205] , Statistics on independence cache: Total cache size (in pairs): 305, Positive cache size: 278, Positive conditional cache size: 0, Positive unconditional cache size: 278, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049[2]; [L838] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t2049[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2049[asdf], ((void *)0), P0, ((void *)0))=-5, t2049={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t2049[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2049[asdf], ((void *)0), P0, ((void *)0))=-4, t2049={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L838] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L838] COND FALSE 0 !(asdf<2) [L839] 0 pthread_t t2050[2]; [L840] 0 int asdf=0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, t2050={10:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] COND TRUE 0 asdf<2 [L840] FCALL, FORK 0 pthread_create(&t2050[asdf], ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2050[asdf], ((void *)0), P1, ((void *)0))=-3, t2049={9:0}, t2050={10:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, t2050={10:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] COND TRUE 0 asdf<2 [L794] 3 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] FCALL, FORK 0 pthread_create(&t2050[asdf], ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2050[asdf], ((void *)0), P1, ((void *)0))=-2, t2049={9:0}, t2050={10:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L840] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, t2050={10:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 3 return 0; [L840] COND FALSE 0 !(asdf<2) [L841] 0 pthread_t t2051[2]; [L842] 0 int asdf=0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, t2050={10:0}, t2051={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] COND TRUE 0 asdf<2 [L842] FCALL, FORK 0 pthread_create(&t2051[asdf], ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2051[asdf], ((void *)0), P2, ((void *)0))=-1, t2049={9:0}, t2050={10:0}, t2051={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 5 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 5 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] 0 asdf++ VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, t2050={10:0}, t2051={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 5 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 5 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 5 \read(z) [L815] EXPR 5 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 5 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 5 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 5 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 5 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 5 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 5 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] COND TRUE 0 asdf<2 [L842] FCALL, FORK 0 pthread_create(&t2051[asdf], ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2051[asdf], ((void *)0), P2, ((void *)0))=0, t2049={9:0}, t2050={10:0}, t2051={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] 0 asdf++ VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2049={9:0}, t2050={10:0}, t2051={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 5 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 5 return 0; [L842] COND FALSE 0 !(asdf<2) [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, asdf=2, main$tmp_guard0=1, main$tmp_guard1=0, t2049={9:0}, t2050={10:0}, t2051={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L859] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 840]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 164 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 186 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 633.1s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 573.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.2s, HoareTripleCheckerStatistics: 408 mSolverCounterUnknown, 2574 SdHoareTripleChecker+Valid, 69.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2435 mSDsluCounter, 991 SdHoareTripleChecker+Invalid, 68.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 958 mSDsCounter, 964 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7824 IncrementalHoareTripleChecker+Invalid, 9196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 964 mSolverCounterUnsat, 33 mSDtfsCounter, 7824 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 509 GetRequests, 324 SyntacticMatches, 7 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3943 ImplicationChecksByTransitivity, 248.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7848occurred in iteration=15, InterpolantAutomatonStates: 162, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 48.3s InterpolantComputationTime, 619 NumberOfCodeBlocks, 619 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 688 ConstructedInterpolants, 42 QuantifiedInterpolants, 10225 SizeOfPredicates, 58 NumberOfNonLiveVariables, 2654 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 30 InterpolantComputations, 10 PerfectInterpolantSequences, 270/360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 18:23:55,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...