/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 PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:33:57,224 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:33:57,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:33:57,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:33:57,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:33:57,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:33:57,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:33:57,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:33:57,333 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:33:57,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:33:57,337 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:33:57,337 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:33:57,338 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:33:57,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:33:57,339 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:33:57,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:33:57,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:33:57,340 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:33:57,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:33:57,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:33:57,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:33:57,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:33:57,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:33:57,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:33:57,342 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:33:57,342 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:33:57,342 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:33:57,343 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:33:57,343 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:33:57,343 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:33:57,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:33:57,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:33:57,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:33:57,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:33:57,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:33:57,345 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:33:57,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:33:57,345 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:33:57,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:33:57,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:33:57,345 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:33:57,346 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 -> PROGRAM_FIRST [2023-08-04 06:33:57,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:33:57,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:33:57,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:33:57,587 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:33:57,588 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:33:57,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-04 06:33:58,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:33:58,828 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:33:58,829 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-04 06:33:58,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138b71ef7/c4db0bdec2d74c41990cb5cf5ba12665/FLAG9bac46c44 [2023-08-04 06:33:58,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138b71ef7/c4db0bdec2d74c41990cb5cf5ba12665 [2023-08-04 06:33:58,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:33:58,867 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:33:58,869 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:33:58,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:33:58,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:33:58,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:33:58" (1/1) ... [2023-08-04 06:33:58,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751a2a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:58, skipping insertion in model container [2023-08-04 06:33:58,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:33:58" (1/1) ... [2023-08-04 06:33:58,921 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:33:59,055 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_safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i[986,999] [2023-08-04 06:33:59,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:33:59,238 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:33:59,247 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_safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i[986,999] [2023-08-04 06:33:59,268 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:33:59,269 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:33:59,303 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:33:59,328 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:33:59,328 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:33:59,333 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:33:59,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59 WrapperNode [2023-08-04 06:33:59,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:33:59,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:33:59,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:33:59,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:33:59,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,390 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 169 [2023-08-04 06:33:59,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:33:59,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:33:59,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:33:59,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:33:59,396 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,412 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,429 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,431 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:33:59,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:33:59,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:33:59,435 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:33:59,436 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (1/1) ... [2023-08-04 06:33:59,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:33:59,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:33:59,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 06:33:59,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 06:33:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:33:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:33:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:33:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:33:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:33:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:33:59,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:33:59,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:33:59,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:33:59,557 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 06:33:59,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 06:33:59,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:33:59,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:33:59,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:33:59,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:33:59,558 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 06:33:59,667 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:33:59,669 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:34:00,019 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:34:00,187 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:34:00,187 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 06:34:00,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:34:00 BoogieIcfgContainer [2023-08-04 06:34:00,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:34:00,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:34:00,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:34:00,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:34:00,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:33:58" (1/3) ... [2023-08-04 06:34:00,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129395e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:34:00, skipping insertion in model container [2023-08-04 06:34:00,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:33:59" (2/3) ... [2023-08-04 06:34:00,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129395e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:34:00, skipping insertion in model container [2023-08-04 06:34:00,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:34:00" (3/3) ... [2023-08-04 06:34:00,199 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe003_power.oepc_pso.oepc_pso.opt_rmo.oepc_rmo.opt_bound2.i [2023-08-04 06:34:00,206 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:34:00,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:34:00,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:34:00,214 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:34:00,260 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:34:00,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 06:34:00,399 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-04 06:34:00,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:00,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1969 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 269. Up to 16 conditions per place. [2023-08-04 06:34:00,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 06:34:00,413 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 129 transitions, 273 flow [2023-08-04 06:34:00,415 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:34:00,424 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 129 transitions, 273 flow [2023-08-04 06:34:00,427 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 129 transitions, 273 flow [2023-08-04 06:34:00,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 06:34:00,477 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-04 06:34:00,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:00,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1969 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 269. Up to 16 conditions per place. [2023-08-04 06:34:00,483 INFO L119 LiptonReduction]: Number of co-enabled transitions 2728 [2023-08-04 06:34:04,228 INFO L134 LiptonReduction]: Checked pairs total: 6728 [2023-08-04 06:34:04,229 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-04 06:34:04,240 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:34:04,245 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;@5dad8d38, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:34:04,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:34:04,248 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:34:04,248 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-04 06:34:04,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:04,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:04,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 06:34:04,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:04,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash 19445246, now seen corresponding path program 1 times [2023-08-04 06:34:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:04,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776721853] [2023-08-04 06:34:04,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:04,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:34:04,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:04,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776721853] [2023-08-04 06:34:04,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776721853] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:04,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:34:04,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:34:04,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147645473] [2023-08-04 06:34:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:04,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:04,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:34:04,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 241 [2023-08-04 06:34:04,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:04,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:04,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 241 [2023-08-04 06:34:04,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:04,958 INFO L124 PetriNetUnfolderBase]: 1908/3256 cut-off events. [2023-08-04 06:34:04,958 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-04 06:34:04,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6355 conditions, 3256 events. 1908/3256 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 19686 event pairs, 498 based on Foata normal form. 0/2924 useless extension candidates. Maximal degree in co-relation 5377. Up to 2077 conditions per place. [2023-08-04 06:34:04,975 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 42 selfloop transitions, 2 changer transitions 6/52 dead transitions. [2023-08-04 06:34:04,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 52 transitions, 219 flow [2023-08-04 06:34:04,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:04,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-04 06:34:04,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228215767634855 [2023-08-04 06:34:04,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-04 06:34:04,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-04 06:34:04,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:04,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-04 06:34:04,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,003 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,004 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 79 flow. Second operand 3 states and 378 transitions. [2023-08-04 06:34:05,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 52 transitions, 219 flow [2023-08-04 06:34:05,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 219 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:34:05,008 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 67 flow [2023-08-04 06:34:05,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-08-04 06:34:05,012 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-08-04 06:34:05,012 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 67 flow [2023-08-04 06:34:05,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:05,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:34:05,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:34:05,013 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:05,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1517867310, now seen corresponding path program 1 times [2023-08-04 06:34:05,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:05,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578146992] [2023-08-04 06:34:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:05,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:34:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578146992] [2023-08-04 06:34:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578146992] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:05,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:34:05,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:34:05,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154021259] [2023-08-04 06:34:05,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:05,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:05,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:05,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:34:05,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-04 06:34:05,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:05,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-04 06:34:05,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:05,284 INFO L124 PetriNetUnfolderBase]: 1417/2192 cut-off events. [2023-08-04 06:34:05,284 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2023-08-04 06:34:05,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4628 conditions, 2192 events. 1417/2192 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10676 event pairs, 844 based on Foata normal form. 0/2044 useless extension candidates. Maximal degree in co-relation 4613. Up to 2182 conditions per place. [2023-08-04 06:34:05,292 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 26 selfloop transitions, 2 changer transitions 1/31 dead transitions. [2023-08-04 06:34:05,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 135 flow [2023-08-04 06:34:05,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-04 06:34:05,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4854771784232365 [2023-08-04 06:34:05,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-04 06:34:05,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-04 06:34:05,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:05,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-04 06:34:05,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,296 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,296 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 67 flow. Second operand 3 states and 351 transitions. [2023-08-04 06:34:05,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 135 flow [2023-08-04 06:34:05,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:34:05,298 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 71 flow [2023-08-04 06:34:05,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-04 06:34:05,298 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2023-08-04 06:34:05,298 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 71 flow [2023-08-04 06:34:05,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:05,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:34:05,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 06:34:05,299 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:05,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:05,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2036919566, now seen corresponding path program 1 times [2023-08-04 06:34:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:05,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172530848] [2023-08-04 06:34:05,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:05,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:34:05,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172530848] [2023-08-04 06:34:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172530848] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:34:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952475346] [2023-08-04 06:34:05,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:05,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:05,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:34:05,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:34:05,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 06:34:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:05,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:34:05,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:34:05,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:34:05,482 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:34:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952475346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:05,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:34:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:34:05,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350372690] [2023-08-04 06:34:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:05,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:05,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:34:05,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-04 06:34:05,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:05,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-04 06:34:05,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:05,736 INFO L124 PetriNetUnfolderBase]: 1232/1867 cut-off events. [2023-08-04 06:34:05,737 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 06:34:05,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 1867 events. 1232/1867 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8674 event pairs, 770 based on Foata normal form. 0/1754 useless extension candidates. Maximal degree in co-relation 3775. Up to 1821 conditions per place. [2023-08-04 06:34:05,743 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 29 selfloop transitions, 2 changer transitions 1/34 dead transitions. [2023-08-04 06:34:05,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 149 flow [2023-08-04 06:34:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-04 06:34:05,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896265560165975 [2023-08-04 06:34:05,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-04 06:34:05,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-04 06:34:05,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:05,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-04 06:34:05,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,748 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,748 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 71 flow. Second operand 3 states and 354 transitions. [2023-08-04 06:34:05,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 149 flow [2023-08-04 06:34:05,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:34:05,749 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 75 flow [2023-08-04 06:34:05,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-08-04 06:34:05,750 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-04 06:34:05,750 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 75 flow [2023-08-04 06:34:05,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:05,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:05,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:34:05,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 06:34:05,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:05,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:05,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:05,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1542653693, now seen corresponding path program 1 times [2023-08-04 06:34:05,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:05,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641270019] [2023-08-04 06:34:05,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:05,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:34:06,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:06,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641270019] [2023-08-04 06:34:06,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641270019] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:34:06,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598179053] [2023-08-04 06:34:06,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:06,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:06,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:34:06,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:34:06,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 06:34:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:06,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:34:06,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:34:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 06:34:06,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:34:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598179053] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:06,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:34:06,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:34:06,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055031006] [2023-08-04 06:34:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:06,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:06,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:06,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:06,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:34:06,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-04 06:34:06,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:06,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-04 06:34:06,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:06,349 INFO L124 PetriNetUnfolderBase]: 1160/1747 cut-off events. [2023-08-04 06:34:06,349 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:34:06,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3599 conditions, 1747 events. 1160/1747 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8142 event pairs, 672 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 3583. Up to 1463 conditions per place. [2023-08-04 06:34:06,356 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 33 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2023-08-04 06:34:06,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 169 flow [2023-08-04 06:34:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:06,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2023-08-04 06:34:06,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951590594744122 [2023-08-04 06:34:06,358 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 358 transitions. [2023-08-04 06:34:06,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions. [2023-08-04 06:34:06,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:06,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions. [2023-08-04 06:34:06,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,360 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,360 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 75 flow. Second operand 3 states and 358 transitions. [2023-08-04 06:34:06,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 169 flow [2023-08-04 06:34:06,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:34:06,361 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 79 flow [2023-08-04 06:34:06,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-04 06:34:06,362 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 0 predicate places. [2023-08-04 06:34:06,362 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 79 flow [2023-08-04 06:34:06,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:06,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:34:06,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 06:34:06,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 06:34:06,571 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:34:06,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash 667796218, now seen corresponding path program 1 times [2023-08-04 06:34:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241310220] [2023-08-04 06:34:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 06:34:06,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:06,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241310220] [2023-08-04 06:34:06,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241310220] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:34:06,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292985506] [2023-08-04 06:34:06,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:06,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:06,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:34:06,618 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:34:06,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 06:34:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:06,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:34:06,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:34:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 06:34:06,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:34:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 06:34:06,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292985506] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:34:06,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:34:06,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:34:06,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751019095] [2023-08-04 06:34:06,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:34:06,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:34:06,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:06,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:34:06,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:34:06,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 241 [2023-08-04 06:34:06,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 79 flow. Second operand has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:06,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 241 [2023-08-04 06:34:06,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:06,787 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 06:34:06,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:06,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 21 events. 6/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 06:34:06,788 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 06:34:06,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 51 flow [2023-08-04 06:34:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:34:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:34:06,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-04 06:34:06,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45228215767634855 [2023-08-04 06:34:06,789 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-04 06:34:06,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-04 06:34:06,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:06,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-04 06:34:06,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,805 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,805 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 79 flow. Second operand 4 states and 436 transitions. [2023-08-04 06:34:06,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 51 flow [2023-08-04 06:34:06,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:34:06,806 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 06:34:06,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2023-08-04 06:34:06,806 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -20 predicate places. [2023-08-04 06:34:06,806 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 06:34:06,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.8) internal successors, (549), 5 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:06,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:34:06,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:34:06,809 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:34:06,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 06:34:07,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:34:07,016 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 06:34:07,018 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:34:07,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 06:34:07,050 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-04 06:34:07,050 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:07,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 448 events. 30/448 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1969 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 269. Up to 16 conditions per place. [2023-08-04 06:34:07,051 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 129 transitions, 273 flow [2023-08-04 06:34:07,052 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 100 transitions, 215 flow [2023-08-04 06:34:07,052 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:34:07,052 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 100 transitions, 215 flow [2023-08-04 06:34:07,053 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 100 transitions, 215 flow [2023-08-04 06:34:07,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 100 transitions, 215 flow [2023-08-04 06:34:07,066 INFO L124 PetriNetUnfolderBase]: 6/216 cut-off events. [2023-08-04 06:34:07,066 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:07,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 216 events. 6/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 634 event pairs, 0 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 153. Up to 8 conditions per place. [2023-08-04 06:34:07,068 INFO L119 LiptonReduction]: Number of co-enabled transitions 1452 [2023-08-04 06:34:09,486 INFO L134 LiptonReduction]: Checked pairs total: 3424 [2023-08-04 06:34:09,486 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-08-04 06:34:09,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:34:09,488 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;@5dad8d38, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:34:09,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:34:09,491 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:34:09,491 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 06:34:09,491 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:09,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:09,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:34:09,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:34:09,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash -428433575, now seen corresponding path program 1 times [2023-08-04 06:34:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:09,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825384627] [2023-08-04 06:34:09,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:34:09,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:09,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825384627] [2023-08-04 06:34:09,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825384627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:09,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:34:09,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:34:09,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632232326] [2023-08-04 06:34:09,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:09,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:09,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:09,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:34:09,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 208 [2023-08-04 06:34:09,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:09,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:09,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 208 [2023-08-04 06:34:09,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:34:09,649 INFO L124 PetriNetUnfolderBase]: 579/987 cut-off events. [2023-08-04 06:34:09,649 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 06:34:09,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2035 conditions, 987 events. 579/987 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4660 event pairs, 295 based on Foata normal form. 0/880 useless extension candidates. Maximal degree in co-relation 2012. Up to 935 conditions per place. [2023-08-04 06:34:09,654 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 25 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 06:34:09,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 133 flow [2023-08-04 06:34:09,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:34:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:34:09,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-04 06:34:09,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5592948717948718 [2023-08-04 06:34:09,656 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-04 06:34:09,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-04 06:34:09,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:34:09,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-04 06:34:09,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:09,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:09,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:09,659 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 69 flow. Second operand 3 states and 349 transitions. [2023-08-04 06:34:09,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 133 flow [2023-08-04 06:34:09,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 133 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:34:09,660 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2023-08-04 06:34:09,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-04 06:34:09,661 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 06:34:09,661 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2023-08-04 06:34:09,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:34:09,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:09,662 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:34:09,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 06:34:09,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:34:09,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash -440203529, now seen corresponding path program 1 times [2023-08-04 06:34:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:09,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121303063] [2023-08-04 06:34:09,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:09,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:34:09,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:34:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:34:09,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:34:09,698 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:34:09,698 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 06:34:09,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 06:34:09,698 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 06:34:09,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 06:34:09,699 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:34:09,700 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 06:34:09,701 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:34:09,701 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:34:09,727 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:34:09,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 154 transitions, 344 flow [2023-08-04 06:34:09,897 INFO L124 PetriNetUnfolderBase]: 93/1377 cut-off events. [2023-08-04 06:34:09,897 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:34:09,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 1377 events. 93/1377 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9487 event pairs, 0 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 1000. Up to 54 conditions per place. [2023-08-04 06:34:09,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 154 transitions, 344 flow [2023-08-04 06:34:09,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 154 transitions, 344 flow [2023-08-04 06:34:09,903 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:34:09,903 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 154 transitions, 344 flow [2023-08-04 06:34:09,903 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 154 transitions, 344 flow [2023-08-04 06:34:09,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 154 transitions, 344 flow [2023-08-04 06:34:09,984 INFO L124 PetriNetUnfolderBase]: 93/1377 cut-off events. [2023-08-04 06:34:09,984 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:34:09,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 1377 events. 93/1377 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9487 event pairs, 0 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 1000. Up to 54 conditions per place. [2023-08-04 06:34:10,003 INFO L119 LiptonReduction]: Number of co-enabled transitions 6560 [2023-08-04 06:34:13,656 INFO L134 LiptonReduction]: Checked pairs total: 20641 [2023-08-04 06:34:13,657 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-04 06:34:13,658 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:34:13,659 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;@5dad8d38, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:34:13,659 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:34:13,660 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:34:13,660 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-04 06:34:13,660 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:34:13,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:34:13,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 06:34:13,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:34:13,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:34:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 31057305, now seen corresponding path program 1 times [2023-08-04 06:34:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:34:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145027164] [2023-08-04 06:34:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:34:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:34:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:34:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:34:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:34:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145027164] [2023-08-04 06:34:13,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145027164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:34:13,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:34:13,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:34:13,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18651524] [2023-08-04 06:34:13,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:34:13,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:34:13,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:34:13,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:34:13,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:34:13,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 273 [2023-08-04 06:34:13,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 138 flow. Second operand has 3 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-04 06:34:13,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:34:13,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 273 [2023-08-04 06:34:13,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:35:13,005 INFO L124 PetriNetUnfolderBase]: 490490/643234 cut-off events. [2023-08-04 06:35:13,006 INFO L125 PetriNetUnfolderBase]: For 9581/9581 co-relation queries the response was YES. [2023-08-04 06:35:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268417 conditions, 643234 events. 490490/643234 cut-off events. For 9581/9581 co-relation queries the response was YES. Maximal size of possible extension queue 15806. Compared 4682795 event pairs, 81617 based on Foata normal form. 0/579591 useless extension candidates. Maximal degree in co-relation 1068808. Up to 565329 conditions per place. [2023-08-04 06:35:16,167 INFO L140 encePairwiseOnDemand]: 268/273 looper letters, 71 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2023-08-04 06:35:16,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 373 flow [2023-08-04 06:35:16,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:35:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:35:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-08-04 06:35:16,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5506715506715507 [2023-08-04 06:35:16,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-08-04 06:35:16,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-08-04 06:35:16,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:35:16,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-08-04 06:35:16,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:35:16,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:35:16,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:35:16,173 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 138 flow. Second operand 3 states and 451 transitions. [2023-08-04 06:35:16,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 373 flow [2023-08-04 06:35:16,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 367 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 06:35:16,183 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 153 flow [2023-08-04 06:35:16,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2023-08-04 06:35:16,184 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places. [2023-08-04 06:35:16,184 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 153 flow [2023-08-04 06:35:16,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-04 06:35:16,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:35:16,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:35:16,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 06:35:16,185 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:35:16,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:35:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash -213118354, now seen corresponding path program 1 times [2023-08-04 06:35:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:35:16,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174945581] [2023-08-04 06:35:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:35:16,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:35:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:35:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:35:16,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:35:16,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174945581] [2023-08-04 06:35:16,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174945581] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:35:16,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:35:16,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:35:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452220099] [2023-08-04 06:35:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:35:16,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:35:16,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:35:16,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:35:16,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:35:16,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 273 [2023-08-04 06:35:16,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:35:16,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:35:16,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 273 [2023-08-04 06:35:16,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:36:11,192 INFO L124 PetriNetUnfolderBase]: 478628/606138 cut-off events. [2023-08-04 06:36:11,193 INFO L125 PetriNetUnfolderBase]: For 50042/50042 co-relation queries the response was YES. [2023-08-04 06:36:12,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298733 conditions, 606138 events. 478628/606138 cut-off events. For 50042/50042 co-relation queries the response was YES. Maximal size of possible extension queue 14064. Compared 3891088 event pairs, 400414 based on Foata normal form. 0/542850 useless extension candidates. Maximal degree in co-relation 854540. Up to 598251 conditions per place. [2023-08-04 06:36:14,937 INFO L140 encePairwiseOnDemand]: 270/273 looper letters, 46 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-04 06:36:14,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 58 transitions, 262 flow [2023-08-04 06:36:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:36:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:36:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-08-04 06:36:14,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042735042735043 [2023-08-04 06:36:14,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-08-04 06:36:14,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-08-04 06:36:14,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:36:14,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-08-04 06:36:14,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:36:14,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:36:14,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:36:14,953 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 153 flow. Second operand 3 states and 413 transitions. [2023-08-04 06:36:14,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 58 transitions, 262 flow [2023-08-04 06:36:15,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 58 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:36:15,008 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 162 flow [2023-08-04 06:36:15,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2023-08-04 06:36:15,010 INFO L281 CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places. [2023-08-04 06:36:15,010 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 162 flow [2023-08-04 06:36:15,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:36:15,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:36:15,011 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:36:15,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:36:15,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:36:15,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:36:15,025 INFO L85 PathProgramCache]: Analyzing trace with hash 912460323, now seen corresponding path program 1 times [2023-08-04 06:36:15,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:36:15,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824018388] [2023-08-04 06:36:15,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:36:15,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:36:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:36:15,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:36:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:36:15,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:36:15,061 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:36:15,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:36:15,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:36:15,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:36:15,062 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:36:15,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 06:36:15,062 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 06:36:15,063 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:36:15,063 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:36:15,063 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:36:15,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:36:15 BasicIcfg [2023-08-04 06:36:15,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:36:15,111 INFO L158 Benchmark]: Toolchain (without parser) took 136243.83ms. Allocated memory was 549.5MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 500.7MB in the beginning and 7.8GB in the end (delta: -7.3GB). Peak memory consumption was 8.1GB. Max. memory is 16.0GB. [2023-08-04 06:36:15,112 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 375.4MB. Free memory is still 328.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:36:15,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.96ms. Allocated memory is still 549.5MB. Free memory was 500.2MB in the beginning and 474.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 06:36:15,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.69ms. Allocated memory is still 549.5MB. Free memory was 474.1MB in the beginning and 471.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:36:15,112 INFO L158 Benchmark]: Boogie Preprocessor took 44.13ms. Allocated memory is still 549.5MB. Free memory was 471.4MB in the beginning and 469.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:36:15,112 INFO L158 Benchmark]: RCFGBuilder took 754.51ms. Allocated memory is still 549.5MB. Free memory was 469.2MB in the beginning and 493.0MB in the end (delta: -23.8MB). Peak memory consumption was 38.1MB. Max. memory is 16.0GB. [2023-08-04 06:36:15,113 INFO L158 Benchmark]: TraceAbstraction took 134919.01ms. Allocated memory was 549.5MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 493.0MB in the beginning and 7.8GB in the end (delta: -7.3GB). Peak memory consumption was 8.1GB. Max. memory is 16.0GB. [2023-08-04 06:36:15,114 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.08ms. Allocated memory is still 375.4MB. Free memory is still 328.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 464.96ms. Allocated memory is still 549.5MB. Free memory was 500.2MB in the beginning and 474.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.69ms. Allocated memory is still 549.5MB. Free memory was 474.1MB in the beginning and 471.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.13ms. Allocated memory is still 549.5MB. Free memory was 471.4MB in the beginning and 469.2MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 754.51ms. Allocated memory is still 549.5MB. Free memory was 469.2MB in the beginning and 493.0MB in the end (delta: -23.8MB). Peak memory consumption was 38.1MB. Max. memory is 16.0GB. * TraceAbstraction took 134919.01ms. Allocated memory was 549.5MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 493.0MB in the beginning and 7.8GB in the end (delta: -7.3GB). Peak memory consumption was 8.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 131 PlacesBefore, 39 PlacesAfterwards, 129 TransitionsBefore, 32 TransitionsAfterwards, 2728 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 112 TotalNumberOfCompositions, 6728 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2876, independent: 2697, independent conditional: 0, independent unconditional: 2697, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1392, independent: 1352, independent conditional: 0, independent unconditional: 1352, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2876, independent: 1345, independent conditional: 0, independent unconditional: 1345, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 1392, unknown conditional: 0, unknown unconditional: 1392] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 105 PlacesBefore, 34 PlacesAfterwards, 100 TransitionsBefore, 27 TransitionsAfterwards, 1452 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 3424 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2059, independent: 1939, independent conditional: 0, independent unconditional: 1939, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 737, independent: 720, independent conditional: 0, independent unconditional: 720, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2059, independent: 1219, independent conditional: 0, independent unconditional: 1219, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 737, unknown conditional: 0, unknown unconditional: 737] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 162 PlacesBefore, 64 PlacesAfterwards, 154 TransitionsBefore, 51 TransitionsAfterwards, 6560 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 119 TotalNumberOfCompositions, 20641 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6878, independent: 6547, independent conditional: 0, independent unconditional: 6547, dependent: 331, dependent conditional: 0, dependent unconditional: 331, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3185, independent: 3120, independent conditional: 0, independent unconditional: 3120, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6878, independent: 3427, independent conditional: 0, independent unconditional: 3427, dependent: 266, dependent conditional: 0, dependent unconditional: 266, unknown: 3185, unknown conditional: 0, unknown unconditional: 3185] , Statistics on independence cache: Total cache size (in pairs): 268, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1849[2]; [L847] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1849={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] [L847] COND TRUE 0 asdf<2 [L847] FCALL, FORK 0 pthread_create(&t1849[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849[asdf], ((void *)0), P0, ((void *)0))=-1, t1849={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] [L743] 1 y$w_buff1 = y$w_buff0 [L744] 1 y$w_buff0 = 2 [L745] 1 y$w_buff1_used = y$w_buff0_used [L746] 1 y$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L748] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L847] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1849={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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L847] COND TRUE 0 asdf<2 [L847] FCALL, FORK 0 pthread_create(&t1849[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1849[asdf], ((void *)0), P0, ((void *)0))=0, t1849={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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L743] 2 y$w_buff1 = y$w_buff0 [L744] 2 y$w_buff0 = 2 [L745] 2 y$w_buff1_used = y$w_buff0_used [L746] 2 y$w_buff0_used = (_Bool)1 [L747] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, expression=1, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=2, y$w_buff1_used=1, y=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 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: 6.7s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 3 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 140 SizeOfPredicates, 0 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 175 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: 125.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 121.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 8 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 150 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: 2.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 50 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=77occurred 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.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 06:36:15,143 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...