/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_safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:46:41,173 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:46:41,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:46:41,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:46:41,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:46:41,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:46:41,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:46:41,241 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:46:41,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:46:41,242 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:46:41,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:46:41,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:46:41,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:46:41,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:46:41,244 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:46:41,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:46:41,245 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:46:41,245 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:46:41,246 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:46:41,246 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:46:41,246 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:46:41,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:46:41,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:46:41,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:46:41,248 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:46:41,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:46:41,248 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:46:41,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:46:41,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:46:41,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:46:41,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:46:41,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:46:41,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:46:41,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:46:41,251 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:46:41,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:46:41,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:46:41,252 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:46:41,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:46:41,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:46:41,252 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:46:41,253 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:46:41,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:46:41,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:46:41,488 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:46:41,490 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:46:41,490 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:46:41,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt_bound2.i [2023-08-04 06:46:42,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:46:42,847 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:46:42,848 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt_bound2.i [2023-08-04 06:46:42,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6944c7412/41d6813bfe7844a4bc18695376fd5697/FLAGbe1051df6 [2023-08-04 06:46:42,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6944c7412/41d6813bfe7844a4bc18695376fd5697 [2023-08-04 06:46:42,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:46:42,877 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:46:42,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:46:42,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:46:42,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:46:42,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:46:42" (1/1) ... [2023-08-04 06:46:42,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a58787b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:42, skipping insertion in model container [2023-08-04 06:46:42,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:46:42" (1/1) ... [2023-08-04 06:46:42,941 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:46:43,056 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_safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt_bound2.i[978,991] [2023-08-04 06:46:43,248 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:46:43,258 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:46:43,269 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_safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt_bound2.i[978,991] [2023-08-04 06:46:43,287 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:46:43,289 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:46:43,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:46:43,343 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:46:43,343 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:46:43,349 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:46:43,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43 WrapperNode [2023-08-04 06:46:43,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:46:43,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:46:43,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:46:43,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:46:43,358 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:46:43" (1/1) ... [2023-08-04 06:46:43,388 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:46:43" (1/1) ... [2023-08-04 06:46:43,423 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 168 [2023-08-04 06:46:43,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:46:43,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:46:43,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:46:43,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:46:43,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,438 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,438 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,468 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,470 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:46:43,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:46:43,474 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:46:43,474 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:46:43,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (1/1) ... [2023-08-04 06:46:43,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:46:43,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:46:43,525 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:46:43,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:46:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:46:43,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:46:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:46:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:46:43,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:46:43,561 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:46:43,561 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:46:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:46:43,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:46:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 06:46:43,562 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 06:46:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:46:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:46:43,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:46:43,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:46:43,564 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:46:43,682 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:46:43,684 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:46:44,016 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:46:44,156 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:46:44,156 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 06:46:44,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:46:44 BoogieIcfgContainer [2023-08-04 06:46:44,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:46:44,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:46:44,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:46:44,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:46:44,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:46:42" (1/3) ... [2023-08-04 06:46:44,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486746e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:46:44, skipping insertion in model container [2023-08-04 06:46:44,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:46:43" (2/3) ... [2023-08-04 06:46:44,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@486746e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:46:44, skipping insertion in model container [2023-08-04 06:46:44,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:46:44" (3/3) ... [2023-08-04 06:46:44,170 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt_bound2.i [2023-08-04 06:46:44,176 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:46:44,184 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:46:44,185 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:46:44,185 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:46:44,231 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:46:44,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:46:44,396 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-04 06:46:44,396 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:46:44,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1968 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 06:46:44,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:46:44,410 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 128 transitions, 271 flow [2023-08-04 06:46:44,413 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:46:44,432 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 128 transitions, 271 flow [2023-08-04 06:46:44,435 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 128 transitions, 271 flow [2023-08-04 06:46:44,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:46:44,491 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-04 06:46:44,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:46:44,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1968 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 06:46:44,498 INFO L119 LiptonReduction]: Number of co-enabled transitions 2728 [2023-08-04 06:46:47,896 INFO L134 LiptonReduction]: Checked pairs total: 7313 [2023-08-04 06:46:47,896 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-04 06:46:47,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:46:47,915 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;@5fd4873b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:46:47,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:46:47,918 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:46:47,918 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-04 06:46:47,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:46:47,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:46:47,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 06:46:47,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:46:47,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:46:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash 17146150, now seen corresponding path program 1 times [2023-08-04 06:46:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:46:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519507929] [2023-08-04 06:46:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:46:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:48,269 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:46:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:46:48,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519507929] [2023-08-04 06:46:48,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519507929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:46:48,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:46:48,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:46:48,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395910585] [2023-08-04 06:46:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:46:48,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:46:48,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:46:48,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:46:48,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:46:48,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 235 [2023-08-04 06:46:48,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:46:48,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:46:48,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 235 [2023-08-04 06:46:48,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:46:48,845 INFO L124 PetriNetUnfolderBase]: 1998/3472 cut-off events. [2023-08-04 06:46:48,845 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-04 06:46:48,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6748 conditions, 3472 events. 1998/3472 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 22324 event pairs, 516 based on Foata normal form. 125/3178 useless extension candidates. Maximal degree in co-relation 5698. Up to 2194 conditions per place. [2023-08-04 06:46:48,866 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 42 selfloop transitions, 2 changer transitions 8/55 dead transitions. [2023-08-04 06:46:48,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 229 flow [2023-08-04 06:46:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:46:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:46:48,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-08-04 06:46:48,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5460992907801419 [2023-08-04 06:46:48,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-08-04 06:46:48,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-08-04 06:46:48,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:46:48,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-08-04 06:46:48,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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:46:48,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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:46:48,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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:46:48,903 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 85 flow. Second operand 3 states and 385 transitions. [2023-08-04 06:46:48,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 229 flow [2023-08-04 06:46:48,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 55 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:46:48,908 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 69 flow [2023-08-04 06:46:48,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 06:46:48,912 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-04 06:46:48,913 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 69 flow [2023-08-04 06:46:48,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:46:48,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:46:48,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:46:48,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:46:48,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:46:48,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:46:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash -77112684, now seen corresponding path program 1 times [2023-08-04 06:46:48,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:46:48,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062444052] [2023-08-04 06:46:48,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:46:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:49,041 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:46:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:46:49,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062444052] [2023-08-04 06:46:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062444052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:46:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:46:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:46:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186143411] [2023-08-04 06:46:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:46:49,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:46:49,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:46:49,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:46:49,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:46:49,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-08-04 06:46:49,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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:46:49,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:46:49,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-08-04 06:46:49,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:46:49,319 INFO L124 PetriNetUnfolderBase]: 1350/2149 cut-off events. [2023-08-04 06:46:49,320 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2023-08-04 06:46:49,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4493 conditions, 2149 events. 1350/2149 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11242 event pairs, 792 based on Foata normal form. 0/1997 useless extension candidates. Maximal degree in co-relation 4478. Up to 2095 conditions per place. [2023-08-04 06:46:49,333 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 26 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2023-08-04 06:46:49,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 137 flow [2023-08-04 06:46:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:46:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:46:49,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-04 06:46:49,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502127659574468 [2023-08-04 06:46:49,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-04 06:46:49,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-04 06:46:49,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:46:49,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-04 06:46:49,337 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:46:49,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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:46:49,341 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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:46:49,343 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 69 flow. Second operand 3 states and 354 transitions. [2023-08-04 06:46:49,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 137 flow [2023-08-04 06:46:49,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:46:49,349 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 73 flow [2023-08-04 06:46:49,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-04 06:46:49,350 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-08-04 06:46:49,350 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 73 flow [2023-08-04 06:46:49,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 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:46:49,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:46:49,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:46:49,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 06:46:49,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:46:49,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:46:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1319425476, now seen corresponding path program 1 times [2023-08-04 06:46:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:46:49,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032656480] [2023-08-04 06:46:49,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:49,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:46:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:49,434 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:46:49,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:46:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032656480] [2023-08-04 06:46:49,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032656480] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:46:49,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467249998] [2023-08-04 06:46:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:49,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:46:49,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:46:49,443 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:46:49,475 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:46:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:49,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:46:49,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:46:49,574 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:46:49,574 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:46:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467249998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:46:49,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:46:49,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:46:49,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103083951] [2023-08-04 06:46:49,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:46:49,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:46:49,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:46:49,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:46:49,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:46:49,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-08-04 06:46:49,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 73 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:46:49,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:46:49,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-08-04 06:46:49,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:46:49,830 INFO L124 PetriNetUnfolderBase]: 1176/1813 cut-off events. [2023-08-04 06:46:49,830 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 06:46:49,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 1813 events. 1176/1813 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8973 event pairs, 726 based on Foata normal form. 0/1701 useless extension candidates. Maximal degree in co-relation 3649. Up to 1749 conditions per place. [2023-08-04 06:46:49,840 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 29 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2023-08-04 06:46:49,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 151 flow [2023-08-04 06:46:49,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:46:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:46:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-04 06:46:49,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5063829787234042 [2023-08-04 06:46:49,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-04 06:46:49,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-04 06:46:49,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:46:49,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-04 06:46:49,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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:46:49,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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:46:49,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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:46:49,845 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 73 flow. Second operand 3 states and 357 transitions. [2023-08-04 06:46:49,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 151 flow [2023-08-04 06:46:49,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:46:49,847 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 77 flow [2023-08-04 06:46:49,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-04 06:46:49,848 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-04 06:46:49,848 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 77 flow [2023-08-04 06:46:49,848 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:46:49,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:46:49,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:46:49,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 06:46:50,053 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:46:50,054 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:46:50,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:46:50,054 INFO L85 PathProgramCache]: Analyzing trace with hash 175959982, now seen corresponding path program 1 times [2023-08-04 06:46:50,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:46:50,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118549930] [2023-08-04 06:46:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:50,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:46:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:50,109 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:46:50,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:46:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118549930] [2023-08-04 06:46:50,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118549930] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:46:50,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381237031] [2023-08-04 06:46:50,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:50,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:46:50,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:46:50,112 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:46:50,121 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:46:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:50,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:46:50,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:46:50,235 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:46:50,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:46:50,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381237031] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:46:50,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:46:50,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:46:50,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552517542] [2023-08-04 06:46:50,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:46:50,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:46:50,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:46:50,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:46:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:46:50,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 235 [2023-08-04 06:46:50,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:46:50,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:46:50,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 235 [2023-08-04 06:46:50,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:46:50,499 INFO L124 PetriNetUnfolderBase]: 1080/1661 cut-off events. [2023-08-04 06:46:50,499 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-04 06:46:50,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3401 conditions, 1661 events. 1080/1661 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7947 event pairs, 648 based on Foata normal form. 0/1596 useless extension candidates. Maximal degree in co-relation 3385. Up to 1391 conditions per place. [2023-08-04 06:46:50,508 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 32 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2023-08-04 06:46:50,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 167 flow [2023-08-04 06:46:50,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:46:50,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:46:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-04 06:46:50,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2023-08-04 06:46:50,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-04 06:46:50,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-04 06:46:50,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:46:50,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-04 06:46:50,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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:46:50,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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:46:50,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 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:46:50,517 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 77 flow. Second operand 3 states and 360 transitions. [2023-08-04 06:46:50,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 167 flow [2023-08-04 06:46:50,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:46:50,519 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 81 flow [2023-08-04 06:46:50,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-04 06:46:50,521 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-04 06:46:50,521 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 81 flow [2023-08-04 06:46:50,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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:46:50,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:46:50,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:46:50,531 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:46:50,726 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:46:50,726 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:46:50,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:46:50,727 INFO L85 PathProgramCache]: Analyzing trace with hash 973892044, now seen corresponding path program 1 times [2023-08-04 06:46:50,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:46:50,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570898872] [2023-08-04 06:46:50,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:50,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:46:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:50,793 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:46:50,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:46:50,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570898872] [2023-08-04 06:46:50,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570898872] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:46:50,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019022398] [2023-08-04 06:46:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:50,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:46:50,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:46:50,795 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:46:50,799 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:46:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:50,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:46:50,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:46:50,925 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:46:50,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:46:50,942 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:46:50,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019022398] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:46:50,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:46:50,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:46:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23700058] [2023-08-04 06:46:50,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:46:50,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:46:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:46:50,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:46:50,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:46:50,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 235 [2023-08-04 06:46:50,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 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:46:50,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:46:50,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 235 [2023-08-04 06:46:50,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:46:50,987 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 06:46:50,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:46:50,988 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 3. Compared 29 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:46:50,988 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 06:46:50,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 12 transitions, 51 flow [2023-08-04 06:46:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:46:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:46:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2023-08-04 06:46:50,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2023-08-04 06:46:50,990 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 440 transitions. [2023-08-04 06:46:50,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 440 transitions. [2023-08-04 06:46:50,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:46:50,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 440 transitions. [2023-08-04 06:46:50,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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:46:50,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 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:46:50,993 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 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:46:50,993 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 81 flow. Second operand 4 states and 440 transitions. [2023-08-04 06:46:50,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 12 transitions, 51 flow [2023-08-04 06:46:50,994 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:46:50,994 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 06:46:50,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, 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:46:50,997 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -22 predicate places. [2023-08-04 06:46:50,997 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 06:46:50,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 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:46:51,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:46:51,000 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:46:51,001 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:46:51,006 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:46:51,205 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:46:51,206 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 06:46:51,208 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:46:51,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:46:51,242 INFO L124 PetriNetUnfolderBase]: 30/447 cut-off events. [2023-08-04 06:46:51,243 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:46:51,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 447 events. 30/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1968 event pairs, 0 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 06:46:51,244 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 128 transitions, 271 flow [2023-08-04 06:46:51,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 99 transitions, 213 flow [2023-08-04 06:46:51,245 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:46:51,245 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 99 transitions, 213 flow [2023-08-04 06:46:51,245 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 99 transitions, 213 flow [2023-08-04 06:46:51,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 99 transitions, 213 flow [2023-08-04 06:46:51,259 INFO L124 PetriNetUnfolderBase]: 6/215 cut-off events. [2023-08-04 06:46:51,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:46:51,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 215 events. 6/215 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 624 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. [2023-08-04 06:46:51,261 INFO L119 LiptonReduction]: Number of co-enabled transitions 1452 [2023-08-04 06:46:53,703 INFO L134 LiptonReduction]: Checked pairs total: 3719 [2023-08-04 06:46:53,703 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-04 06:46:53,705 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:46:53,705 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;@5fd4873b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:46:53,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:46:53,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:46:53,708 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 06:46:53,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:46:53,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:46:53,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:46:53,708 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:46:53,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:46:53,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1618194944, now seen corresponding path program 1 times [2023-08-04 06:46:53,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:46:53,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537980678] [2023-08-04 06:46:53,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:53,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:46:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:53,745 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:46:53,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:46:53,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537980678] [2023-08-04 06:46:53,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537980678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:46:53,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:46:53,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:46:53,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431242702] [2023-08-04 06:46:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:46:53,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:46:53,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:46:53,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:46:53,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:46:53,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 206 [2023-08-04 06:46:53,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:46:53,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:46:53,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 206 [2023-08-04 06:46:53,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:46:53,858 INFO L124 PetriNetUnfolderBase]: 484/912 cut-off events. [2023-08-04 06:46:53,858 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-08-04 06:46:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1845 conditions, 912 events. 484/912 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4767 event pairs, 240 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1822. Up to 790 conditions per place. [2023-08-04 06:46:53,863 INFO L140 encePairwiseOnDemand]: 203/206 looper letters, 24 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 06:46:53,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 131 flow [2023-08-04 06:46:53,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:46:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:46:53,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-08-04 06:46:53,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5679611650485437 [2023-08-04 06:46:53,865 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-08-04 06:46:53,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-08-04 06:46:53,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:46:53,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-08-04 06:46:53,866 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:46:53,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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:46:53,868 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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:46:53,868 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 69 flow. Second operand 3 states and 351 transitions. [2023-08-04 06:46:53,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 131 flow [2023-08-04 06:46:53,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:46:53,870 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2023-08-04 06:46:53,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, 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:46:53,871 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 06:46:53,872 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2023-08-04 06:46:53,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:46:53,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:46:53,872 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:46:53,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 06:46:53,872 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:46:53,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:46:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1611159000, now seen corresponding path program 1 times [2023-08-04 06:46:53,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:46:53,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507291471] [2023-08-04 06:46:53,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:53,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:46:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:46:53,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:46:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:46:53,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:46:53,910 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:46:53,911 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 06:46:53,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 06:46:53,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 06:46:53,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 06:46:53,911 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:46:53,913 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 06:46:53,913 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:46:53,913 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:46:53,940 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:46:53,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 06:46:54,078 INFO L124 PetriNetUnfolderBase]: 93/1376 cut-off events. [2023-08-04 06:46:54,079 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:46:54,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1376 events. 93/1376 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9463 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 999. Up to 54 conditions per place. [2023-08-04 06:46:54,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 06:46:54,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 153 transitions, 342 flow [2023-08-04 06:46:54,085 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:46:54,085 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-04 06:46:54,085 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 153 transitions, 342 flow [2023-08-04 06:46:54,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 153 transitions, 342 flow [2023-08-04 06:46:54,197 INFO L124 PetriNetUnfolderBase]: 93/1376 cut-off events. [2023-08-04 06:46:54,197 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:46:54,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1376 events. 93/1376 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9463 event pairs, 0 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 999. Up to 54 conditions per place. [2023-08-04 06:46:54,224 INFO L119 LiptonReduction]: Number of co-enabled transitions 6560 [2023-08-04 06:46:57,235 INFO L134 LiptonReduction]: Checked pairs total: 18892 [2023-08-04 06:46:57,236 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-04 06:46:57,237 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:46:57,237 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;@5fd4873b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:46:57,238 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:46:57,240 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:46:57,240 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 06:46:57,240 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:46:57,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:46:57,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 06:46:57,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:46:57,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:46:57,241 INFO L85 PathProgramCache]: Analyzing trace with hash 28539802, now seen corresponding path program 1 times [2023-08-04 06:46:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:46:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121995350] [2023-08-04 06:46:57,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:46:57,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:46:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:46:57,328 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:46:57,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:46:57,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121995350] [2023-08-04 06:46:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121995350] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:46:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:46:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:46:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407333950] [2023-08-04 06:46:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:46:57,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:46:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:46:57,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:46:57,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:46:57,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 267 [2023-08-04 06:46:57,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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:46:57,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:46:57,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 267 [2023-08-04 06:46:57,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:47:43,857 INFO L124 PetriNetUnfolderBase]: 416570/552220 cut-off events. [2023-08-04 06:47:43,858 INFO L125 PetriNetUnfolderBase]: For 7769/7769 co-relation queries the response was YES. [2023-08-04 06:47:44,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085660 conditions, 552220 events. 416570/552220 cut-off events. For 7769/7769 co-relation queries the response was YES. Maximal size of possible extension queue 13944. Compared 4120302 event pairs, 69920 based on Foata normal form. 11907/502289 useless extension candidates. Maximal degree in co-relation 914307. Up to 483093 conditions per place. [2023-08-04 06:47:46,706 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 71 selfloop transitions, 3 changer transitions 0/86 dead transitions. [2023-08-04 06:47:46,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 86 transitions, 377 flow [2023-08-04 06:47:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:47:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:47:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-08-04 06:47:46,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5767790262172284 [2023-08-04 06:47:46,709 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-08-04 06:47:46,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-08-04 06:47:46,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:47:46,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-08-04 06:47:46,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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:47:46,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:47:46,712 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:47:46,712 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 144 flow. Second operand 3 states and 462 transitions. [2023-08-04 06:47:46,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 86 transitions, 377 flow [2023-08-04 06:47:46,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 86 transitions, 371 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 06:47:46,723 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 157 flow [2023-08-04 06:47:46,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=136, 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=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-08-04 06:47:46,724 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-04 06:47:46,724 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 157 flow [2023-08-04 06:47:46,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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:47:46,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:47:46,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:47:46,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 06:47:46,725 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:47:46,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:47:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash -27766615, now seen corresponding path program 1 times [2023-08-04 06:47:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:47:46,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361947875] [2023-08-04 06:47:46,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:47:46,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:47:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:47:46,753 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:47:46,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:47:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361947875] [2023-08-04 06:47:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361947875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:47:46,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:47:46,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:47:46,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711901503] [2023-08-04 06:47:46,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:47:46,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:47:46,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:47:46,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:47:46,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:47:46,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 267 [2023-08-04 06:47:46,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:47:46,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:47:46,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 267 [2023-08-04 06:47:46,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:48:32,019 INFO L124 PetriNetUnfolderBase]: 406640/538682 cut-off events. [2023-08-04 06:48:32,020 INFO L125 PetriNetUnfolderBase]: For 43186/43186 co-relation queries the response was YES. [2023-08-04 06:48:33,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130713 conditions, 538682 events. 406640/538682 cut-off events. For 43186/43186 co-relation queries the response was YES. Maximal size of possible extension queue 13655. Compared 3908131 event pairs, 338422 based on Foata normal form. 0/475295 useless extension candidates. Maximal degree in co-relation 743942. Up to 510975 conditions per place. [2023-08-04 06:48:35,121 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 46 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-04 06:48:35,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 266 flow [2023-08-04 06:48:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:48:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:48:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-04 06:48:35,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5268414481897628 [2023-08-04 06:48:35,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-04 06:48:35,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-04 06:48:35,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:48:35,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-04 06:48:35,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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:48:35,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:48:35,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 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:48:35,131 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 157 flow. Second operand 3 states and 422 transitions. [2023-08-04 06:48:35,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 266 flow [2023-08-04 06:48:35,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:48:35,136 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 166 flow [2023-08-04 06:48:35,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-04 06:48:35,138 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-04 06:48:35,138 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 166 flow [2023-08-04 06:48:35,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:48:35,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:48:35,139 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:48:35,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:48:35,139 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:48:35,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:48:35,139 INFO L85 PathProgramCache]: Analyzing trace with hash 714296324, now seen corresponding path program 1 times [2023-08-04 06:48:35,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:48:35,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810334313] [2023-08-04 06:48:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:48:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:48:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:48:35,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:48:35,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:48:35,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:48:35,179 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:48:35,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:48:35,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:48:35,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:48:35,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:48:35,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 06:48:35,180 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 06:48:35,180 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:48:35,184 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:48:35,184 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:48:35,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:48:35 BasicIcfg [2023-08-04 06:48:35,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:48:35,238 INFO L158 Benchmark]: Toolchain (without parser) took 112360.42ms. Allocated memory was 685.8MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 633.3MB in the beginning and 8.7GB in the end (delta: -8.0GB). Peak memory consumption was 7.3GB. Max. memory is 16.0GB. [2023-08-04 06:48:35,238 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory is still 321.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:48:35,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.25ms. Allocated memory is still 685.8MB. Free memory was 633.0MB in the beginning and 609.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 06:48:35,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.96ms. Allocated memory is still 685.8MB. Free memory was 609.5MB in the beginning and 606.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 06:48:35,239 INFO L158 Benchmark]: Boogie Preprocessor took 49.83ms. Allocated memory is still 685.8MB. Free memory was 606.8MB in the beginning and 604.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:48:35,239 INFO L158 Benchmark]: RCFGBuilder took 686.30ms. Allocated memory is still 685.8MB. Free memory was 604.7MB in the beginning and 634.4MB in the end (delta: -29.7MB). Peak memory consumption was 29.8MB. Max. memory is 16.0GB. [2023-08-04 06:48:35,239 INFO L158 Benchmark]: TraceAbstraction took 111073.68ms. Allocated memory was 685.8MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 633.3MB in the beginning and 8.7GB in the end (delta: -8.0GB). Peak memory consumption was 7.3GB. Max. memory is 16.0GB. [2023-08-04 06:48:35,240 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory is still 321.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 473.25ms. Allocated memory is still 685.8MB. Free memory was 633.0MB in the beginning and 609.5MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.96ms. Allocated memory is still 685.8MB. Free memory was 609.5MB in the beginning and 606.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.83ms. Allocated memory is still 685.8MB. Free memory was 606.8MB in the beginning and 604.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 686.30ms. Allocated memory is still 685.8MB. Free memory was 604.7MB in the beginning and 634.4MB in the end (delta: -29.7MB). Peak memory consumption was 29.8MB. Max. memory is 16.0GB. * TraceAbstraction took 111073.68ms. Allocated memory was 685.8MB in the beginning and 16.0GB in the end (delta: 15.3GB). Free memory was 633.3MB in the beginning and 8.7GB in the end (delta: -8.0GB). Peak memory consumption was 7.3GB. 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.5s, 130 PlacesBefore, 41 PlacesAfterwards, 128 TransitionsBefore, 35 TransitionsAfterwards, 2728 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 107 TotalNumberOfCompositions, 7313 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3154, independent: 2964, independent conditional: 0, independent unconditional: 2964, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1410, independent: 1380, independent conditional: 0, independent unconditional: 1380, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3154, independent: 1584, independent conditional: 0, independent unconditional: 1584, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 1410, unknown conditional: 0, unknown unconditional: 1410] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, 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.5s, 104 PlacesBefore, 34 PlacesAfterwards, 99 TransitionsBefore, 27 TransitionsAfterwards, 1452 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 78 TotalNumberOfCompositions, 3719 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1770, independent: 1644, independent conditional: 0, independent unconditional: 1644, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 717, independent: 701, independent conditional: 0, independent unconditional: 701, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1770, independent: 943, independent conditional: 0, independent unconditional: 943, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 717, unknown conditional: 0, unknown unconditional: 717] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 161 PlacesBefore, 66 PlacesAfterwards, 153 TransitionsBefore, 54 TransitionsAfterwards, 6560 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 114 TotalNumberOfCompositions, 18892 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7486, independent: 7200, independent conditional: 0, independent unconditional: 7200, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3155, independent: 3101, independent conditional: 0, independent unconditional: 3101, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7486, independent: 4099, independent conditional: 0, independent unconditional: 4099, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 3155, unknown conditional: 0, unknown unconditional: 3155] , Statistics on independence cache: Total cache size (in pairs): 338, Positive cache size: 312, Positive conditional cache size: 0, Positive unconditional cache size: 312, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2025[2]; [L819] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2025={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] COND TRUE 0 asdf<2 [L819] FCALL, FORK 0 pthread_create(&t2025[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025[asdf], ((void *)0), P0, ((void *)0))=-1, t2025={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2025={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] COND TRUE 0 asdf<2 [L819] FCALL, FORK 0 pthread_create(&t2025[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2025[asdf], ((void *)0), P0, ((void *)0))=0, t2025={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 2 z$w_buff1 = z$w_buff0 [L742] 2 z$w_buff0 = 2 [L743] 2 z$w_buff1_used = z$w_buff0_used [L744] 2 z$w_buff0_used = (_Bool)1 [L745] CALL 2 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=2, z$w_buff1_used=1, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 261 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 5 mSDtfsCounter, 261 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred 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.6s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 582 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, 174 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: 101.2s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 97.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2 mSDtfsCounter, 168 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=166occurred 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, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 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, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 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, 17 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, 48 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=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:48:35,262 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...