/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_mix024_power.opt_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:17:33,897 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:17:33,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:17:33,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:17:33,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:17:33,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:17:33,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:17:33,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:17:33,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:17:33,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:17:33,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:17:33,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:17:33,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:17:33,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:17:33,978 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:17:33,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:17:33,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:17:33,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:17:33,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:17:33,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:17:33,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:17:33,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:17:33,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:17:33,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:17:33,983 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:17:33,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:17:33,984 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:17:33,984 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:17:33,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:17:33,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:17:33,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:17:33,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:17:33,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:17:33,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:17:33,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:17:33,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:17:33,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:17:33,987 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:17:33,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:17:33,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:17:33,987 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:17:33,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> TOGETHER [2023-08-03 17:17:34,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:17:34,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:17:34,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:17:34,213 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:17:34,213 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:17:34,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix024_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-03 17:17:35,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:17:35,668 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:17:35,669 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix024_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-03 17:17:35,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00f9ed96f/b8688e6816ba4bfaa36639db97016013/FLAG198daef48 [2023-08-03 17:17:35,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00f9ed96f/b8688e6816ba4bfaa36639db97016013 [2023-08-03 17:17:35,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:17:35,697 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:17:35,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:17:35,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:17:35,702 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:17:35,702 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:17:35" (1/1) ... [2023-08-03 17:17:35,703 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b15b89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:35, skipping insertion in model container [2023-08-03 17:17:35,703 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:17:35" (1/1) ... [2023-08-03 17:17:35,749 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:17:35,885 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix024_power.opt_pso.opt_rmo.opt_bound2.i[1009,1022] [2023-08-03 17:17:36,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:17:36,090 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:17:36,102 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_mix024_power.opt_pso.opt_rmo.opt_bound2.i[1009,1022] [2023-08-03 17:17:36,119 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:17:36,127 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:17:36,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:17:36,204 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:17:36,204 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:17:36,210 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:17:36,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36 WrapperNode [2023-08-03 17:17:36,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:17:36,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:17:36,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:17:36,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:17:36,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,289 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2023-08-03 17:17:36,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:17:36,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:17:36,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:17:36,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:17:36,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:17:36,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:17:36,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:17:36,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:17:36,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (1/1) ... [2023-08-03 17:17:36,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:17:36,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:17:36,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-03 17:17:36,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-03 17:17:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:17:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:17:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:17:36,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:17:36,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:17:36,425 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:17:36,425 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:17:36,426 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:17:36,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:17:36,426 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-03 17:17:36,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-03 17:17:36,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:17:36,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:17:36,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:17:36,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:17:36,428 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:17:36,540 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:17:36,542 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:17:36,807 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:17:36,925 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:17:36,925 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-03 17:17:36,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:17:36 BoogieIcfgContainer [2023-08-03 17:17:36,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:17:36,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:17:36,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:17:36,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:17:36,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:17:35" (1/3) ... [2023-08-03 17:17:36,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f37a642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:17:36, skipping insertion in model container [2023-08-03 17:17:36,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:17:36" (2/3) ... [2023-08-03 17:17:36,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f37a642 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:17:36, skipping insertion in model container [2023-08-03 17:17:36,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:17:36" (3/3) ... [2023-08-03 17:17:36,934 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix024_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-03 17:17:36,942 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:17:36,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:17:36,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-03 17:17:36,951 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:17:36,996 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:17:37,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-03 17:17:37,152 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-03 17:17:37,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:17:37,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 30/457 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2026 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-03 17:17:37,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 134 transitions, 283 flow [2023-08-03 17:17:37,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 134 transitions, 283 flow [2023-08-03 17:17:37,172 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:17:37,182 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 134 transitions, 283 flow [2023-08-03 17:17:37,184 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 134 transitions, 283 flow [2023-08-03 17:17:37,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-03 17:17:37,239 INFO L124 PetriNetUnfolderBase]: 30/457 cut-off events. [2023-08-03 17:17:37,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:17:37,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 457 events. 30/457 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2026 event pairs, 0 based on Foata normal form. 0/403 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-03 17:17:37,247 INFO L119 LiptonReduction]: Number of co-enabled transitions 2976 [2023-08-03 17:17:40,746 INFO L134 LiptonReduction]: Checked pairs total: 7255 [2023-08-03 17:17:40,746 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-03 17:17:40,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:17:40,763 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;@36f4d082, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:17:40,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-03 17:17:40,767 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:17:40,768 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 17:17:40,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:17:40,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:40,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:17:40,769 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 17:17:40,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:40,773 INFO L85 PathProgramCache]: Analyzing trace with hash 541208388, now seen corresponding path program 1 times [2023-08-03 17:17:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:40,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053481945] [2023-08-03 17:17:40,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:40,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:17:41,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:41,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053481945] [2023-08-03 17:17:41,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053481945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:17:41,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:17:41,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:17:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533391644] [2023-08-03 17:17:41,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:17:41,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:17:41,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:41,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:17:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:17:41,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2023-08-03 17:17:41,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:41,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:41,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2023-08-03 17:17:41,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:17:41,540 INFO L124 PetriNetUnfolderBase]: 2161/3602 cut-off events. [2023-08-03 17:17:41,540 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-03 17:17:41,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6990 conditions, 3602 events. 2161/3602 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 21490 event pairs, 1876 based on Foata normal form. 120/3046 useless extension candidates. Maximal degree in co-relation 6973. Up to 3294 conditions per place. [2023-08-03 17:17:41,564 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 30 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-03 17:17:41,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 157 flow [2023-08-03 17:17:41,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:17:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:17:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-03 17:17:41,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114709851551957 [2023-08-03 17:17:41,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-03 17:17:41,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-03 17:17:41,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:17:41,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-03 17:17:41,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:41,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:41,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:41,598 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 87 flow. Second operand 3 states and 379 transitions. [2023-08-03 17:17:41,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 157 flow [2023-08-03 17:17:41,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:17:41,603 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 93 flow [2023-08-03 17:17:41,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-03 17:17:41,608 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-03 17:17:41,608 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 93 flow [2023-08-03 17:17:41,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:41,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:41,609 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:17:41,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:17:41,609 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 17:17:41,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash -416757453, now seen corresponding path program 1 times [2023-08-03 17:17:41,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:41,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470025033] [2023-08-03 17:17:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:41,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:17:41,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:17:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:17:41,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:17:41,667 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:17:41,668 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2023-08-03 17:17:41,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-03 17:17:41,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2023-08-03 17:17:41,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-03 17:17:41,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-03 17:17:41,670 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-03 17:17:41,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:17:41,671 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:17:41,673 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:17:41,673 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:17:41,697 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:17:41,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 358 flow [2023-08-03 17:17:41,866 INFO L124 PetriNetUnfolderBase]: 93/1404 cut-off events. [2023-08-03 17:17:41,866 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:17:41,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1404 events. 93/1404 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9752 event pairs, 0 based on Foata normal form. 0/1239 useless extension candidates. Maximal degree in co-relation 1018. Up to 54 conditions per place. [2023-08-03 17:17:41,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 169 places, 161 transitions, 358 flow [2023-08-03 17:17:41,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 161 transitions, 358 flow [2023-08-03 17:17:41,877 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:17:41,878 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 161 transitions, 358 flow [2023-08-03 17:17:41,878 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 161 transitions, 358 flow [2023-08-03 17:17:41,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 358 flow [2023-08-03 17:17:42,023 INFO L124 PetriNetUnfolderBase]: 93/1404 cut-off events. [2023-08-03 17:17:42,024 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-03 17:17:42,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 1404 events. 93/1404 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9752 event pairs, 0 based on Foata normal form. 0/1239 useless extension candidates. Maximal degree in co-relation 1018. Up to 54 conditions per place. [2023-08-03 17:17:42,060 INFO L119 LiptonReduction]: Number of co-enabled transitions 7248 [2023-08-03 17:17:45,351 INFO L134 LiptonReduction]: Checked pairs total: 26376 [2023-08-03 17:17:45,351 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-03 17:17:45,355 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:17:45,357 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;@36f4d082, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:17:45,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:17:45,360 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:17:45,360 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-03 17:17:45,361 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:17:45,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:17:45,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:17:45,361 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 17:17:45,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:17:45,362 INFO L85 PathProgramCache]: Analyzing trace with hash 834240293, now seen corresponding path program 1 times [2023-08-03 17:17:45,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:17:45,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794435044] [2023-08-03 17:17:45,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:17:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:17:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:17:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:17:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:17:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794435044] [2023-08-03 17:17:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794435044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:17:45,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:17:45,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:17:45,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258688474] [2023-08-03 17:17:45,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:17:45,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:17:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:17:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:17:45,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:17:45,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 279 [2023-08-03 17:17:45,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 58 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:17:45,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:17:45,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 279 [2023-08-03 17:17:45,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:18:43,044 INFO L124 PetriNetUnfolderBase]: 468866/624791 cut-off events. [2023-08-03 17:18:43,045 INFO L125 PetriNetUnfolderBase]: For 9671/9671 co-relation queries the response was YES. [2023-08-03 17:18:44,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224415 conditions, 624791 events. 468866/624791 cut-off events. For 9671/9671 co-relation queries the response was YES. Maximal size of possible extension queue 18645. Compared 4829464 event pairs, 439250 based on Foata normal form. 13020/545107 useless extension candidates. Maximal degree in co-relation 480182. Up to 587323 conditions per place. [2023-08-03 17:18:47,403 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 44 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-03 17:18:47,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 252 flow [2023-08-03 17:18:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:18:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:18:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-03 17:18:47,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2023-08-03 17:18:47,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-03 17:18:47,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-03 17:18:47,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:18:47,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-03 17:18:47,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:18:47,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:18:47,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:18:47,411 INFO L175 Difference]: Start difference. First operand has 70 places, 58 transitions, 152 flow. Second operand 3 states and 450 transitions. [2023-08-03 17:18:47,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 252 flow [2023-08-03 17:18:47,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 62 transitions, 246 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-03 17:18:47,430 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 156 flow [2023-08-03 17:18:47,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-08-03 17:18:47,431 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 3 predicate places. [2023-08-03 17:18:47,431 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 156 flow [2023-08-03 17:18:47,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:18:47,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:18:47,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:18:47,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:18:47,432 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 17:18:47,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:18:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1201147030, now seen corresponding path program 1 times [2023-08-03 17:18:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:18:47,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874239282] [2023-08-03 17:18:47,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:18:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:18:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:18:47,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:18:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:18:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874239282] [2023-08-03 17:18:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874239282] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:18:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162010919] [2023-08-03 17:18:47,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:18:47,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:18:47,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:18:47,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:18:47,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-03 17:18:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:18:47,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:18:47,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:18:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:18:47,668 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:18:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:18:47,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162010919] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:18:47,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:18:47,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:18:47,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881699403] [2023-08-03 17:18:47,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:18:47,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:18:47,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:18:47,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:18:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:18:47,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-03 17:18:47,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:18:47,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:18:47,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-03 17:18:47,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:19:37,869 INFO L124 PetriNetUnfolderBase]: 389314/514491 cut-off events. [2023-08-03 17:19:37,869 INFO L125 PetriNetUnfolderBase]: For 6364/6364 co-relation queries the response was YES. [2023-08-03 17:19:39,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007188 conditions, 514491 events. 389314/514491 cut-off events. For 6364/6364 co-relation queries the response was YES. Maximal size of possible extension queue 16083. Compared 3837208 event pairs, 294532 based on Foata normal form. 4/440303 useless extension candidates. Maximal degree in co-relation 263635. Up to 484009 conditions per place. [2023-08-03 17:19:41,894 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 49 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-08-03 17:19:41,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 69 transitions, 284 flow [2023-08-03 17:19:41,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:19:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:19:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-08-03 17:19:41,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525089605734767 [2023-08-03 17:19:41,899 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-08-03 17:19:41,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-08-03 17:19:41,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:19:41,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-08-03 17:19:41,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:19:41,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:19:41,908 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:19:41,908 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 156 flow. Second operand 4 states and 586 transitions. [2023-08-03 17:19:41,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 69 transitions, 284 flow [2023-08-03 17:19:41,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 69 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:19:41,910 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 174 flow [2023-08-03 17:19:41,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2023-08-03 17:19:41,911 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 7 predicate places. [2023-08-03 17:19:41,912 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 174 flow [2023-08-03 17:19:41,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:19:41,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:19:41,912 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:19:41,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-03 17:19:42,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:19:42,118 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-03 17:19:42,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:19:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash 785812958, now seen corresponding path program 1 times [2023-08-03 17:19:42,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:19:42,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323462189] [2023-08-03 17:19:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:19:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:19:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:19:42,188 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 17:19:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:19:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323462189] [2023-08-03 17:19:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323462189] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:19:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372301653] [2023-08-03 17:19:42,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:19:42,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:19:42,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:19:42,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-03 17:19:42,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-03 17:19:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:19:42,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:19:42,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:19:42,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:19:42,290 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:19:42,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372301653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:19:42,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:19:42,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:19:42,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975641623] [2023-08-03 17:19:42,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:19:42,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:19:42,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:19:42,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:19:42,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:19:42,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-03 17:19:42,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 174 flow. Second operand has 5 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 17:19:42,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:19:42,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-03 17:19:42,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:20:26,365 INFO L124 PetriNetUnfolderBase]: 389290/514484 cut-off events. [2023-08-03 17:20:26,366 INFO L125 PetriNetUnfolderBase]: For 6400/6400 co-relation queries the response was YES. [2023-08-03 17:20:28,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007189 conditions, 514484 events. 389290/514484 cut-off events. For 6400/6400 co-relation queries the response was YES. Maximal size of possible extension queue 16083. Compared 3834492 event pairs, 247178 based on Foata normal form. 16/440339 useless extension candidates. Maximal degree in co-relation 479859. Up to 484008 conditions per place. [2023-08-03 17:20:30,792 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-08-03 17:20:30,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 67 transitions, 290 flow [2023-08-03 17:20:30,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:20:30,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:20:30,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2023-08-03 17:20:30,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5146953405017921 [2023-08-03 17:20:30,812 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2023-08-03 17:20:30,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2023-08-03 17:20:30,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:20:30,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2023-08-03 17:20:30,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:20:30,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:20:30,832 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 279.0) internal successors, (1674), 6 states have internal predecessors, (1674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:20:30,832 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 174 flow. Second operand 5 states and 718 transitions. [2023-08-03 17:20:30,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 67 transitions, 290 flow [2023-08-03 17:20:30,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 67 transitions, 283 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:20:30,836 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 163 flow [2023-08-03 17:20:30,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-08-03 17:20:30,838 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 7 predicate places. [2023-08-03 17:20:30,838 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 163 flow [2023-08-03 17:20:30,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 17:20:30,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:20:30,839 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:20:30,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 17:20:31,043 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 17:20:31,044 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 17:20:31,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:20:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash -747702160, now seen corresponding path program 1 times [2023-08-03 17:20:31,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:20:31,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122883203] [2023-08-03 17:20:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:20:31,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:20:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:20:31,315 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 17:20:31,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:20:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122883203] [2023-08-03 17:20:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122883203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:20:31,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:20:31,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:20:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575658345] [2023-08-03 17:20:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:20:31,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:20:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:20:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:20:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:20:31,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 279 [2023-08-03 17:20:31,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:20:31,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:20:31,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 279 [2023-08-03 17:20:31,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:21:10,649 INFO L124 PetriNetUnfolderBase]: 335018/439562 cut-off events. [2023-08-03 17:21:10,649 INFO L125 PetriNetUnfolderBase]: For 5817/5817 co-relation queries the response was YES. [2023-08-03 17:21:12,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863662 conditions, 439562 events. 335018/439562 cut-off events. For 5817/5817 co-relation queries the response was YES. Maximal size of possible extension queue 13944. Compared 3230836 event pairs, 55274 based on Foata normal form. 0/387311 useless extension candidates. Maximal degree in co-relation 411147. Up to 383649 conditions per place. [2023-08-03 17:21:13,669 INFO L140 encePairwiseOnDemand]: 274/279 looper letters, 67 selfloop transitions, 3 changer transitions 0/85 dead transitions. [2023-08-03 17:21:13,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 85 transitions, 372 flow [2023-08-03 17:21:13,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:21:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:21:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-08-03 17:21:13,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5758661887694145 [2023-08-03 17:21:13,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-08-03 17:21:13,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-08-03 17:21:13,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:21:13,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-08-03 17:21:13,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:21:13,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:21:13,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:21:13,675 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 163 flow. Second operand 3 states and 482 transitions. [2023-08-03 17:21:13,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 85 transitions, 372 flow [2023-08-03 17:21:13,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 85 transitions, 367 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:21:13,677 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 179 flow [2023-08-03 17:21:13,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2023-08-03 17:21:13,678 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 7 predicate places. [2023-08-03 17:21:13,679 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 179 flow [2023-08-03 17:21:13,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:21:13,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:21:13,679 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:21:13,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:21:13,679 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 17:21:13,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:21:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1276203577, now seen corresponding path program 1 times [2023-08-03 17:21:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:21:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340307605] [2023-08-03 17:21:13,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:21:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:21:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:21:13,744 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 17:21:13,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:21:13,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340307605] [2023-08-03 17:21:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340307605] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:21:13,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:21:13,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-03 17:21:13,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221866991] [2023-08-03 17:21:13,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:21:13,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:21:13,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:21:13,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:21:13,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:21:13,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 279 [2023-08-03 17:21:13,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:21:13,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:21:13,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 279 [2023-08-03 17:21:13,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:21:54,511 INFO L124 PetriNetUnfolderBase]: 326858/437182 cut-off events. [2023-08-03 17:21:54,511 INFO L125 PetriNetUnfolderBase]: For 32441/32441 co-relation queries the response was YES. [2023-08-03 17:21:56,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906047 conditions, 437182 events. 326858/437182 cut-off events. For 32441/32441 co-relation queries the response was YES. Maximal size of possible extension queue 14342. Compared 3307691 event pairs, 274810 based on Foata normal form. 0/386570 useless extension candidates. Maximal degree in co-relation 433093. Up to 406153 conditions per place. [2023-08-03 17:21:57,874 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 53 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-03 17:21:57,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 70 transitions, 314 flow [2023-08-03 17:21:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:21:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:21:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-08-03 17:21:57,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5436081242532855 [2023-08-03 17:21:57,875 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-08-03 17:21:57,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-08-03 17:21:57,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:21:57,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-08-03 17:21:57,877 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 17:21:57,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:21:57,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:21:57,879 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 179 flow. Second operand 3 states and 455 transitions. [2023-08-03 17:21:57,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 70 transitions, 314 flow [2023-08-03 17:21:57,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 70 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:21:57,904 INFO L231 Difference]: Finished difference. Result has 79 places, 60 transitions, 188 flow [2023-08-03 17:21:57,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=79, PETRI_TRANSITIONS=60} [2023-08-03 17:21:57,905 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 9 predicate places. [2023-08-03 17:21:57,905 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 60 transitions, 188 flow [2023-08-03 17:21:57,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:21:57,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:21:57,906 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:21:57,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:21:57,906 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 17:21:57,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:21:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash 942992542, now seen corresponding path program 1 times [2023-08-03 17:21:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:21:57,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887725932] [2023-08-03 17:21:57,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:21:57,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:21:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:21:57,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:21:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:21:57,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:21:57,966 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:21:57,966 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-03 17:21:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:21:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:21:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-03 17:21:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:21:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-03 17:21:57,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:21:57,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-03 17:21:57,967 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-03 17:21:57,971 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:21:57,971 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:21:58,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:21:58 BasicIcfg [2023-08-03 17:21:58,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:21:58,049 INFO L158 Benchmark]: Toolchain (without parser) took 262351.32ms. Allocated memory was 518.0MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 468.9MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-08-03 17:21:58,049 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 302.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:21:58,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.76ms. Allocated memory is still 518.0MB. Free memory was 468.9MB in the beginning and 445.4MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-03 17:21:58,050 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.34ms. Allocated memory is still 518.0MB. Free memory was 445.4MB in the beginning and 442.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:21:58,050 INFO L158 Benchmark]: Boogie Preprocessor took 54.06ms. Allocated memory is still 518.0MB. Free memory was 442.9MB in the beginning and 440.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:21:58,050 INFO L158 Benchmark]: RCFGBuilder took 582.47ms. Allocated memory is still 518.0MB. Free memory was 440.8MB in the beginning and 478.3MB in the end (delta: -37.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-03 17:21:58,051 INFO L158 Benchmark]: TraceAbstraction took 261119.58ms. Allocated memory was 518.0MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 477.3MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-08-03 17:21:58,052 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 302.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 514.76ms. Allocated memory is still 518.0MB. Free memory was 468.9MB in the beginning and 445.4MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.34ms. Allocated memory is still 518.0MB. Free memory was 445.4MB in the beginning and 442.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.06ms. Allocated memory is still 518.0MB. Free memory was 442.9MB in the beginning and 440.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 582.47ms. Allocated memory is still 518.0MB. Free memory was 440.8MB in the beginning and 478.3MB in the end (delta: -37.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 261119.58ms. Allocated memory was 518.0MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 477.3MB in the beginning and 12.1GB in the end (delta: -11.6GB). Peak memory consumption was 3.9GB. 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: 3.6s, 136 PlacesBefore, 42 PlacesAfterwards, 134 TransitionsBefore, 36 TransitionsAfterwards, 2976 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 113 TotalNumberOfCompositions, 7255 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3618, independent: 3444, independent conditional: 0, independent unconditional: 3444, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1565, independent: 1533, independent conditional: 0, independent unconditional: 1533, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3618, independent: 1911, independent conditional: 0, independent unconditional: 1911, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 1565, unknown conditional: 0, unknown unconditional: 1565] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 169 PlacesBefore, 70 PlacesAfterwards, 161 TransitionsBefore, 58 TransitionsAfterwards, 7248 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 26376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9436, independent: 9035, independent conditional: 0, independent unconditional: 9035, dependent: 401, dependent conditional: 0, dependent unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3417, independent: 3350, independent conditional: 0, independent unconditional: 3350, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9436, independent: 5685, independent conditional: 0, independent unconditional: 5685, dependent: 334, dependent conditional: 0, dependent unconditional: 334, unknown: 3417, unknown conditional: 0, unknown unconditional: 3417] , Statistics on independence cache: Total cache size (in pairs): 417, Positive cache size: 388, Positive conditional cache size: 0, Positive unconditional cache size: 388, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636[2]; [L845] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] COND TRUE 0 asdf<2 [L845] FCALL, FORK 0 pthread_create(&t636[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636[asdf], ((void *)0), P0, ((void *)0))=-3, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] COND TRUE 0 asdf<2 [L845] FCALL, FORK 0 pthread_create(&t636[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636[asdf], ((void *)0), P0, ((void *)0))=-2, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L845] COND FALSE 0 !(asdf<2) [L846] 0 pthread_t t637[2]; [L847] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] COND TRUE 0 asdf<2 [L847] FCALL, FORK 0 pthread_create(&t637[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637[asdf], ((void *)0), P1, ((void *)0))=-1, t636={5:0}, t637={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L788] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L788] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 3 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L847] COND TRUE 0 asdf<2 [L847] FCALL, FORK 0 pthread_create(&t637[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637[asdf], ((void *)0), P1, ((void *)0))=0, t636={5:0}, t637={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L784] 4 y$w_buff1 = y$w_buff0 [L785] 4 y$w_buff0 = 1 [L786] 4 y$w_buff1_used = y$w_buff0_used [L787] 4 y$w_buff0_used = (_Bool)1 [L788] CALL 4 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 4 !expression [L19] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0, z=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 849]: 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: 845]: 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: 847]: 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, 157 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 66 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=93occurred 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.2s 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, 184 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: 256.3s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 251.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 219 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 181 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 494 IncrementalHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 9 mSDtfsCounter, 494 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=188occurred 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.5s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 300 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 17:21:58,087 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...