/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 18:00:09,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 18:00:09,043 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 18:00:09,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 18:00:09,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 18:00:09,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 18:00:09,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 18:00:09,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 18:00:09,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 18:00:09,062 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 18:00:09,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 18:00:09,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 18:00:09,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 18:00:09,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 18:00:09,063 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 18:00:09,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 18:00:09,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 18:00:09,064 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 18:00:09,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 18:00:09,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 18:00:09,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 18:00:09,065 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 18:00:09,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 18:00:09,066 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 18:00:09,066 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 18:00:09,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 18:00:09,067 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 18:00:09,067 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 18:00:09,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 18:00:09,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 18:00:09,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:00:09,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 18:00:09,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 18:00:09,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 18:00:09,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 18:00:09,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 18:00:09,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 18:00:09,070 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 18:00:09,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 18:00:09,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 18:00:09,070 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 18:00:09,071 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 18:00:09,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 18:00:09,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 18:00:09,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 18:00:09,232 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 18:00:09,232 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 18:00:09,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-03 18:00:10,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 18:00:10,542 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 18:00:10,543 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-03 18:00:10,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2688ee5b3/b77d287e9fbf4e30ae1de2a86ad0200f/FLAG4c98dc46c [2023-08-03 18:00:10,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2688ee5b3/b77d287e9fbf4e30ae1de2a86ad0200f [2023-08-03 18:00:10,577 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 18:00:10,579 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 18:00:10,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 18:00:10,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 18:00:10,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 18:00:10,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:00:10" (1/1) ... [2023-08-03 18:00:10,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3617ab93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:10, skipping insertion in model container [2023-08-03 18:00:10,585 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 06:00:10" (1/1) ... [2023-08-03 18:00:10,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 18:00:10,774 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_safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i[1039,1052] [2023-08-03 18:00:10,962 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:00:10,971 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 18:00:10,981 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_safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i[1039,1052] [2023-08-03 18:00:11,003 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 18:00:11,004 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 18:00:11,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 18:00:11,052 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:00:11,052 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 18:00:11,072 INFO L206 MainTranslator]: Completed translation [2023-08-03 18:00:11,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11 WrapperNode [2023-08-03 18:00:11,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 18:00:11,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 18:00:11,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 18:00:11,073 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 18:00:11,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,157 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-03 18:00:11,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 18:00:11,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 18:00:11,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 18:00:11,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 18:00:11,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 18:00:11,203 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 18:00:11,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 18:00:11,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 18:00:11,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (1/1) ... [2023-08-03 18:00:11,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 18:00:11,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:00:11,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 18:00:11,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 18:00:11,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 18:00:11,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 18:00:11,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 18:00:11,299 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 18:00:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 18:00:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 18:00:11,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 18:00:11,300 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 18:00:11,436 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 18:00:11,438 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 18:00:11,705 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 18:00:11,769 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 18:00:11,770 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 18:00:11,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:00:11 BoogieIcfgContainer [2023-08-03 18:00:11,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 18:00:11,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 18:00:11,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 18:00:11,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 18:00:11,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 06:00:10" (1/3) ... [2023-08-03 18:00:11,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cfd9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:00:11, skipping insertion in model container [2023-08-03 18:00:11,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 06:00:11" (2/3) ... [2023-08-03 18:00:11,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cfd9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 06:00:11, skipping insertion in model container [2023-08-03 18:00:11,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 06:00:11" (3/3) ... [2023-08-03 18:00:11,776 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-03 18:00:11,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 18:00:11,787 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 18:00:11,787 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 18:00:11,787 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 18:00:11,819 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:00:11,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-03 18:00:11,912 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-03 18:00:11,913 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:00:11,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1961 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 269. Up to 16 conditions per place. [2023-08-03 18:00:11,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 128 transitions, 271 flow [2023-08-03 18:00:11,920 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 128 transitions, 271 flow [2023-08-03 18:00:11,922 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:00:11,928 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 128 transitions, 271 flow [2023-08-03 18:00:11,930 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 128 transitions, 271 flow [2023-08-03 18:00:11,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-03 18:00:11,971 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-03 18:00:11,971 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:00:11,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1961 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 269. Up to 16 conditions per place. [2023-08-03 18:00:11,975 INFO L119 LiptonReduction]: Number of co-enabled transitions 2530 [2023-08-03 18:00:14,637 INFO L134 LiptonReduction]: Checked pairs total: 6037 [2023-08-03 18:00:14,638 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-03 18:00:14,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:00:14,650 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;@1648123d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:00:14,650 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 18:00:14,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:00:14,653 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2023-08-03 18:00:14,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:00:14,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:00:14,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:00:14,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:00:14,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:00:14,657 INFO L85 PathProgramCache]: Analyzing trace with hash 525016152, now seen corresponding path program 1 times [2023-08-03 18:00:14,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:00:14,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398770629] [2023-08-03 18:00:14,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:00:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:00:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:00:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:00:14,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:00:14,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398770629] [2023-08-03 18:00:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398770629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:00:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:00:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:00:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165840298] [2023-08-03 18:00:14,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:00:14,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:00:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:00:14,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:00:14,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:00:14,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-08-03 18:00:14,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:00:14,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:00:14,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-08-03 18:00:14,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:00:15,280 INFO L124 PetriNetUnfolderBase]: 2161/3463 cut-off events. [2023-08-03 18:00:15,280 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-03 18:00:15,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6865 conditions, 3463 events. 2161/3463 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19061 event pairs, 1312 based on Foata normal form. 120/2983 useless extension candidates. Maximal degree in co-relation 6844. Up to 3294 conditions per place. [2023-08-03 18:00:15,295 INFO L140 encePairwiseOnDemand]: 234/238 looper letters, 30 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-03 18:00:15,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 153 flow [2023-08-03 18:00:15,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:00:15,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:00:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-03 18:00:15,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056022408963585 [2023-08-03 18:00:15,311 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-03 18:00:15,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-03 18:00:15,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:00:15,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-03 18:00:15,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:00:15,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:00:15,323 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:00:15,325 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 83 flow. Second operand 3 states and 361 transitions. [2023-08-03 18:00:15,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 153 flow [2023-08-03 18:00:15,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 153 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 18:00:15,328 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 89 flow [2023-08-03 18:00:15,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-03 18:00:15,332 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-03 18:00:15,332 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 89 flow [2023-08-03 18:00:15,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:00:15,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:00:15,333 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 18:00:15,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 18:00:15,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-03 18:00:15,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:00:15,339 INFO L85 PathProgramCache]: Analyzing trace with hash -910450295, now seen corresponding path program 1 times [2023-08-03 18:00:15,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:00:15,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886332204] [2023-08-03 18:00:15,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:00:15,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:00:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:00:15,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:00:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:00:15,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:00:15,427 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:00:15,428 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 18:00:15,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 18:00:15,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 18:00:15,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 18:00:15,429 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 18:00:15,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 18:00:15,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 18:00:15,430 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 18:00:15,431 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 18:00:15,431 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 18:00:15,465 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 18:00:15,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 152 transitions, 340 flow [2023-08-03 18:00:15,556 INFO L124 PetriNetUnfolderBase]: 93/1379 cut-off events. [2023-08-03 18:00:15,556 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 18:00:15,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1379 events. 93/1379 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9494 event pairs, 0 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 1002. Up to 54 conditions per place. [2023-08-03 18:00:15,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 152 transitions, 340 flow [2023-08-03 18:00:15,562 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 160 places, 152 transitions, 340 flow [2023-08-03 18:00:15,562 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 18:00:15,563 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 152 transitions, 340 flow [2023-08-03 18:00:15,563 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 152 transitions, 340 flow [2023-08-03 18:00:15,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 152 transitions, 340 flow [2023-08-03 18:00:15,645 INFO L124 PetriNetUnfolderBase]: 93/1379 cut-off events. [2023-08-03 18:00:15,645 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 18:00:15,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1379 events. 93/1379 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9494 event pairs, 0 based on Foata normal form. 0/1214 useless extension candidates. Maximal degree in co-relation 1002. Up to 54 conditions per place. [2023-08-03 18:00:15,670 INFO L119 LiptonReduction]: Number of co-enabled transitions 6064 [2023-08-03 18:00:18,538 INFO L134 LiptonReduction]: Checked pairs total: 18745 [2023-08-03 18:00:18,538 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-03 18:00:18,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 18:00:18,541 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;@1648123d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 18:00:18,541 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 18:00:18,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 18:00:18,544 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-08-03 18:00:18,544 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 18:00:18,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:00:18,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 18:00:18,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:00:18,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:00:18,545 INFO L85 PathProgramCache]: Analyzing trace with hash 804652221, now seen corresponding path program 1 times [2023-08-03 18:00:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:00:18,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459107174] [2023-08-03 18:00:18,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:00:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:00:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:00:18,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:00:18,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:00:18,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459107174] [2023-08-03 18:00:18,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459107174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:00:18,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:00:18,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 18:00:18,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053159688] [2023-08-03 18:00:18,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:00:18,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:00:18,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:00:18,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:00:18,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:00:18,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 269 [2023-08-03 18:00:18,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:00:18,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:00:18,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 269 [2023-08-03 18:00:18,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:01:08,641 INFO L124 PetriNetUnfolderBase]: 468866/614681 cut-off events. [2023-08-03 18:01:08,641 INFO L125 PetriNetUnfolderBase]: For 9572/9572 co-relation queries the response was YES. [2023-08-03 18:01:10,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214339 conditions, 614681 events. 468866/614681 cut-off events. For 9572/9572 co-relation queries the response was YES. Maximal size of possible extension queue 14845. Compared 4313719 event pairs, 380024 based on Foata normal form. 13020/544176 useless extension candidates. Maximal degree in co-relation 261809. Up to 587323 conditions per place. [2023-08-03 18:01:12,619 INFO L140 encePairwiseOnDemand]: 265/269 looper letters, 44 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-03 18:01:12,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 240 flow [2023-08-03 18:01:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:01:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:01:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-03 18:01:12,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241635687732342 [2023-08-03 18:01:12,622 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-03 18:01:12,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-03 18:01:12,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:01:12,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-03 18:01:12,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:12,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:12,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:12,625 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 140 flow. Second operand 3 states and 423 transitions. [2023-08-03 18:01:12,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 240 flow [2023-08-03 18:01:12,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 56 transitions, 234 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 18:01:12,637 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 144 flow [2023-08-03 18:01:12,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-08-03 18:01:12,638 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2023-08-03 18:01:12,638 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 144 flow [2023-08-03 18:01:12,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:12,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:01:12,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:01:12,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 18:01:12,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:01:12,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:01:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash -198699534, now seen corresponding path program 1 times [2023-08-03 18:01:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:01:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407443331] [2023-08-03 18:01:12,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:01:12,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:01:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:01:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:01:12,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:01:12,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407443331] [2023-08-03 18:01:12,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407443331] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:01:12,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175160125] [2023-08-03 18:01:12,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:01:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:01:12,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:01:12,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:01:12,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 18:01:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:01:12,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 18:01:12,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:01:12,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:01:12,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 18:01:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:01:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175160125] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 18:01:12,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 18:01:12,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 18:01:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356111803] [2023-08-03 18:01:12,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 18:01:12,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:01:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:01:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:01:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 18:01:12,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 269 [2023-08-03 18:01:12,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:12,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:01:12,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 269 [2023-08-03 18:01:12,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:01:51,804 INFO L124 PetriNetUnfolderBase]: 389314/506025 cut-off events. [2023-08-03 18:01:51,805 INFO L125 PetriNetUnfolderBase]: For 6296/6296 co-relation queries the response was YES. [2023-08-03 18:01:53,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998718 conditions, 506025 events. 389314/506025 cut-off events. For 6296/6296 co-relation queries the response was YES. Maximal size of possible extension queue 12793. Compared 3413150 event pairs, 247180 based on Foata normal form. 4/439244 useless extension candidates. Maximal degree in co-relation 261516. Up to 484009 conditions per place. [2023-08-03 18:01:55,552 INFO L140 encePairwiseOnDemand]: 265/269 looper letters, 49 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-03 18:01:55,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 272 flow [2023-08-03 18:01:55,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 18:01:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 18:01:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-03 18:01:55,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111524163568774 [2023-08-03 18:01:55,575 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-03 18:01:55,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-03 18:01:55,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:01:55,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-03 18:01:55,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:55,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:55,578 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:55,578 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 144 flow. Second operand 4 states and 550 transitions. [2023-08-03 18:01:55,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 272 flow [2023-08-03 18:01:55,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:01:55,580 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 162 flow [2023-08-03 18:01:55,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-08-03 18:01:55,581 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 18:01:55,581 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 162 flow [2023-08-03 18:01:55,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:55,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:01:55,582 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 18:01:55,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-03 18:01:55,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:01:55,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:01:55,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:01:55,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1754025512, now seen corresponding path program 1 times [2023-08-03 18:01:55,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:01:55,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644560968] [2023-08-03 18:01:55,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:01:55,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:01:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:01:55,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:01:55,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:01:55,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644560968] [2023-08-03 18:01:55,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644560968] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 18:01:55,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168612182] [2023-08-03 18:01:55,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:01:55,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:01:55,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 18:01:55,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 18:01:55,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 18:01:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:01:56,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 18:01:56,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 18:01:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 18:01:56,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 18:01:56,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168612182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:01:56,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 18:01:56,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 18:01:56,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799040917] [2023-08-03 18:01:56,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:01:56,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 18:01:56,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:01:56,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 18:01:56,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 18:01:56,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 269 [2023-08-03 18:01:56,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:01:56,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:01:56,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 269 [2023-08-03 18:01:56,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:02:35,123 INFO L124 PetriNetUnfolderBase]: 389290/508205 cut-off events. [2023-08-03 18:02:35,123 INFO L125 PetriNetUnfolderBase]: For 6492/6492 co-relation queries the response was YES. [2023-08-03 18:02:36,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1000190 conditions, 508205 events. 389290/508205 cut-off events. For 6492/6492 co-relation queries the response was YES. Maximal size of possible extension queue 12862. Compared 3457098 event pairs, 247168 based on Foata normal form. 16/439436 useless extension candidates. Maximal degree in co-relation 261869. Up to 484008 conditions per place. [2023-08-03 18:02:38,332 INFO L140 encePairwiseOnDemand]: 266/269 looper letters, 49 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-03 18:02:38,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 278 flow [2023-08-03 18:02:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 18:02:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 18:02:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 673 transitions. [2023-08-03 18:02:38,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003717472118959 [2023-08-03 18:02:38,341 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 673 transitions. [2023-08-03 18:02:38,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 673 transitions. [2023-08-03 18:02:38,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:02:38,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 673 transitions. [2023-08-03 18:02:38,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:02:38,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:02:38,345 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:02:38,345 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 162 flow. Second operand 5 states and 673 transitions. [2023-08-03 18:02:38,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 278 flow [2023-08-03 18:02:38,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 61 transitions, 271 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 18:02:38,347 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 151 flow [2023-08-03 18:02:38,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-03 18:02:38,347 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 18:02:38,348 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 151 flow [2023-08-03 18:02:38,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:02:38,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:02:38,348 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:02:38,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-03 18:02:38,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 18:02:38,549 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:02:38,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:02:38,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1991950312, now seen corresponding path program 1 times [2023-08-03 18:02:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:02:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142735688] [2023-08-03 18:02:38,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:02:38,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:02:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:02:38,708 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-03 18:02:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:02:38,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142735688] [2023-08-03 18:02:38,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142735688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:02:38,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:02:38,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 18:02:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753337594] [2023-08-03 18:02:38,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:02:38,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:02:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:02:38,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:02:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:02:38,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 269 [2023-08-03 18:02:38,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:02:38,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:02:38,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 269 [2023-08-03 18:02:38,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:03:11,594 INFO L124 PetriNetUnfolderBase]: 335018/438349 cut-off events. [2023-08-03 18:03:11,594 INFO L125 PetriNetUnfolderBase]: For 5794/5794 co-relation queries the response was YES. [2023-08-03 18:03:13,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862449 conditions, 438349 events. 335018/438349 cut-off events. For 5794/5794 co-relation queries the response was YES. Maximal size of possible extension queue 11280. Compared 3010220 event pairs, 55274 based on Foata normal form. 0/391644 useless extension candidates. Maximal degree in co-relation 225905. Up to 383649 conditions per place. [2023-08-03 18:03:14,468 INFO L140 encePairwiseOnDemand]: 264/269 looper letters, 67 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-03 18:03:14,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 360 flow [2023-08-03 18:03:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:03:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:03:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-08-03 18:03:14,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.563816604708798 [2023-08-03 18:03:14,470 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-08-03 18:03:14,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-08-03 18:03:14,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:03:14,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-08-03 18:03:14,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:14,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:14,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:14,473 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 151 flow. Second operand 3 states and 455 transitions. [2023-08-03 18:03:14,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 360 flow [2023-08-03 18:03:14,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 79 transitions, 355 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 18:03:14,476 INFO L231 Difference]: Finished difference. Result has 71 places, 53 transitions, 167 flow [2023-08-03 18:03:14,476 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, 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=167, PETRI_PLACES=71, PETRI_TRANSITIONS=53} [2023-08-03 18:03:14,476 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places. [2023-08-03 18:03:14,477 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 53 transitions, 167 flow [2023-08-03 18:03:14,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:14,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:03:14,477 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:03:14,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 18:03:14,477 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:03:14,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:03:14,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1278855638, now seen corresponding path program 1 times [2023-08-03 18:03:14,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:03:14,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986100213] [2023-08-03 18:03:14,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:03:14,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:03:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 18:03:14,504 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-03 18:03:14,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 18:03:14,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986100213] [2023-08-03 18:03:14,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986100213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 18:03:14,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 18:03:14,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 18:03:14,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092861649] [2023-08-03 18:03:14,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 18:03:14,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 18:03:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 18:03:14,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 18:03:14,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 18:03:14,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 269 [2023-08-03 18:03:14,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 53 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:14,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 18:03:14,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 269 [2023-08-03 18:03:14,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 18:03:47,985 INFO L124 PetriNetUnfolderBase]: 326858/427181 cut-off events. [2023-08-03 18:03:47,986 INFO L125 PetriNetUnfolderBase]: For 32390/32390 co-relation queries the response was YES. [2023-08-03 18:03:49,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896046 conditions, 427181 events. 326858/427181 cut-off events. For 32390/32390 co-relation queries the response was YES. Maximal size of possible extension queue 11478. Compared 2897767 event pairs, 274810 based on Foata normal form. 0/380636 useless extension candidates. Maximal degree in co-relation 233929. Up to 406153 conditions per place. [2023-08-03 18:03:50,801 INFO L140 encePairwiseOnDemand]: 266/269 looper letters, 53 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-08-03 18:03:50,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 64 transitions, 302 flow [2023-08-03 18:03:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 18:03:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 18:03:50,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-03 18:03:50,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.530359355638166 [2023-08-03 18:03:50,803 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-03 18:03:50,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-03 18:03:50,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 18:03:50,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-03 18:03:50,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:50,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:50,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:50,825 INFO L175 Difference]: Start difference. First operand has 71 places, 53 transitions, 167 flow. Second operand 3 states and 428 transitions. [2023-08-03 18:03:50,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 64 transitions, 302 flow [2023-08-03 18:03:50,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 18:03:50,839 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 176 flow [2023-08-03 18:03:50,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=70, 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=176, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-08-03 18:03:50,841 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 9 predicate places. [2023-08-03 18:03:50,841 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 176 flow [2023-08-03 18:03:50,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 18:03:50,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 18:03:50,841 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 18:03:50,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 18:03:50,841 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 18:03:50,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 18:03:50,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1198759302, now seen corresponding path program 1 times [2023-08-03 18:03:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 18:03:50,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884917275] [2023-08-03 18:03:50,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 18:03:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 18:03:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:03:50,862 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 18:03:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 18:03:50,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 18:03:50,873 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 18:03:50,873 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 18:03:50,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 18:03:50,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 18:03:50,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 18:03:50,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 18:03:50,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 18:03:50,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 18:03:50,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 18:03:50,874 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 18:03:50,879 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 18:03:50,879 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 18:03:50,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 06:03:50 BasicIcfg [2023-08-03 18:03:50,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 18:03:50,917 INFO L158 Benchmark]: Toolchain (without parser) took 220337.39ms. Allocated memory was 343.9MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 281.4MB in the beginning and 9.9GB in the end (delta: -9.6GB). Peak memory consumption was 6.0GB. Max. memory is 16.0GB. [2023-08-03 18:03:50,917 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 343.9MB. Free memory is still 293.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 18:03:50,917 INFO L158 Benchmark]: CACSL2BoogieTranslator took 490.97ms. Allocated memory is still 343.9MB. Free memory was 281.4MB in the beginning and 258.0MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-03 18:03:50,917 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.99ms. Allocated memory was 343.9MB in the beginning and 541.1MB in the end (delta: 197.1MB). Free memory was 258.0MB in the beginning and 505.6MB in the end (delta: -247.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. [2023-08-03 18:03:50,917 INFO L158 Benchmark]: Boogie Preprocessor took 44.81ms. Allocated memory is still 541.1MB. Free memory was 505.6MB in the beginning and 503.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 18:03:50,918 INFO L158 Benchmark]: RCFGBuilder took 567.79ms. Allocated memory is still 541.1MB. Free memory was 503.8MB in the beginning and 469.7MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-03 18:03:50,918 INFO L158 Benchmark]: TraceAbstraction took 219143.57ms. Allocated memory was 541.1MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 469.0MB in the beginning and 9.9GB in the end (delta: -9.4GB). Peak memory consumption was 6.0GB. Max. memory is 16.0GB. [2023-08-03 18:03:50,919 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.09ms. Allocated memory is still 343.9MB. Free memory is still 293.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 490.97ms. Allocated memory is still 343.9MB. Free memory was 281.4MB in the beginning and 258.0MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 83.99ms. Allocated memory was 343.9MB in the beginning and 541.1MB in the end (delta: 197.1MB). Free memory was 258.0MB in the beginning and 505.6MB in the end (delta: -247.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.81ms. Allocated memory is still 541.1MB. Free memory was 505.6MB in the beginning and 503.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 567.79ms. Allocated memory is still 541.1MB. Free memory was 503.8MB in the beginning and 469.7MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 219143.57ms. Allocated memory was 541.1MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 469.0MB in the beginning and 9.9GB in the end (delta: -9.4GB). Peak memory consumption was 6.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 130 PlacesBefore, 40 PlacesAfterwards, 128 TransitionsBefore, 34 TransitionsAfterwards, 2530 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 110 TotalNumberOfCompositions, 6037 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2369, independent: 2216, independent conditional: 0, independent unconditional: 2216, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1251, independent: 1225, independent conditional: 0, independent unconditional: 1225, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2369, independent: 991, independent conditional: 0, independent unconditional: 991, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 1251, unknown conditional: 0, unknown unconditional: 1251] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 160 PlacesBefore, 64 PlacesAfterwards, 152 TransitionsBefore, 52 TransitionsAfterwards, 6064 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 117 TotalNumberOfCompositions, 18745 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8807, independent: 8500, independent conditional: 0, independent unconditional: 8500, 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: 3056, independent: 3006, independent conditional: 0, independent unconditional: 3006, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8807, independent: 5494, independent conditional: 0, independent unconditional: 5494, dependent: 257, dependent conditional: 0, dependent unconditional: 257, unknown: 3056, unknown conditional: 0, unknown unconditional: 3056] , Statistics on independence cache: Total cache size (in pairs): 397, Positive cache size: 373, Positive conditional cache size: 0, Positive unconditional cache size: 373, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 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; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897[2]; [L832] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1897={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] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t1897[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897[asdf], ((void *)0), P0, ((void *)0))=-3, t1897={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] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1897={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] [L832] COND TRUE 0 asdf<2 [L832] FCALL, FORK 0 pthread_create(&t1897[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897[asdf], ((void *)0), P0, ((void *)0))=-2, t1897={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] [L832] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1897={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] [L832] COND FALSE 0 !(asdf<2) [L833] 0 pthread_t t1898[2]; [L834] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={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] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t1898[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898[asdf], ((void *)0), P1, ((void *)0))=-1, t1897={5:0}, t1898={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] [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_p2_EAX=0, __unbuffered_p2_EBX=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] [L834] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1897={5:0}, t1898={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] [L834] COND TRUE 0 asdf<2 [L834] FCALL, FORK 0 pthread_create(&t1898[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898[asdf], ((void *)0), P1, ((void *)0))=0, t1897={5:0}, t1898={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] [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_p2_EAX=0, __unbuffered_p2_EBX=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] - 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. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 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.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s 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, 62 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 172 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: 215.4s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 211.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 188 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 456 IncrementalHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 3 mSDtfsCounter, 456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=5, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 23/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-03 18:03:50,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...