/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 00:24:42,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 00:24:42,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 00:24:42,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 00:24:42,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 00:24:42,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 00:24:42,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 00:24:42,393 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 00:24:42,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 00:24:42,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 00:24:42,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 00:24:42,394 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 00:24:42,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 00:24:42,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 00:24:42,395 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 00:24:42,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 00:24:42,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 00:24:42,396 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 00:24:42,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 00:24:42,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 00:24:42,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 00:24:42,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 00:24:42,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 00:24:42,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 00:24:42,401 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 00:24:42,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 00:24:42,402 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 00:24:42,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 00:24:42,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 00:24:42,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 00:24:42,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:24:42,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 00:24:42,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 00:24:42,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 00:24:42,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 00:24:42,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 00:24:42,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 00:24:42,405 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 00:24:42,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 00:24:42,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 00:24:42,406 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 00:24:42,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 00:24:42,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 00:24:42,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 00:24:42,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 00:24:42,648 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 00:24:42,648 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 00:24:42,649 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i [2023-08-04 00:24:43,749 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 00:24:43,947 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 00:24:43,948 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i [2023-08-04 00:24:43,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7cc0601c/e2b6c4a6f4b242778d0a9f5c4ae5a078/FLAG4aa071c45 [2023-08-04 00:24:43,972 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7cc0601c/e2b6c4a6f4b242778d0a9f5c4ae5a078 [2023-08-04 00:24:43,974 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 00:24:43,975 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 00:24:43,976 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 00:24:43,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 00:24:43,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 00:24:43,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:24:43" (1/1) ... [2023-08-04 00:24:43,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203e715a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:43, skipping insertion in model container [2023-08-04 00:24:43,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:24:43" (1/1) ... [2023-08-04 00:24:44,026 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 00:24:44,179 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i[1009,1022] [2023-08-04 00:24:44,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:24:44,390 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 00:24:44,401 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i[1009,1022] [2023-08-04 00:24:44,420 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 00:24:44,422 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 00:24:44,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:24:44,493 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:24:44,493 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:24:44,499 INFO L206 MainTranslator]: Completed translation [2023-08-04 00:24:44,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44 WrapperNode [2023-08-04 00:24:44,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 00:24:44,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 00:24:44,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 00:24:44,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 00:24:44,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,543 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2023-08-04 00:24:44,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 00:24:44,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 00:24:44,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 00:24:44,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 00:24:44,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 00:24:44,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 00:24:44,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 00:24:44,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 00:24:44,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (1/1) ... [2023-08-04 00:24:44,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:24:44,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:24:44,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 00:24:44,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 00:24:44,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 00:24:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 00:24:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 00:24:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 00:24:44,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 00:24:44,680 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 00:24:44,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 00:24:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 00:24:44,681 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 00:24:44,681 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 00:24:44,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 00:24:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 00:24:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 00:24:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 00:24:44,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 00:24:44,683 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 00:24:44,813 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 00:24:44,814 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 00:24:45,036 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 00:24:45,127 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 00:24:45,127 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 00:24:45,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:24:45 BoogieIcfgContainer [2023-08-04 00:24:45,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 00:24:45,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 00:24:45,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 00:24:45,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 00:24:45,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 12:24:43" (1/3) ... [2023-08-04 00:24:45,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36035d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:24:45, skipping insertion in model container [2023-08-04 00:24:45,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:24:44" (2/3) ... [2023-08-04 00:24:45,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36035d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:24:45, skipping insertion in model container [2023-08-04 00:24:45,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:24:45" (3/3) ... [2023-08-04 00:24:45,141 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe012_pso.oepc_pso.opt_rmo.opt_bound2.i [2023-08-04 00:24:45,148 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 00:24:45,156 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 00:24:45,156 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 00:24:45,156 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 00:24:45,214 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:24:45,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 00:24:45,410 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-04 00:24:45,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:24:45,418 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 1963 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 270. Up to 16 conditions per place. [2023-08-04 00:24:45,419 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 00:24:45,423 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 100 transitions, 215 flow [2023-08-04 00:24:45,427 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:24:45,434 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 100 transitions, 215 flow [2023-08-04 00:24:45,437 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 100 transitions, 215 flow [2023-08-04 00:24:45,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 215 flow [2023-08-04 00:24:45,462 INFO L124 PetriNetUnfolderBase]: 6/217 cut-off events. [2023-08-04 00:24:45,463 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:24:45,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 217 events. 6/217 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 633 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. [2023-08-04 00:24:45,465 INFO L119 LiptonReduction]: Number of co-enabled transitions 1312 [2023-08-04 00:24:48,325 INFO L134 LiptonReduction]: Checked pairs total: 3162 [2023-08-04 00:24:48,325 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-08-04 00:24:48,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:24:48,342 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;@74c73355, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:24:48,342 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 00:24:48,347 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:24:48,347 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 00:24:48,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:24:48,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:24:48,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 00:24:48,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:24:48,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:24:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1723710991, now seen corresponding path program 1 times [2023-08-04 00:24:48,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:24:48,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797034614] [2023-08-04 00:24:48,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:24:48,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:24:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:24:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:24:48,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:24:48,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797034614] [2023-08-04 00:24:48,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797034614] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:24:48,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:24:48,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:24:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213207756] [2023-08-04 00:24:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:24:48,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:24:48,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:24:48,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:24:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:24:48,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 209 [2023-08-04 00:24:48,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:24:48,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:24:48,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 209 [2023-08-04 00:24:48,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:24:48,811 INFO L124 PetriNetUnfolderBase]: 467/849 cut-off events. [2023-08-04 00:24:48,811 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 00:24:48,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1717 conditions, 849 events. 467/849 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4129 event pairs, 248 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1696. Up to 760 conditions per place. [2023-08-04 00:24:48,821 INFO L140 encePairwiseOnDemand]: 206/209 looper letters, 23 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 00:24:48,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 125 flow [2023-08-04 00:24:48,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:24:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:24:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2023-08-04 00:24:48,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5677830940988836 [2023-08-04 00:24:48,841 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2023-08-04 00:24:48,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2023-08-04 00:24:48,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:24:48,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2023-08-04 00:24:48,851 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-04 00:24:48,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:24:48,856 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:24:48,858 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 67 flow. Second operand 3 states and 356 transitions. [2023-08-04 00:24:48,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 125 flow [2023-08-04 00:24:48,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 125 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:24:48,862 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-04 00:24:48,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-04 00:24:48,867 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-04 00:24:48,867 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-04 00:24:48,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:24:48,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:24:48,868 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 00:24:48,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 00:24:48,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:24:48,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:24:48,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1728649134, now seen corresponding path program 1 times [2023-08-04 00:24:48,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:24:48,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580786137] [2023-08-04 00:24:48,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:24:48,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:24:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:24:48,911 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:24:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:24:48,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:24:48,947 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:24:48,949 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 00:24:48,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 00:24:48,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 00:24:48,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 00:24:48,951 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 00:24:48,953 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (1/2) [2023-08-04 00:24:48,954 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 00:24:48,954 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 00:24:48,986 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:24:48,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 00:24:49,149 INFO L124 PetriNetUnfolderBase]: 93/1380 cut-off events. [2023-08-04 00:24:49,149 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:24:49,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 1380 events. 93/1380 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9496 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 1003. Up to 54 conditions per place. [2023-08-04 00:24:49,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 00:24:49,157 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 284 flow [2023-08-04 00:24:49,157 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:24:49,157 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 284 flow [2023-08-04 00:24:49,158 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 284 flow [2023-08-04 00:24:49,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 284 flow [2023-08-04 00:24:49,223 INFO L124 PetriNetUnfolderBase]: 12/597 cut-off events. [2023-08-04 00:24:49,223 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:24:49,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 597 events. 12/597 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3060 event pairs, 0 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 481. Up to 27 conditions per place. [2023-08-04 00:24:49,233 INFO L119 LiptonReduction]: Number of co-enabled transitions 3628 [2023-08-04 00:24:52,057 INFO L134 LiptonReduction]: Checked pairs total: 10959 [2023-08-04 00:24:52,057 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-04 00:24:52,059 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:24:52,060 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;@74c73355, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:24:52,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 00:24:52,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:24:52,068 INFO L124 PetriNetUnfolderBase]: 0/67 cut-off events. [2023-08-04 00:24:52,068 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 00:24:52,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:24:52,068 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 00:24:52,069 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:24:52,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:24:52,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1504714040, now seen corresponding path program 1 times [2023-08-04 00:24:52,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:24:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908949694] [2023-08-04 00:24:52,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:24:52,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:24:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:24:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:24:52,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:24:52,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908949694] [2023-08-04 00:24:52,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908949694] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:24:52,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:24:52,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:24:52,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316389887] [2023-08-04 00:24:52,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:24:52,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:24:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:24:52,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:24:52,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:24:52,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 240 [2023-08-04 00:24:52,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 124 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-04 00:24:52,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:24:52,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 240 [2023-08-04 00:24:52,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:25:03,706 INFO L124 PetriNetUnfolderBase]: 99287/133674 cut-off events. [2023-08-04 00:25:03,706 INFO L125 PetriNetUnfolderBase]: For 8696/8696 co-relation queries the response was YES. [2023-08-04 00:25:04,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270573 conditions, 133674 events. 99287/133674 cut-off events. For 8696/8696 co-relation queries the response was YES. Maximal size of possible extension queue 4007. Compared 889870 event pairs, 78800 based on Foata normal form. 0/121525 useless extension candidates. Maximal degree in co-relation 62597. Up to 126604 conditions per place. [2023-08-04 00:25:04,561 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-04 00:25:04,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 212 flow [2023-08-04 00:25:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:25:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:25:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-04 00:25:04,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5805555555555556 [2023-08-04 00:25:04,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-04 00:25:04,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-04 00:25:04,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:25:04,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-04 00:25:04,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:04,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:04,571 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:04,571 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 124 flow. Second operand 3 states and 418 transitions. [2023-08-04 00:25:04,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 212 flow [2023-08-04 00:25:04,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 206 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 00:25:04,584 INFO L231 Difference]: Finished difference. Result has 60 places, 45 transitions, 130 flow [2023-08-04 00:25:04,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=60, PETRI_TRANSITIONS=45} [2023-08-04 00:25:04,585 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2023-08-04 00:25:04,585 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 45 transitions, 130 flow [2023-08-04 00:25:04,585 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-04 00:25:04,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:25:04,586 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 00:25:04,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 00:25:04,586 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:25:04,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:25:04,587 INFO L85 PathProgramCache]: Analyzing trace with hash 377939135, now seen corresponding path program 1 times [2023-08-04 00:25:04,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:25:04,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301333860] [2023-08-04 00:25:04,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:04,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:25:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:25:04,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:25:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301333860] [2023-08-04 00:25:04,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301333860] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:25:04,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973503023] [2023-08-04 00:25:04,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:04,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:04,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:25:04,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:25:04,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 00:25:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:04,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:25:04,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:25:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:25:04,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:25:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973503023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:25:04,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:25:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:25:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464376959] [2023-08-04 00:25:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:25:04,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:25:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:25:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:25:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:25:04,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 240 [2023-08-04 00:25:04,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 45 transitions, 130 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-04 00:25:04,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:25:04,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 240 [2023-08-04 00:25:04,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:25:15,746 INFO L124 PetriNetUnfolderBase]: 99263/133794 cut-off events. [2023-08-04 00:25:15,747 INFO L125 PetriNetUnfolderBase]: For 7984/7984 co-relation queries the response was YES. [2023-08-04 00:25:16,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270072 conditions, 133794 events. 99263/133794 cut-off events. For 7984/7984 co-relation queries the response was YES. Maximal size of possible extension queue 4007. Compared 893057 event pairs, 62420 based on Foata normal form. 16/121669 useless extension candidates. Maximal degree in co-relation 70920. Up to 126521 conditions per place. [2023-08-04 00:25:16,525 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 42 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2023-08-04 00:25:16,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 242 flow [2023-08-04 00:25:16,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:25:16,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:25:16,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-08-04 00:25:16,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.56 [2023-08-04 00:25:16,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-08-04 00:25:16,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-08-04 00:25:16,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:25:16,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-08-04 00:25:16,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:16,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:16,532 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:16,532 INFO L175 Difference]: Start difference. First operand has 60 places, 45 transitions, 130 flow. Second operand 5 states and 672 transitions. [2023-08-04 00:25:16,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 242 flow [2023-08-04 00:25:16,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 00:25:16,535 INFO L231 Difference]: Finished difference. Result has 63 places, 45 transitions, 144 flow [2023-08-04 00:25:16,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=63, PETRI_TRANSITIONS=45} [2023-08-04 00:25:16,536 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2023-08-04 00:25:16,536 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 45 transitions, 144 flow [2023-08-04 00:25:16,537 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-04 00:25:16,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:25:16,537 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:25:16,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 00:25:16,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:16,741 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:25:16,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:25:16,742 INFO L85 PathProgramCache]: Analyzing trace with hash -806578897, now seen corresponding path program 1 times [2023-08-04 00:25:16,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:25:16,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871688037] [2023-08-04 00:25:16,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:16,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:25:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:25:16,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:25:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871688037] [2023-08-04 00:25:16,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871688037] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:25:16,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164170251] [2023-08-04 00:25:16,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:16,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:16,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:25:16,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:25:16,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 00:25:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:16,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:25:16,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:25:16,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:25:16,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:25:16,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164170251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:25:16,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:25:16,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:25:16,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312560051] [2023-08-04 00:25:16,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:25:16,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:25:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:25:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:25:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:25:16,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 240 [2023-08-04 00:25:16,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 45 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:16,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:25:16,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 240 [2023-08-04 00:25:16,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:25:27,524 INFO L124 PetriNetUnfolderBase]: 97376/133707 cut-off events. [2023-08-04 00:25:27,524 INFO L125 PetriNetUnfolderBase]: For 7480/7480 co-relation queries the response was YES. [2023-08-04 00:25:27,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268041 conditions, 133707 events. 97376/133707 cut-off events. For 7480/7480 co-relation queries the response was YES. Maximal size of possible extension queue 4215. Compared 930388 event pairs, 76147 based on Foata normal form. 0/122786 useless extension candidates. Maximal degree in co-relation 61770. Up to 123534 conditions per place. [2023-08-04 00:25:28,449 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 45 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-04 00:25:28,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 264 flow [2023-08-04 00:25:28,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:25:28,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:25:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-04 00:25:28,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2023-08-04 00:25:28,451 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-04 00:25:28,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-04 00:25:28,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:25:28,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-04 00:25:28,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:28,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:28,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 240.0) internal successors, (960), 4 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:28,455 INFO L175 Difference]: Start difference. First operand has 63 places, 45 transitions, 144 flow. Second operand 3 states and 425 transitions. [2023-08-04 00:25:28,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 264 flow [2023-08-04 00:25:28,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 57 transitions, 257 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 00:25:28,459 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 152 flow [2023-08-04 00:25:28,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2023-08-04 00:25:28,460 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2023-08-04 00:25:28,460 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 152 flow [2023-08-04 00:25:28,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:28,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:25:28,460 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:25:28,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 00:25:28,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:28,665 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:25:28,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:25:28,666 INFO L85 PathProgramCache]: Analyzing trace with hash 291538499, now seen corresponding path program 1 times [2023-08-04 00:25:28,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:25:28,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224235698] [2023-08-04 00:25:28,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:28,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:25:28,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:25:28,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:25:28,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224235698] [2023-08-04 00:25:28,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224235698] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:25:28,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364906894] [2023-08-04 00:25:28,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:28,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:28,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:25:28,728 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:25:28,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 00:25:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:28,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:25:28,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:25:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:25:28,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:25:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 00:25:28,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364906894] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:25:28,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:25:28,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:25:28,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730822635] [2023-08-04 00:25:28,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:25:28,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:25:28,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:25:28,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:25:28,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:25:28,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 240 [2023-08-04 00:25:28,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:28,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:25:28,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 240 [2023-08-04 00:25:28,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:25:37,327 INFO L124 PetriNetUnfolderBase]: 81082/110157 cut-off events. [2023-08-04 00:25:37,327 INFO L125 PetriNetUnfolderBase]: For 7000/7000 co-relation queries the response was YES. [2023-08-04 00:25:37,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221853 conditions, 110157 events. 81082/110157 cut-off events. For 7000/7000 co-relation queries the response was YES. Maximal size of possible extension queue 3697. Compared 735374 event pairs, 49312 based on Foata normal form. 4/101904 useless extension candidates. Maximal degree in co-relation 58089. Up to 102233 conditions per place. [2023-08-04 00:25:37,956 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 43 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-04 00:25:37,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 257 flow [2023-08-04 00:25:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:25:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:25:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-08-04 00:25:37,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.56875 [2023-08-04 00:25:37,959 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-08-04 00:25:37,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-08-04 00:25:37,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:25:37,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-08-04 00:25:37,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:37,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:37,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:37,968 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 152 flow. Second operand 4 states and 546 transitions. [2023-08-04 00:25:37,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 257 flow [2023-08-04 00:25:37,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:25:37,971 INFO L231 Difference]: Finished difference. Result has 66 places, 45 transitions, 147 flow [2023-08-04 00:25:37,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=66, PETRI_TRANSITIONS=45} [2023-08-04 00:25:37,972 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-08-04 00:25:37,972 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 45 transitions, 147 flow [2023-08-04 00:25:37,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:37,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:25:37,973 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:25:37,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 00:25:38,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:38,174 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:25:38,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:25:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash -601312615, now seen corresponding path program 1 times [2023-08-04 00:25:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:25:38,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112456138] [2023-08-04 00:25:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:25:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:38,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:25:38,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:25:38,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112456138] [2023-08-04 00:25:38,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112456138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:25:38,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278224272] [2023-08-04 00:25:38,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:38,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:38,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:25:38,253 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:25:38,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 00:25:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:38,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:25:38,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:25:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:25:38,375 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:25:38,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278224272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:25:38,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:25:38,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 00:25:38,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092794166] [2023-08-04 00:25:38,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:25:38,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:25:38,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:25:38,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:25:38,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:25:38,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 240 [2023-08-04 00:25:38,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 45 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:38,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:25:38,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 240 [2023-08-04 00:25:38,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:25:46,801 INFO L124 PetriNetUnfolderBase]: 79842/108997 cut-off events. [2023-08-04 00:25:46,801 INFO L125 PetriNetUnfolderBase]: For 5562/5562 co-relation queries the response was YES. [2023-08-04 00:25:47,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219170 conditions, 108997 events. 79842/108997 cut-off events. For 5562/5562 co-relation queries the response was YES. Maximal size of possible extension queue 3747. Compared 737622 event pairs, 18762 based on Foata normal form. 400/101300 useless extension candidates. Maximal degree in co-relation 57367. Up to 98424 conditions per place. [2023-08-04 00:25:47,409 INFO L140 encePairwiseOnDemand]: 236/240 looper letters, 64 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2023-08-04 00:25:47,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 76 transitions, 345 flow [2023-08-04 00:25:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:25:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:25:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 693 transitions. [2023-08-04 00:25:47,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5775 [2023-08-04 00:25:47,411 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 693 transitions. [2023-08-04 00:25:47,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 693 transitions. [2023-08-04 00:25:47,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:25:47,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 693 transitions. [2023-08-04 00:25:47,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:47,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:47,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 240.0) internal successors, (1440), 6 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:47,415 INFO L175 Difference]: Start difference. First operand has 66 places, 45 transitions, 147 flow. Second operand 5 states and 693 transitions. [2023-08-04 00:25:47,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 76 transitions, 345 flow [2023-08-04 00:25:47,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 76 transitions, 338 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 00:25:47,419 INFO L231 Difference]: Finished difference. Result has 67 places, 45 transitions, 157 flow [2023-08-04 00:25:47,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=67, PETRI_TRANSITIONS=45} [2023-08-04 00:25:47,420 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2023-08-04 00:25:47,420 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 45 transitions, 157 flow [2023-08-04 00:25:47,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.6) internal successors, (638), 5 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:47,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:25:47,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:25:47,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 00:25:47,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:47,627 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:25:47,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:25:47,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1219002958, now seen corresponding path program 1 times [2023-08-04 00:25:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:25:47,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173856951] [2023-08-04 00:25:47,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:47,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:25:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:25:47,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:25:47,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173856951] [2023-08-04 00:25:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173856951] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:25:47,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438379621] [2023-08-04 00:25:47,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:47,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:47,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:25:47,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:25:47,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 00:25:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:47,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:25:47,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:25:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:25:47,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:25:47,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 00:25:47,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438379621] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:25:47,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:25:47,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:25:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722516470] [2023-08-04 00:25:47,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:25:47,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:25:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:25:47,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:25:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:25:47,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 240 [2023-08-04 00:25:47,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 45 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:47,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:25:47,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 240 [2023-08-04 00:25:47,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:25:55,314 INFO L124 PetriNetUnfolderBase]: 69178/93693 cut-off events. [2023-08-04 00:25:55,314 INFO L125 PetriNetUnfolderBase]: For 7378/7378 co-relation queries the response was YES. [2023-08-04 00:25:55,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189854 conditions, 93693 events. 69178/93693 cut-off events. For 7378/7378 co-relation queries the response was YES. Maximal size of possible extension queue 3526. Compared 612086 event pairs, 40842 based on Foata normal form. 80/86412 useless extension candidates. Maximal degree in co-relation 49629. Up to 84569 conditions per place. [2023-08-04 00:25:55,833 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 58 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2023-08-04 00:25:55,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 323 flow [2023-08-04 00:25:55,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:25:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:25:55,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-08-04 00:25:55,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.584375 [2023-08-04 00:25:55,835 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-08-04 00:25:55,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-08-04 00:25:55,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:25:55,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-08-04 00:25:55,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:55,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:55,839 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:55,839 INFO L175 Difference]: Start difference. First operand has 67 places, 45 transitions, 157 flow. Second operand 4 states and 561 transitions. [2023-08-04 00:25:55,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 323 flow [2023-08-04 00:25:55,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 69 transitions, 318 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 00:25:55,843 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 150 flow [2023-08-04 00:25:55,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2023-08-04 00:25:55,844 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2023-08-04 00:25:55,844 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 150 flow [2023-08-04 00:25:55,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.4) internal successors, (642), 5 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:55,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:25:55,845 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:25:55,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 00:25:56,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:25:56,050 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 00:25:56,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:25:56,050 INFO L85 PathProgramCache]: Analyzing trace with hash 29012128, now seen corresponding path program 1 times [2023-08-04 00:25:56,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:25:56,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922210630] [2023-08-04 00:25:56,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:25:56,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:25:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:25:56,108 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:25:56,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:25:56,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922210630] [2023-08-04 00:25:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922210630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:25:56,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:25:56,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 00:25:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348269158] [2023-08-04 00:25:56,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:25:56,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:25:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:25:56,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:25:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:25:56,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 240 [2023-08-04 00:25:56,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:25:56,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:25:56,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 240 [2023-08-04 00:25:56,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:26:00,372 INFO L124 PetriNetUnfolderBase]: 39738/55149 cut-off events. [2023-08-04 00:26:00,373 INFO L125 PetriNetUnfolderBase]: For 5818/5818 co-relation queries the response was YES. [2023-08-04 00:26:00,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114350 conditions, 55149 events. 39738/55149 cut-off events. For 5818/5818 co-relation queries the response was YES. Maximal size of possible extension queue 2011. Compared 349618 event pairs, 2738 based on Foata normal form. 6400/56748 useless extension candidates. Maximal degree in co-relation 44257. Up to 38800 conditions per place. [2023-08-04 00:26:00,533 INFO L140 encePairwiseOnDemand]: 238/240 looper letters, 0 selfloop transitions, 0 changer transitions 74/74 dead transitions. [2023-08-04 00:26:00,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 74 transitions, 342 flow [2023-08-04 00:26:00,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:26:00,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:26:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-08-04 00:26:00,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2023-08-04 00:26:00,534 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-08-04 00:26:00,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-08-04 00:26:00,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:26:00,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-08-04 00:26:00,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:00,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:00,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 240.0) internal successors, (1200), 5 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:00,538 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 150 flow. Second operand 4 states and 570 transitions. [2023-08-04 00:26:00,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 74 transitions, 342 flow [2023-08-04 00:26:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 74 transitions, 335 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 00:26:01,142 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2023-08-04 00:26:01,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2023-08-04 00:26:01,143 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2023-08-04 00:26:01,143 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2023-08-04 00:26:01,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:01,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 00:26:01,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 00:26:01,143 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 00:26:01,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 00:26:01,144 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:26:01,144 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE,SAFE (1/2) [2023-08-04 00:26:01,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 00:26:01,245 INFO L124 PetriNetUnfolderBase]: 93/1380 cut-off events. [2023-08-04 00:26:01,245 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 00:26:01,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 1380 events. 93/1380 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9496 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 1003. Up to 54 conditions per place. [2023-08-04 00:26:01,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 00:26:01,251 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 152 transitions, 336 flow [2023-08-04 00:26:01,251 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:26:01,252 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 152 transitions, 336 flow [2023-08-04 00:26:01,252 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 152 transitions, 336 flow [2023-08-04 00:26:01,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 152 transitions, 336 flow [2023-08-04 00:26:01,349 INFO L124 PetriNetUnfolderBase]: 93/1379 cut-off events. [2023-08-04 00:26:01,350 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-04 00:26:01,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 1379 events. 93/1379 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9478 event pairs, 0 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 1000. Up to 54 conditions per place. [2023-08-04 00:26:01,375 INFO L119 LiptonReduction]: Number of co-enabled transitions 6040 [2023-08-04 00:26:04,291 INFO L134 LiptonReduction]: Checked pairs total: 18642 [2023-08-04 00:26:04,292 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-04 00:26:04,295 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 00:26:04,295 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;@74c73355, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:26:04,295 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 00:26:04,297 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:26:04,298 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-04 00:26:04,298 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:26:04,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:26:04,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 00:26:04,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:26:04,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:26:04,298 INFO L85 PathProgramCache]: Analyzing trace with hash 862894771, now seen corresponding path program 1 times [2023-08-04 00:26:04,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:26:04,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476030251] [2023-08-04 00:26:04,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:26:04,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:26:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:26:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:26:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:26:04,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476030251] [2023-08-04 00:26:04,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476030251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:26:04,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:26:04,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:26:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330481770] [2023-08-04 00:26:04,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:26:04,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:26:04,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:26:04,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:26:04,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:26:04,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2023-08-04 00:26:04,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:04,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:26:04,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2023-08-04 00:26:04,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:26:55,025 INFO L124 PetriNetUnfolderBase]: 468866/614485 cut-off events. [2023-08-04 00:26:55,025 INFO L125 PetriNetUnfolderBase]: For 9624/9624 co-relation queries the response was YES. [2023-08-04 00:26:56,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214135 conditions, 614485 events. 468866/614485 cut-off events. For 9624/9624 co-relation queries the response was YES. Maximal size of possible extension queue 14915. Compared 4313875 event pairs, 380024 based on Foata normal form. 13020/543893 useless extension candidates. Maximal degree in co-relation 261761. Up to 587323 conditions per place. [2023-08-04 00:26:58,291 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 44 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-04 00:26:58,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 55 transitions, 234 flow [2023-08-04 00:26:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:26:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:26:58,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-04 00:26:58,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5239852398523985 [2023-08-04 00:26:58,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-04 00:26:58,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-04 00:26:58,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:26:58,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-04 00:26:58,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:58,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:58,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:58,296 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 134 flow. Second operand 3 states and 426 transitions. [2023-08-04 00:26:58,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 55 transitions, 234 flow [2023-08-04 00:26:58,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 55 transitions, 230 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 00:26:58,307 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 140 flow [2023-08-04 00:26:58,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-08-04 00:26:58,307 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2023-08-04 00:26:58,308 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 140 flow [2023-08-04 00:26:58,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:26:58,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:26:58,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:26:58,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 00:26:58,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:26:58,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:26:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1928785991, now seen corresponding path program 1 times [2023-08-04 00:26:58,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:26:58,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074794505] [2023-08-04 00:26:58,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:26:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:26:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:26:58,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:26:58,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:26:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074794505] [2023-08-04 00:26:58,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074794505] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:26:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371804849] [2023-08-04 00:26:58,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:26:58,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:26:58,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:26:58,349 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:26:58,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 00:26:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:26:58,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:26:58,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:26:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:26:58,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:26:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:26:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371804849] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:26:58,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:26:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:26:58,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686419803] [2023-08-04 00:26:58,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:26:58,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:26:58,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:26:58,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:26:58,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:26:58,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 271 [2023-08-04 00:26:58,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 140 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-04 00:26:58,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:26:58,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 271 [2023-08-04 00:26:58,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:27:37,183 INFO L124 PetriNetUnfolderBase]: 389314/505877 cut-off events. [2023-08-04 00:27:37,183 INFO L125 PetriNetUnfolderBase]: For 6296/6296 co-relation queries the response was YES. [2023-08-04 00:27:38,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998566 conditions, 505877 events. 389314/505877 cut-off events. For 6296/6296 co-relation queries the response was YES. Maximal size of possible extension queue 12810. Compared 3409670 event pairs, 247180 based on Foata normal form. 4/439209 useless extension candidates. Maximal degree in co-relation 261478. Up to 484009 conditions per place. [2023-08-04 00:27:40,720 INFO L140 encePairwiseOnDemand]: 267/271 looper letters, 49 selfloop transitions, 3 changer transitions 1/62 dead transitions. [2023-08-04 00:27:40,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 62 transitions, 268 flow [2023-08-04 00:27:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:27:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:27:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-04 00:27:40,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.511070110701107 [2023-08-04 00:27:40,732 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-04 00:27:40,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-04 00:27:40,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:27:40,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-04 00:27:40,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:27:40,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:27:40,741 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:27:40,741 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 140 flow. Second operand 4 states and 554 transitions. [2023-08-04 00:27:40,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 62 transitions, 268 flow [2023-08-04 00:27:40,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:27:40,757 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 152 flow [2023-08-04 00:27:40,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=65, 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=4, PETRI_FLOW=152, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-08-04 00:27:40,759 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2023-08-04 00:27:40,759 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 152 flow [2023-08-04 00:27:40,759 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-04 00:27:40,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:27:40,759 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:27:40,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 00:27:40,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:27:40,964 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:27:40,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:27:40,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1823190272, now seen corresponding path program 1 times [2023-08-04 00:27:40,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:27:40,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234338692] [2023-08-04 00:27:40,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:27:40,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:27:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:27:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:27:41,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:27:41,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234338692] [2023-08-04 00:27:41,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234338692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:27:41,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:27:41,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 00:27:41,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934270920] [2023-08-04 00:27:41,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:27:41,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:27:41,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:27:41,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:27:41,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:27:41,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 271 [2023-08-04 00:27:41,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:27:41,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:27:41,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 271 [2023-08-04 00:27:41,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:28:15,344 INFO L124 PetriNetUnfolderBase]: 335018/438253 cut-off events. [2023-08-04 00:28:15,344 INFO L125 PetriNetUnfolderBase]: For 5801/5801 co-relation queries the response was YES. [2023-08-04 00:28:16,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862366 conditions, 438253 events. 335018/438253 cut-off events. For 5801/5801 co-relation queries the response was YES. Maximal size of possible extension queue 11285. Compared 3014337 event pairs, 55610 based on Foata normal form. 0/388557 useless extension candidates. Maximal degree in co-relation 225885. Up to 383649 conditions per place. [2023-08-04 00:28:17,801 INFO L140 encePairwiseOnDemand]: 266/271 looper letters, 67 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-04 00:28:17,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 79 transitions, 361 flow [2023-08-04 00:28:17,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:28:17,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:28:17,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-04 00:28:17,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633456334563346 [2023-08-04 00:28:17,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-04 00:28:17,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-04 00:28:17,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:28:17,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-04 00:28:17,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:28:17,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:28:17,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:28:17,806 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 152 flow. Second operand 3 states and 458 transitions. [2023-08-04 00:28:17,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 79 transitions, 361 flow [2023-08-04 00:28:17,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 79 transitions, 354 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 00:28:17,808 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 166 flow [2023-08-04 00:28:17,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=67, 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=166, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2023-08-04 00:28:17,808 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 7 predicate places. [2023-08-04 00:28:17,808 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 166 flow [2023-08-04 00:28:17,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:28:17,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:28:17,809 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:28:17,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 00:28:17,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:28:17,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:28:17,809 INFO L85 PathProgramCache]: Analyzing trace with hash -249596186, now seen corresponding path program 1 times [2023-08-04 00:28:17,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:28:17,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035700980] [2023-08-04 00:28:17,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:28:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:28:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:28:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:28:17,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:28:17,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035700980] [2023-08-04 00:28:17,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035700980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:28:17,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:28:17,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 00:28:17,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819385607] [2023-08-04 00:28:17,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:28:17,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:28:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:28:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:28:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:28:17,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 271 [2023-08-04 00:28:17,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:28:17,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:28:17,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 271 [2023-08-04 00:28:17,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:28:54,597 INFO L124 PetriNetUnfolderBase]: 326858/426989 cut-off events. [2023-08-04 00:28:54,598 INFO L125 PetriNetUnfolderBase]: For 32438/32438 co-relation queries the response was YES. [2023-08-04 00:28:56,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895838 conditions, 426989 events. 326858/426989 cut-off events. For 32438/32438 co-relation queries the response was YES. Maximal size of possible extension queue 11453. Compared 2890111 event pairs, 274810 based on Foata normal form. 0/381245 useless extension candidates. Maximal degree in co-relation 233877. Up to 406153 conditions per place. [2023-08-04 00:28:57,358 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 53 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-04 00:28:57,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 301 flow [2023-08-04 00:28:57,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:28:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:28:57,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-04 00:28:57,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301353013530136 [2023-08-04 00:28:57,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-04 00:28:57,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-04 00:28:57,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:28:57,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-04 00:28:57,361 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-04 00:28:57,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:28:57,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 271.0) internal successors, (1084), 4 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:28:57,362 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 166 flow. Second operand 3 states and 431 transitions. [2023-08-04 00:28:57,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 301 flow [2023-08-04 00:28:57,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 64 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:28:57,386 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 175 flow [2023-08-04 00:28:57,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=69, 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=175, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-08-04 00:28:57,387 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 9 predicate places. [2023-08-04 00:28:57,388 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 175 flow [2023-08-04 00:28:57,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:28:57,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:28:57,388 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:28:57,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 00:28:57,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:28:57,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:28:57,388 INFO L85 PathProgramCache]: Analyzing trace with hash 461988743, now seen corresponding path program 1 times [2023-08-04 00:28:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:28:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003415596] [2023-08-04 00:28:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:28:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:28:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:28:57,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:28:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:28:57,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:28:57,432 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:28:57,432 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 00:28:57,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 00:28:57,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 00:28:57,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 00:28:57,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 00:28:57,433 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 00:28:57,433 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-04 00:28:57,436 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 00:28:57,436 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 00:28:57,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 12:28:57 BasicIcfg [2023-08-04 00:28:57,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 00:28:57,514 INFO L158 Benchmark]: Toolchain (without parser) took 253538.51ms. Allocated memory was 335.5MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 278.4MB in the beginning and 12.4GB in the end (delta: -12.1GB). Peak memory consumption was 3.6GB. Max. memory is 16.0GB. [2023-08-04 00:28:57,514 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 335.5MB. Free memory is still 288.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 00:28:57,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.62ms. Allocated memory is still 335.5MB. Free memory was 278.4MB in the beginning and 255.1MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 00:28:57,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.18ms. Allocated memory is still 335.5MB. Free memory was 255.1MB in the beginning and 252.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 00:28:57,515 INFO L158 Benchmark]: Boogie Preprocessor took 44.72ms. Allocated memory is still 335.5MB. Free memory was 252.4MB in the beginning and 250.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 00:28:57,515 INFO L158 Benchmark]: RCFGBuilder took 532.78ms. Allocated memory was 335.5MB in the beginning and 471.9MB in the end (delta: 136.3MB). Free memory was 250.5MB in the beginning and 408.4MB in the end (delta: -157.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.0GB. [2023-08-04 00:28:57,515 INFO L158 Benchmark]: TraceAbstraction took 252382.47ms. Allocated memory was 471.9MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 407.5MB in the beginning and 12.4GB in the end (delta: -11.9GB). Peak memory consumption was 3.6GB. Max. memory is 16.0GB. [2023-08-04 00:28:57,517 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 335.5MB. Free memory is still 288.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 523.62ms. Allocated memory is still 335.5MB. Free memory was 278.4MB in the beginning and 255.1MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.18ms. Allocated memory is still 335.5MB. Free memory was 255.1MB in the beginning and 252.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.72ms. Allocated memory is still 335.5MB. Free memory was 252.4MB in the beginning and 250.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 532.78ms. Allocated memory was 335.5MB in the beginning and 471.9MB in the end (delta: 136.3MB). Free memory was 250.5MB in the beginning and 408.4MB in the end (delta: -157.8MB). Peak memory consumption was 8.8MB. Max. memory is 16.0GB. * TraceAbstraction took 252382.47ms. Allocated memory was 471.9MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 407.5MB in the beginning and 12.4GB in the end (delta: -11.9GB). Peak memory consumption was 3.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 105 PlacesBefore, 33 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1312 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 80 TotalNumberOfCompositions, 3162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1489, independent: 1375, independent conditional: 0, independent unconditional: 1375, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 646, independent: 631, independent conditional: 0, independent unconditional: 631, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1489, independent: 744, independent conditional: 0, independent unconditional: 744, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 646, unknown conditional: 0, unknown unconditional: 646] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 67, Positive conditional cache size: 0, Positive unconditional cache size: 67, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 135 PlacesBefore, 57 PlacesAfterwards, 124 TransitionsBefore, 44 TransitionsAfterwards, 3628 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 10959 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4038, independent: 3812, independent conditional: 0, independent unconditional: 3812, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1688, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4038, independent: 2161, independent conditional: 0, independent unconditional: 2161, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 1688, unknown conditional: 0, unknown unconditional: 1688] , Statistics on independence cache: Total cache size (in pairs): 260, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 160 PlacesBefore, 63 PlacesAfterwards, 152 TransitionsBefore, 51 TransitionsAfterwards, 6040 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 18642 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6918, independent: 6611, independent conditional: 0, independent unconditional: 6611, dependent: 307, dependent conditional: 0, dependent unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2970, independent: 2915, independent conditional: 0, independent unconditional: 2915, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6918, independent: 3696, independent conditional: 0, independent unconditional: 3696, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 2970, unknown conditional: 0, unknown unconditional: 2970] , Statistics on independence cache: Total cache size (in pairs): 297, Positive cache size: 270, Positive conditional cache size: 0, Positive unconditional cache size: 270, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055[2]; [L832] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t2055[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055[asdf], ((void *)0), P0, ((void *)0))=-1, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t2055[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055[asdf], ((void *)0), P0, ((void *)0))=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L832] COND FALSE 0 !(asdf<2) [L833] 0 pthread_t t2056[2]; [L834] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t2056[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056[asdf], ((void *)0), P1, ((void *)0))=1, t2055={5:0}, t2056={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 3 x$w_buff1 = x$w_buff0 [L775] 3 x$w_buff0 = 1 [L776] 3 x$w_buff1_used = x$w_buff0_used [L777] 3 x$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t2056[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056[asdf], ((void *)0), P1, ((void *)0))=2, t2055={5:0}, t2056={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 4 x$w_buff1 = x$w_buff0 [L775] 4 x$w_buff0 = 1 [L776] 4 x$w_buff1_used = x$w_buff0_used [L777] 4 x$w_buff0_used = (_Bool)1 [L778] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x=0, y=0, z=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 149 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: 3.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 48 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=75occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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 for thread instance sufficiency with 2 thread instances CFG has 10 procedures, 173 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: 72.2s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 66.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 364 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 756 IncrementalHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 10 mSDtfsCounter, 756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=5, InterpolantAutomatonStates: 28, 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.5s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 384 SizeOfPredicates, 0 NumberOfNonLiveVariables, 894 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 124/141 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 1 thread instances CFG has 10 procedures, 173 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: 176.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 172.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 64 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 405 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 15 mSDtfsCounter, 405 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 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-04 00:28:57,548 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...