/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_mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:44:19,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:44:19,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:44:19,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:44:19,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:44:19,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:44:19,917 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:44:19,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:44:19,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:44:19,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:44:19,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:44:19,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:44:19,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:44:19,953 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:44:19,953 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:44:19,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:44:19,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:44:19,954 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:44:19,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:44:19,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:44:19,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:44:19,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:44:19,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:44:19,955 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:44:19,955 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:44:19,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:44:19,956 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:44:19,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:44:19,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:44:19,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:44:19,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:44:19,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:44:19,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:44:19,958 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:44:19,958 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:44:19,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:44:19,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:44:19,959 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:44:19,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:44:19,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:44:19,959 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:44:19,959 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 17:44:20,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:44:20,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:44:20,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:44:20,229 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:44:20,230 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:44:20,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:44:21,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:44:21,665 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:44:21,665 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:44:21,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8358a98d6/7433084f6f2e48f7a4fe471149d95cc4/FLAGf3ab0e8ed [2023-08-03 17:44:21,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8358a98d6/7433084f6f2e48f7a4fe471149d95cc4 [2023-08-03 17:44:21,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:44:21,697 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:44:21,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:44:21,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:44:21,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:44:21,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:44:21" (1/1) ... [2023-08-03 17:44:21,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1704b5e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:21, skipping insertion in model container [2023-08-03 17:44:21,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:44:21" (1/1) ... [2023-08-03 17:44:21,742 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:44:21,885 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_mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[983,996] [2023-08-03 17:44:22,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:44:22,116 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:44:22,128 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_mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i[983,996] [2023-08-03 17:44:22,148 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:44:22,150 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-03 17:44:22,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:44:22,241 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:44:22,241 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:44:22,247 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:44:22,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22 WrapperNode [2023-08-03 17:44:22,248 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:44:22,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:44:22,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:44:22,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:44:22,256 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,324 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-03 17:44:22,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:44:22,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:44:22,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:44:22,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:44:22,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,362 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:44:22,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:44:22,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:44:22,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:44:22,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (1/1) ... [2023-08-03 17:44:22,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:44:22,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:44:22,417 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 17:44:22,436 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 17:44:22,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:44:22,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:44:22,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:44:22,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:44:22,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:44:22,472 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:44:22,472 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:44:22,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:44:22,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:44:22,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:44:22,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:44:22,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:44:22,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:44:22,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:44:22,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:44:22,475 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 17:44:22,587 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:44:22,588 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:44:22,844 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:44:22,955 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:44:22,956 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:44:22,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:44:22 BoogieIcfgContainer [2023-08-03 17:44:22,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:44:22,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:44:22,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:44:22,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:44:22,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:44:21" (1/3) ... [2023-08-03 17:44:22,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d6bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:44:22, skipping insertion in model container [2023-08-03 17:44:22,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:44:22" (2/3) ... [2023-08-03 17:44:22,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27d6bbcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:44:22, skipping insertion in model container [2023-08-03 17:44:22,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:44:22" (3/3) ... [2023-08-03 17:44:22,972 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix056_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt_bound2.i [2023-08-03 17:44:22,978 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:44:22,985 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:44:22,985 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:44:22,985 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:44:23,031 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:44:23,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 269 flow [2023-08-03 17:44:23,267 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-03 17:44:23,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:44:23,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 449 events. 30/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1986 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2023-08-03 17:44:23,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 127 transitions, 269 flow [2023-08-03 17:44:23,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 127 transitions, 269 flow [2023-08-03 17:44:23,292 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:44:23,309 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 127 transitions, 269 flow [2023-08-03 17:44:23,321 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 127 transitions, 269 flow [2023-08-03 17:44:23,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 127 transitions, 269 flow [2023-08-03 17:44:23,409 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-03 17:44:23,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:44:23,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 449 events. 30/449 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1986 event pairs, 0 based on Foata normal form. 0/393 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2023-08-03 17:44:23,415 INFO L119 LiptonReduction]: Number of co-enabled transitions 2500 [2023-08-03 17:44:26,889 INFO L134 LiptonReduction]: Checked pairs total: 5920 [2023-08-03 17:44:26,889 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-03 17:44:26,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:44:26,907 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;@28e68413, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:44:26,907 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:44:26,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:44:26,912 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-08-03 17:44:26,912 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:44:26,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:44:26,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 17:44:26,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:44:26,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:44:26,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1052075498, now seen corresponding path program 1 times [2023-08-03 17:44:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:44:26,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78389410] [2023-08-03 17:44:26,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:44:26,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:44:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:44:27,180 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 17:44:27,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:44:27,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78389410] [2023-08-03 17:44:27,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78389410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:44:27,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:44:27,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:44:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921261890] [2023-08-03 17:44:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:44:27,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:44:27,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:44:27,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:44:27,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:44:27,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 234 [2023-08-03 17:44:27,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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 17:44:27,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:44:27,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 234 [2023-08-03 17:44:27,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:44:27,560 INFO L124 PetriNetUnfolderBase]: 1537/2502 cut-off events. [2023-08-03 17:44:27,561 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-03 17:44:27,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4947 conditions, 2502 events. 1537/2502 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13846 event pairs, 1255 based on Foata normal form. 90/2145 useless extension candidates. Maximal degree in co-relation 4930. Up to 2381 conditions per place. [2023-08-03 17:44:27,579 INFO L140 encePairwiseOnDemand]: 230/234 looper letters, 28 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-03 17:44:27,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 147 flow [2023-08-03 17:44:27,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:44:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:44:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-03 17:44:27,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071225071225072 [2023-08-03 17:44:27,594 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-03 17:44:27,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-03 17:44:27,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:44:27,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-03 17:44:27,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states 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 17:44:27,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:44:27,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 234.0) internal successors, (936), 4 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:44:27,609 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 83 flow. Second operand 3 states and 356 transitions. [2023-08-03 17:44:27,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 147 flow [2023-08-03 17:44:27,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 147 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:44:27,614 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 89 flow [2023-08-03 17:44:27,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=234, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-03 17:44:27,619 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-03 17:44:27,619 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 89 flow [2023-08-03 17:44:27,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states 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 17:44:27,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:44:27,620 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:44:27,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:44:27,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 17:44:27,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:44:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1044419153, now seen corresponding path program 1 times [2023-08-03 17:44:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:44:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490331062] [2023-08-03 17:44:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:44:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:44:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:44:27,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:44:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:44:27,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:44:27,673 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:44:27,675 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:44:27,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:44:27,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:44:27,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:44:27,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:44:27,677 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:44:27,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:44:27,678 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:44:27,680 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:44:27,680 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:44:27,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:44:27,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 151 transitions, 338 flow [2023-08-03 17:44:27,906 INFO L124 PetriNetUnfolderBase]: 93/1390 cut-off events. [2023-08-03 17:44:27,906 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:44:27,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 1390 events. 93/1390 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9632 event pairs, 0 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 1004. Up to 54 conditions per place. [2023-08-03 17:44:27,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 151 transitions, 338 flow [2023-08-03 17:44:27,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 159 places, 151 transitions, 338 flow [2023-08-03 17:44:27,916 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:44:27,916 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 151 transitions, 338 flow [2023-08-03 17:44:27,917 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 151 transitions, 338 flow [2023-08-03 17:44:27,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 151 transitions, 338 flow [2023-08-03 17:44:28,081 INFO L124 PetriNetUnfolderBase]: 93/1390 cut-off events. [2023-08-03 17:44:28,081 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:44:28,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1488 conditions, 1390 events. 93/1390 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9632 event pairs, 0 based on Foata normal form. 0/1213 useless extension candidates. Maximal degree in co-relation 1004. Up to 54 conditions per place. [2023-08-03 17:44:28,118 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-03 17:44:31,388 INFO L134 LiptonReduction]: Checked pairs total: 16589 [2023-08-03 17:44:31,388 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-03 17:44:31,391 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:44:31,392 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;@28e68413, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:44:31,392 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:44:31,395 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:44:31,395 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-08-03 17:44:31,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:44:31,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:44:31,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-03 17:44:31,396 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:44:31,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:44:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1060004974, now seen corresponding path program 1 times [2023-08-03 17:44:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:44:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465506032] [2023-08-03 17:44:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:44:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:44:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:44:31,450 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 17:44:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:44:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465506032] [2023-08-03 17:44:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465506032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:44:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:44:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:44:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651542307] [2023-08-03 17:44:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:44:31,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:44:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:44:31,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:44:31,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:44:31,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 266 [2023-08-03 17:44:31,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 17:44:31,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:44:31,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 266 [2023-08-03 17:44:31,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:45:01,539 INFO L124 PetriNetUnfolderBase]: 267242/353922 cut-off events. [2023-08-03 17:45:01,539 INFO L125 PetriNetUnfolderBase]: For 4476/4476 co-relation queries the response was YES. [2023-08-03 17:45:02,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697415 conditions, 353922 events. 267242/353922 cut-off events. For 4476/4476 co-relation queries the response was YES. Maximal size of possible extension queue 9840. Compared 2492285 event pairs, 220020 based on Foata normal form. 7812/308381 useless extension candidates. Maximal degree in co-relation 200984. Up to 338076 conditions per place. [2023-08-03 17:45:03,677 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 41 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-03 17:45:03,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 55 transitions, 232 flow [2023-08-03 17:45:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:45:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:45:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-03 17:45:03,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2023-08-03 17:45:03,682 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-03 17:45:03,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-03 17:45:03,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:45:03,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-03 17:45:03,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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 17:45:03,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 17:45:03,688 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 17:45:03,688 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 140 flow. Second operand 3 states and 420 transitions. [2023-08-03 17:45:03,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 55 transitions, 232 flow [2023-08-03 17:45:03,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 226 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:45:03,697 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 144 flow [2023-08-03 17:45:03,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-08-03 17:45:03,698 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2023-08-03 17:45:03,699 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 144 flow [2023-08-03 17:45:03,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states 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 17:45:03,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:45:03,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:45:03,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:45:03,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:45:03,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:45:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1365483720, now seen corresponding path program 1 times [2023-08-03 17:45:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:45:03,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024941364] [2023-08-03 17:45:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:45:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:45:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:45:03,763 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 17:45:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:45:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024941364] [2023-08-03 17:45:03,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024941364] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:45:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867309803] [2023-08-03 17:45:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:45:03,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:45:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:45:03,769 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 17:45:03,809 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 17:45:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:45:03,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-03 17:45:03,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:45:03,915 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 17:45:03,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:45:03,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867309803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:45:03,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:45:03,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-03 17:45:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033915661] [2023-08-03 17:45:03,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:45:03,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:45:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:45:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:45:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:45:03,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 266 [2023-08-03 17:45:03,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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 17:45:03,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:45:03,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 266 [2023-08-03 17:45:03,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:45:30,507 INFO L124 PetriNetUnfolderBase]: 258886/341371 cut-off events. [2023-08-03 17:45:30,507 INFO L125 PetriNetUnfolderBase]: For 3627/3627 co-relation queries the response was YES. [2023-08-03 17:45:31,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673067 conditions, 341371 events. 258886/341371 cut-off events. For 3627/3627 co-relation queries the response was YES. Maximal size of possible extension queue 9819. Compared 2391753 event pairs, 208258 based on Foata normal form. 0/293946 useless extension candidates. Maximal degree in co-relation 673030. Up to 326233 conditions per place. [2023-08-03 17:45:32,478 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 47 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-03 17:45:32,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 260 flow [2023-08-03 17:45:32,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:45:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:45:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-03 17:45:32,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.531328320802005 [2023-08-03 17:45:32,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-03 17:45:32,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-03 17:45:32,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:45:32,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-03 17:45:32,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 17:45:32,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 17:45:32,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 17:45:32,490 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 144 flow. Second operand 3 states and 424 transitions. [2023-08-03 17:45:32,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 260 flow [2023-08-03 17:45:32,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 61 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:45:32,494 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 154 flow [2023-08-03 17:45:32,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2023-08-03 17:45:32,497 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places. [2023-08-03 17:45:32,497 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 154 flow [2023-08-03 17:45:32,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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 17:45:32,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:45:32,498 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:45:32,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:45:32,702 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 17:45:32,703 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:45:32,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:45:32,703 INFO L85 PathProgramCache]: Analyzing trace with hash 899596236, now seen corresponding path program 1 times [2023-08-03 17:45:32,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:45:32,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400666328] [2023-08-03 17:45:32,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:45:32,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:45:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:45:32,802 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 17:45:32,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:45:32,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400666328] [2023-08-03 17:45:32,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400666328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:45:32,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:45:32,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-03 17:45:32,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458280391] [2023-08-03 17:45:32,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:45:32,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:45:32,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:45:32,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:45:32,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:45:32,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 266 [2023-08-03 17:45:32,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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 17:45:32,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:45:32,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 266 [2023-08-03 17:45:32,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:45:58,915 INFO L124 PetriNetUnfolderBase]: 258874/341087 cut-off events. [2023-08-03 17:45:58,915 INFO L125 PetriNetUnfolderBase]: For 3939/3939 co-relation queries the response was YES. [2023-08-03 17:45:59,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673285 conditions, 341087 events. 258874/341087 cut-off events. For 3939/3939 co-relation queries the response was YES. Maximal size of possible extension queue 9780. Compared 2372427 event pairs, 180144 based on Foata normal form. 9/294523 useless extension candidates. Maximal degree in co-relation 194426. Up to 326337 conditions per place. [2023-08-03 17:46:00,955 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 45 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-08-03 17:46:00,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 60 transitions, 269 flow [2023-08-03 17:46:00,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:46:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:46:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-03 17:46:00,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030075187969925 [2023-08-03 17:46:00,959 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-03 17:46:00,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-03 17:46:00,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:46:00,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-03 17:46:00,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 17:46:00,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 17:46:00,963 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 17:46:00,963 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 154 flow. Second operand 5 states and 669 transitions. [2023-08-03 17:46:00,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 60 transitions, 269 flow [2023-08-03 17:46:00,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-03 17:46:00,967 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 170 flow [2023-08-03 17:46:00,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2023-08-03 17:46:00,968 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places. [2023-08-03 17:46:00,968 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 170 flow [2023-08-03 17:46:00,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states 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 17:46:00,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:46:00,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:46:00,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-03 17:46:00,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:46:00,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:46:00,970 INFO L85 PathProgramCache]: Analyzing trace with hash -278884055, now seen corresponding path program 1 times [2023-08-03 17:46:00,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:46:00,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644173286] [2023-08-03 17:46:00,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:46:00,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:46:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:46:01,030 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 17:46:01,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:46:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644173286] [2023-08-03 17:46:01,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644173286] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:46:01,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36291194] [2023-08-03 17:46:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:46:01,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:46:01,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:46:01,032 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 17:46:01,035 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 17:46:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:46:01,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:46:01,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:46:01,165 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 17:46:01,165 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:46:01,186 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 17:46:01,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36291194] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:46:01,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:46:01,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-03 17:46:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566779516] [2023-08-03 17:46:01,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:46:01,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-03 17:46:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:46:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-03 17:46:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-03 17:46:01,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 266 [2023-08-03 17:46:01,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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 17:46:01,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:46:01,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 266 [2023-08-03 17:46:01,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:46:21,469 INFO L124 PetriNetUnfolderBase]: 202594/264263 cut-off events. [2023-08-03 17:46:21,469 INFO L125 PetriNetUnfolderBase]: For 3009/3009 co-relation queries the response was YES. [2023-08-03 17:46:22,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521866 conditions, 264263 events. 202594/264263 cut-off events. For 3009/3009 co-relation queries the response was YES. Maximal size of possible extension queue 7842. Compared 1753560 event pairs, 135108 based on Foata normal form. 3/229336 useless extension candidates. Maximal degree in co-relation 185180. Up to 253192 conditions per place. [2023-08-03 17:46:23,097 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 45 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-03 17:46:23,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 59 transitions, 272 flow [2023-08-03 17:46:23,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:46:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:46:23,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-03 17:46:23,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112781954887218 [2023-08-03 17:46:23,099 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-03 17:46:23,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-03 17:46:23,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:46:23,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-03 17:46:23,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states 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 17:46:23,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states 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 17:46:23,103 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states 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 17:46:23,103 INFO L175 Difference]: Start difference. First operand has 72 places, 53 transitions, 170 flow. Second operand 4 states and 544 transitions. [2023-08-03 17:46:23,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 59 transitions, 272 flow [2023-08-03 17:46:23,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 59 transitions, 267 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-03 17:46:23,105 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 161 flow [2023-08-03 17:46:23,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-08-03 17:46:23,106 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2023-08-03 17:46:23,106 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 161 flow [2023-08-03 17:46:23,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states 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 17:46:23,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:46:23,107 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:46:23,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 17:46:23,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-03 17:46:23,313 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:46:23,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:46:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1077283794, now seen corresponding path program 1 times [2023-08-03 17:46:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:46:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596968625] [2023-08-03 17:46:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:46:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:46:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:46:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:46:23,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:46:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596968625] [2023-08-03 17:46:23,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596968625] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:46:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592699840] [2023-08-03 17:46:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:46:23,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:46:23,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:46:23,373 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 17:46:23,380 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 17:46:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:46:23,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:46:23,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:46:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:46:23,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:46:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:46:23,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592699840] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:46:23,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:46:23,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-03 17:46:23,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154980790] [2023-08-03 17:46:23,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:46:23,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:46:23,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:46:23,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:46:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:46:23,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 266 [2023-08-03 17:46:23,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states 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 17:46:23,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:46:23,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 266 [2023-08-03 17:46:23,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:46:40,041 INFO L124 PetriNetUnfolderBase]: 168352/217930 cut-off events. [2023-08-03 17:46:40,041 INFO L125 PetriNetUnfolderBase]: For 2203/2203 co-relation queries the response was YES. [2023-08-03 17:46:40,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430503 conditions, 217930 events. 168352/217930 cut-off events. For 2203/2203 co-relation queries the response was YES. Maximal size of possible extension queue 7203. Compared 1412883 event pairs, 107266 based on Foata normal form. 36/190020 useless extension candidates. Maximal degree in co-relation 152500. Up to 207628 conditions per place. [2023-08-03 17:46:41,216 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 56 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-03 17:46:41,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 319 flow [2023-08-03 17:46:41,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:46:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:46:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-08-03 17:46:41,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225563909774437 [2023-08-03 17:46:41,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-08-03 17:46:41,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-08-03 17:46:41,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:46:41,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-08-03 17:46:41,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 17:46:41,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states 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 17:46:41,221 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states 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 17:46:41,221 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 161 flow. Second operand 4 states and 556 transitions. [2023-08-03 17:46:41,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 319 flow [2023-08-03 17:46:41,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 313 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:46:41,224 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 175 flow [2023-08-03 17:46:41,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2023-08-03 17:46:41,224 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2023-08-03 17:46:41,225 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 175 flow [2023-08-03 17:46:41,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 states 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 17:46:41,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:46:41,225 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:46:41,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-03 17:46:41,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:46:41,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:46:41,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:46:41,427 INFO L85 PathProgramCache]: Analyzing trace with hash 31461104, now seen corresponding path program 1 times [2023-08-03 17:46:41,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:46:41,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142110409] [2023-08-03 17:46:41,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:46:41,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:46:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:46:41,503 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 17:46:41,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:46:41,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142110409] [2023-08-03 17:46:41,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142110409] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:46:41,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543759262] [2023-08-03 17:46:41,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:46:41,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:46:41,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:46:41,505 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 17:46:41,508 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 17:46:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:46:41,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:46:41,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:46:41,620 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 17:46:41,620 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:46:41,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543759262] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:46:41,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:46:41,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-03 17:46:41,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270188598] [2023-08-03 17:46:41,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:46:41,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:46:41,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:46:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:46:41,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:46:41,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 266 [2023-08-03 17:46:41,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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 17:46:41,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:46:41,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 266 [2023-08-03 17:46:41,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:46:58,079 INFO L124 PetriNetUnfolderBase]: 167944/217162 cut-off events. [2023-08-03 17:46:58,079 INFO L125 PetriNetUnfolderBase]: For 3097/3097 co-relation queries the response was YES. [2023-08-03 17:46:58,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429666 conditions, 217162 events. 167944/217162 cut-off events. For 3097/3097 co-relation queries the response was YES. Maximal size of possible extension queue 7193. Compared 1388357 event pairs, 53590 based on Foata normal form. 144/189504 useless extension candidates. Maximal degree in co-relation 152190. Up to 207576 conditions per place. [2023-08-03 17:46:59,259 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 60 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-03 17:46:59,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 337 flow [2023-08-03 17:46:59,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:46:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:46:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2023-08-03 17:46:59,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135338345864662 [2023-08-03 17:46:59,262 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2023-08-03 17:46:59,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2023-08-03 17:46:59,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:46:59,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2023-08-03 17:46:59,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 17:46:59,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 17:46:59,266 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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 17:46:59,266 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 175 flow. Second operand 5 states and 683 transitions. [2023-08-03 17:46:59,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 337 flow [2023-08-03 17:46:59,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 73 transitions, 330 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:46:59,269 INFO L231 Difference]: Finished difference. Result has 75 places, 51 transitions, 164 flow [2023-08-03 17:46:59,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=75, PETRI_TRANSITIONS=51} [2023-08-03 17:46:59,270 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2023-08-03 17:46:59,270 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 51 transitions, 164 flow [2023-08-03 17:46:59,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.6) internal successors, (633), 5 states have internal predecessors, (633), 0 states have call successors, (0), 0 states 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 17:46:59,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:46:59,271 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:46:59,283 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 17:46:59,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:46:59,481 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:46:59,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:46:59,481 INFO L85 PathProgramCache]: Analyzing trace with hash 169145952, now seen corresponding path program 1 times [2023-08-03 17:46:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:46:59,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549411540] [2023-08-03 17:46:59,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:46:59,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:46:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:46:59,649 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:46:59,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:46:59,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549411540] [2023-08-03 17:46:59,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549411540] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:46:59,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:46:59,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:46:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111591881] [2023-08-03 17:46:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:46:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:46:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:46:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:46:59,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:46:59,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 266 [2023-08-03 17:46:59,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 51 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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 17:46:59,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:46:59,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 266 [2023-08-03 17:46:59,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:47:13,154 INFO L124 PetriNetUnfolderBase]: 144616/188263 cut-off events. [2023-08-03 17:47:13,154 INFO L125 PetriNetUnfolderBase]: For 3070/3070 co-relation queries the response was YES. [2023-08-03 17:47:13,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371282 conditions, 188263 events. 144616/188263 cut-off events. For 3070/3070 co-relation queries the response was YES. Maximal size of possible extension queue 6422. Compared 1207843 event pairs, 24520 based on Foata normal form. 0/167517 useless extension candidates. Maximal degree in co-relation 131577. Up to 164161 conditions per place. [2023-08-03 17:47:14,305 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 59 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-03 17:47:14,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 335 flow [2023-08-03 17:47:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:47:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:47:14,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-03 17:47:14,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5588972431077694 [2023-08-03 17:47:14,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-03 17:47:14,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-03 17:47:14,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:47:14,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-03 17:47:14,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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 17:47:14,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 17:47:14,313 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 17:47:14,313 INFO L175 Difference]: Start difference. First operand has 75 places, 51 transitions, 164 flow. Second operand 3 states and 446 transitions. [2023-08-03 17:47:14,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 335 flow [2023-08-03 17:47:14,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 72 transitions, 330 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:47:14,316 INFO L231 Difference]: Finished difference. Result has 75 places, 53 transitions, 180 flow [2023-08-03 17:47:14,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=75, PETRI_TRANSITIONS=53} [2023-08-03 17:47:14,317 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places. [2023-08-03 17:47:14,317 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 53 transitions, 180 flow [2023-08-03 17:47:14,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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 17:47:14,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:14,317 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:47:14,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-03 17:47:14,317 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:47:14,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:14,318 INFO L85 PathProgramCache]: Analyzing trace with hash 948383674, now seen corresponding path program 1 times [2023-08-03 17:47:14,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:14,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837197729] [2023-08-03 17:47:14,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:14,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:47:14,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-03 17:47:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:47:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837197729] [2023-08-03 17:47:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837197729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:47:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:47:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:47:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518117315] [2023-08-03 17:47:14,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:47:14,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:47:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:47:14,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:47:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:47:14,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 266 [2023-08-03 17:47:14,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 53 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 17:47:14,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:47:14,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 266 [2023-08-03 17:47:14,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:47:29,634 INFO L124 PetriNetUnfolderBase]: 142168/182071 cut-off events. [2023-08-03 17:47:29,634 INFO L125 PetriNetUnfolderBase]: For 11680/11680 co-relation queries the response was YES. [2023-08-03 17:47:30,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385495 conditions, 182071 events. 142168/182071 cut-off events. For 11680/11680 co-relation queries the response was YES. Maximal size of possible extension queue 6274. Compared 1131098 event pairs, 118120 based on Foata normal form. 0/162909 useless extension candidates. Maximal degree in co-relation 136122. Up to 173284 conditions per place. [2023-08-03 17:47:31,266 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 56 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-03 17:47:31,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 68 transitions, 329 flow [2023-08-03 17:47:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:47:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:47:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-03 17:47:31,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401002506265664 [2023-08-03 17:47:31,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-03 17:47:31,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-03 17:47:31,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:47:31,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-03 17:47:31,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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 17:47:31,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 17:47:31,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 17:47:31,281 INFO L175 Difference]: Start difference. First operand has 75 places, 53 transitions, 180 flow. Second operand 3 states and 431 transitions. [2023-08-03 17:47:31,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 68 transitions, 329 flow [2023-08-03 17:47:31,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 68 transitions, 325 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:47:31,290 INFO L231 Difference]: Finished difference. Result has 77 places, 54 transitions, 191 flow [2023-08-03 17:47:31,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2023-08-03 17:47:31,293 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places. [2023-08-03 17:47:31,293 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 54 transitions, 191 flow [2023-08-03 17:47:31,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 17:47:31,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:31,294 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:47:31,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-03 17:47:31,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:47:31,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash 866533531, now seen corresponding path program 1 times [2023-08-03 17:47:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:31,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829908003] [2023-08-03 17:47:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:47:31,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:47:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:47:31,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:47:31,459 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:47:31,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:47:31,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:47:31,459 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:47:31,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:47:31,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:47:31,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:47:31,460 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:47:31,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-03 17:47:31,460 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:47:31,465 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:47:31,465 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:47:31,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:47:31 BasicIcfg [2023-08-03 17:47:31,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:47:31,604 INFO L158 Benchmark]: Toolchain (without parser) took 189906.70ms. Allocated memory was 369.1MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 313.0MB in the beginning and 14.3GB in the end (delta: -14.0GB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2023-08-03 17:47:31,604 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 369.1MB. Free memory is still 321.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:47:31,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 550.29ms. Allocated memory is still 369.1MB. Free memory was 312.7MB in the beginning and 289.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 17:47:31,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.44ms. Allocated memory is still 369.1MB. Free memory was 289.5MB in the beginning and 286.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-03 17:47:31,605 INFO L158 Benchmark]: Boogie Preprocessor took 57.38ms. Allocated memory is still 369.1MB. Free memory was 286.8MB in the beginning and 284.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:47:31,605 INFO L158 Benchmark]: RCFGBuilder took 579.01ms. Allocated memory was 369.1MB in the beginning and 673.2MB in the end (delta: 304.1MB). Free memory was 284.7MB in the beginning and 609.6MB in the end (delta: -325.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. [2023-08-03 17:47:31,606 INFO L158 Benchmark]: TraceAbstraction took 188638.71ms. Allocated memory was 673.2MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 609.0MB in the beginning and 14.3GB in the end (delta: -13.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2023-08-03 17:47:31,607 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.11ms. Allocated memory is still 369.1MB. Free memory is still 321.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 550.29ms. Allocated memory is still 369.1MB. Free memory was 312.7MB in the beginning and 289.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.44ms. Allocated memory is still 369.1MB. Free memory was 289.5MB in the beginning and 286.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 57.38ms. Allocated memory is still 369.1MB. Free memory was 286.8MB in the beginning and 284.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 579.01ms. Allocated memory was 369.1MB in the beginning and 673.2MB in the end (delta: 304.1MB). Free memory was 284.7MB in the beginning and 609.6MB in the end (delta: -325.0MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. * TraceAbstraction took 188638.71ms. Allocated memory was 673.2MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 609.0MB in the beginning and 14.3GB in the end (delta: -13.7GB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 129 PlacesBefore, 40 PlacesAfterwards, 127 TransitionsBefore, 34 TransitionsAfterwards, 2500 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 107 TotalNumberOfCompositions, 5920 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2709, independent: 2556, independent conditional: 0, independent unconditional: 2556, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1257, independent: 1229, independent conditional: 0, independent unconditional: 1229, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2709, independent: 1327, independent conditional: 0, independent unconditional: 1327, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 1257, unknown conditional: 0, unknown unconditional: 1257] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 159 PlacesBefore, 64 PlacesAfterwards, 151 TransitionsBefore, 52 TransitionsAfterwards, 6000 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 115 TotalNumberOfCompositions, 16589 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7925, independent: 7664, independent conditional: 0, independent unconditional: 7664, dependent: 261, dependent conditional: 0, dependent unconditional: 261, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3064, independent: 3018, independent conditional: 0, independent unconditional: 3018, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7925, independent: 4646, independent conditional: 0, independent unconditional: 4646, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 3064, unknown conditional: 0, unknown unconditional: 3064] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 385, Positive conditional cache size: 0, Positive unconditional cache size: 385, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1492[2]; [L814] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L814] COND TRUE 0 asdf<2 [L814] FCALL, FORK 0 pthread_create(&t1492[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492[asdf], ((void *)0), P0, ((void *)0))=-5, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L814] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L814] COND TRUE 0 asdf<2 [L814] FCALL, FORK 0 pthread_create(&t1492[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1492[asdf], ((void *)0), P0, ((void *)0))=-4, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L814] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L814] COND FALSE 0 !(asdf<2) [L815] 0 pthread_t t1493[2]; [L816] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t1493[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493[asdf], ((void *)0), P1, ((void *)0))=-3, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND TRUE 0 asdf<2 [L816] FCALL, FORK 0 pthread_create(&t1493[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1493[asdf], ((void *)0), P1, ((void *)0))=-2, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L816] COND FALSE 0 !(asdf<2) [L817] 0 pthread_t t1494[2]; [L818] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] COND TRUE 0 asdf<2 [L818] FCALL, FORK 0 pthread_create(&t1494[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494[asdf], ((void *)0), P2, ((void *)0))=-1, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 5 y$w_buff1 = y$w_buff0 [L777] 5 y$w_buff0 = 2 [L778] 5 y$w_buff1_used = y$w_buff0_used [L779] 5 y$w_buff0_used = (_Bool)1 [L780] CALL 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L780] RET 5 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L781] 5 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 5 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 5 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 5 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 5 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L818] COND TRUE 0 asdf<2 [L818] FCALL, FORK 0 pthread_create(&t1494[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1494[asdf], ((void *)0), P2, ((void *)0))=0, t1492={5:0}, t1493={6:0}, t1494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L776] 6 y$w_buff1 = y$w_buff0 [L777] 6 y$w_buff0 = 2 [L778] 6 y$w_buff1_used = y$w_buff0_used [L779] 6 y$w_buff0_used = (_Bool)1 [L780] CALL 6 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=2, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: 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: 818]: 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: 816]: 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, 147 locations, 6 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: 4.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 64 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=89occurred 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.1s 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, 171 locations, 7 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: 183.8s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 177.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 227 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 801 IncrementalHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 9 mSDtfsCounter, 801 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=8, InterpolantAutomatonStates: 30, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 460 SizeOfPredicates, 0 NumberOfNonLiveVariables, 738 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 77/89 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 17:47:31,634 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...