/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe006_power.opt-thin000_power.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 00:14:38,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 00:14:38,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 00:14:38,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 00:14:38,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 00:14:38,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 00:14:38,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 00:14:38,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 00:14:38,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 00:14:38,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 00:14:38,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 00:14:38,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 00:14:38,342 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 00:14:38,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 00:14:38,344 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 00:14:38,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 00:14:38,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 00:14:38,344 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 00:14:38,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 00:14:38,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 00:14:38,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 00:14:38,345 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 00:14:38,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 00:14:38,346 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 00:14:38,347 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 00:14:38,347 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 00:14:38,347 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 00:14:38,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 00:14:38,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 00:14:38,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 00:14:38,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:14:38,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 00:14:38,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 00:14:38,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 00:14:38,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 00:14:38,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 00:14:38,350 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 00:14:38,350 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 00:14:38,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 00:14:38,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 00:14:38,351 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 00:14:38,351 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 00:14:38,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 00:14:38,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 00:14:38,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 00:14:38,572 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 00:14:38,573 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 00:14:38,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe006_power.opt-thin000_power.opt_bound2.i [2023-08-04 00:14:39,645 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 00:14:39,931 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 00:14:39,932 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe006_power.opt-thin000_power.opt_bound2.i [2023-08-04 00:14:39,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37f1d413/1af6b444e70845bd953d3497a9adec8f/FLAGd5888a3ce [2023-08-04 00:14:39,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37f1d413/1af6b444e70845bd953d3497a9adec8f [2023-08-04 00:14:39,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 00:14:39,961 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 00:14:39,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 00:14:39,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 00:14:39,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 00:14:39,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:14:39" (1/1) ... [2023-08-04 00:14:39,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66a08501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:39, skipping insertion in model container [2023-08-04 00:14:39,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:14:39" (1/1) ... [2023-08-04 00:14:40,030 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 00:14:40,206 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_safe006_power.opt-thin000_power.opt_bound2.i[969,982] [2023-08-04 00:14:40,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:14:40,421 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 00:14:40,436 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_safe006_power.opt-thin000_power.opt_bound2.i[969,982] [2023-08-04 00:14:40,444 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 00:14:40,446 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 00:14:40,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:14:40,527 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:14:40,527 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:14:40,533 INFO L206 MainTranslator]: Completed translation [2023-08-04 00:14:40,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40 WrapperNode [2023-08-04 00:14:40,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 00:14:40,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 00:14:40,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 00:14:40,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 00:14:40,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,585 INFO L138 Inliner]: procedures = 175, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2023-08-04 00:14:40,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 00:14:40,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 00:14:40,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 00:14:40,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 00:14:40,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 00:14:40,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 00:14:40,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 00:14:40,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 00:14:40,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (1/1) ... [2023-08-04 00:14:40,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:14:40,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:14:40,674 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 00:14:40,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 00:14:40,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 00:14:40,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 00:14:40,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 00:14:40,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 00:14:40,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 00:14:40,716 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 00:14:40,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 00:14:40,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 00:14:40,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 00:14:40,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 00:14:40,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 00:14:40,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 00:14:40,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 00:14:40,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 00:14:40,719 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 00:14:40,873 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 00:14:40,875 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 00:14:41,293 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 00:14:41,522 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 00:14:41,523 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 00:14:41,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:14:41 BoogieIcfgContainer [2023-08-04 00:14:41,525 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 00:14:41,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 00:14:41,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 00:14:41,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 00:14:41,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 12:14:39" (1/3) ... [2023-08-04 00:14:41,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea19ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:14:41, skipping insertion in model container [2023-08-04 00:14:41,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:14:40" (2/3) ... [2023-08-04 00:14:41,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea19ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:14:41, skipping insertion in model container [2023-08-04 00:14:41,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:14:41" (3/3) ... [2023-08-04 00:14:41,535 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe006_power.opt-thin000_power.opt_bound2.i [2023-08-04 00:14:41,542 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 00:14:41,548 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 00:14:41,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 00:14:41,548 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 00:14:41,598 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:14:41,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 119 transitions, 248 flow [2023-08-04 00:14:41,690 INFO L124 PetriNetUnfolderBase]: 14/234 cut-off events. [2023-08-04 00:14:41,691 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:14:41,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 234 events. 14/234 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 589 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 147. Up to 8 conditions per place. [2023-08-04 00:14:41,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 119 transitions, 248 flow [2023-08-04 00:14:41,699 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 92 transitions, 194 flow [2023-08-04 00:14:41,702 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:14:41,711 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 92 transitions, 194 flow [2023-08-04 00:14:41,713 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 92 transitions, 194 flow [2023-08-04 00:14:41,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 92 transitions, 194 flow [2023-08-04 00:14:41,738 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2023-08-04 00:14:41,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:14:41,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 126 events. 2/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 154 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-08-04 00:14:41,740 INFO L119 LiptonReduction]: Number of co-enabled transitions 652 [2023-08-04 00:14:47,368 INFO L134 LiptonReduction]: Checked pairs total: 1941 [2023-08-04 00:14:47,369 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-04 00:14:47,381 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:14:47,386 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;@13e9f69f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:14:47,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 00:14:47,392 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:14:47,392 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 00:14:47,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:14:47,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:14:47,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 00:14:47,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:14:47,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:14:47,398 INFO L85 PathProgramCache]: Analyzing trace with hash 718278084, now seen corresponding path program 1 times [2023-08-04 00:14:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:14:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531123780] [2023-08-04 00:14:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:14:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:14:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:14:47,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:14:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:14:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531123780] [2023-08-04 00:14:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531123780] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:14:47,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:14:47,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:14:47,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560911266] [2023-08-04 00:14:47,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:14:47,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:14:47,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:14:47,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:14:47,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:14:47,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 197 [2023-08-04 00:14:47,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:47,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:14:47,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 197 [2023-08-04 00:14:47,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:14:47,824 INFO L124 PetriNetUnfolderBase]: 73/177 cut-off events. [2023-08-04 00:14:47,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:14:47,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 177 events. 73/177 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 697 event pairs, 18 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 342. Up to 140 conditions per place. [2023-08-04 00:14:47,829 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 19 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-04 00:14:47,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 100 flow [2023-08-04 00:14:47,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:14:47,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:14:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-04 00:14:47,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5499153976311336 [2023-08-04 00:14:47,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-04 00:14:47,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-04 00:14:47,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:14:47,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-04 00:14:47,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:47,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:47,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:47,867 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 325 transitions. [2023-08-04 00:14:47,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 100 flow [2023-08-04 00:14:47,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:14:47,871 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-04 00:14:47,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-04 00:14:47,876 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-04 00:14:47,876 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-04 00:14:47,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:47,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:14:47,877 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 00:14:47,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 00:14:47,878 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:14:47,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:14:47,879 INFO L85 PathProgramCache]: Analyzing trace with hash 779719287, now seen corresponding path program 1 times [2023-08-04 00:14:47,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:14:47,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674614066] [2023-08-04 00:14:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:14:47,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:14:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:14:47,930 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:14:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:14:47,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:14:47,991 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:14:47,992 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 00:14:47,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 00:14:47,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 00:14:47,994 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 00:14:47,996 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 00:14:47,997 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 00:14:47,997 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 00:14:48,074 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:14:48,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 136 transitions, 296 flow [2023-08-04 00:14:48,172 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-04 00:14:48,172 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 00:14:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 464 events. 30/464 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1852 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 342. Up to 18 conditions per place. [2023-08-04 00:14:48,175 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 136 transitions, 296 flow [2023-08-04 00:14:48,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 242 flow [2023-08-04 00:14:48,177 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:14:48,177 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 242 flow [2023-08-04 00:14:48,177 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 242 flow [2023-08-04 00:14:48,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 242 flow [2023-08-04 00:14:48,214 INFO L124 PetriNetUnfolderBase]: 3/221 cut-off events. [2023-08-04 00:14:48,215 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 00:14:48,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 221 events. 3/221 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 492 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 180. Up to 9 conditions per place. [2023-08-04 00:14:48,221 INFO L119 LiptonReduction]: Number of co-enabled transitions 1816 [2023-08-04 00:14:54,646 INFO L134 LiptonReduction]: Checked pairs total: 7006 [2023-08-04 00:14:54,646 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-04 00:14:54,648 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:14:54,649 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;@13e9f69f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:14:54,649 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 00:14:54,656 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:14:54,656 INFO L124 PetriNetUnfolderBase]: 0/36 cut-off events. [2023-08-04 00:14:54,656 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 00:14:54,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:14:54,656 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-04 00:14:54,656 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:14:54,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:14:54,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1591970798, now seen corresponding path program 1 times [2023-08-04 00:14:54,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:14:54,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107837570] [2023-08-04 00:14:54,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:14:54,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:14:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:14:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:14:54,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:14:54,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107837570] [2023-08-04 00:14:54,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107837570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:14:54,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:14:54,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:14:54,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662145810] [2023-08-04 00:14:54,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:14:54,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:14:54,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:14:54,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:14:54,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:14:54,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 218 [2023-08-04 00:14:54,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:54,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:14:54,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 218 [2023-08-04 00:14:54,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:14:56,195 INFO L124 PetriNetUnfolderBase]: 4463/6926 cut-off events. [2023-08-04 00:14:56,195 INFO L125 PetriNetUnfolderBase]: For 630/630 co-relation queries the response was YES. [2023-08-04 00:14:56,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14081 conditions, 6926 events. 4463/6926 cut-off events. For 630/630 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 42011 event pairs, 2928 based on Foata normal form. 0/6269 useless extension candidates. Maximal degree in co-relation 2931. Up to 6306 conditions per place. [2023-08-04 00:14:56,243 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 30 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-08-04 00:14:56,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 164 flow [2023-08-04 00:14:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:14:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:14:56,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-04 00:14:56,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5596330275229358 [2023-08-04 00:14:56,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-04 00:14:56,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-04 00:14:56,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:14:56,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-04 00:14:56,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:56,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:56,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:56,251 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 3 states and 366 transitions. [2023-08-04 00:14:56,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 164 flow [2023-08-04 00:14:56,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 160 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 00:14:56,256 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 94 flow [2023-08-04 00:14:56,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-04 00:14:56,257 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-04 00:14:56,257 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 94 flow [2023-08-04 00:14:56,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:56,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:14:56,258 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 00:14:56,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 00:14:56,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:14:56,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:14:56,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1205713490, now seen corresponding path program 1 times [2023-08-04 00:14:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:14:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77546421] [2023-08-04 00:14:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:14:56,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:14:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:14:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:14:56,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:14:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77546421] [2023-08-04 00:14:56,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77546421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:14:56,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325773701] [2023-08-04 00:14:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:14:56,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:14:56,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:14:56,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:14:56,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 00:14:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:14:56,513 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:14:56,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:14:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:14:56,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:14:56,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325773701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:14:56,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:14:56,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:14:56,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480041615] [2023-08-04 00:14:56,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:14:56,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:14:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:14:56,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:14:56,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:14:56,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 218 [2023-08-04 00:14:56,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:56,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:14:56,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 218 [2023-08-04 00:14:56,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:14:57,865 INFO L124 PetriNetUnfolderBase]: 4403/6938 cut-off events. [2023-08-04 00:14:57,865 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2023-08-04 00:14:57,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13988 conditions, 6938 events. 4403/6938 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 43074 event pairs, 1638 based on Foata normal form. 36/6371 useless extension candidates. Maximal degree in co-relation 3025. Up to 6121 conditions per place. [2023-08-04 00:14:57,946 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 39 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-04 00:14:57,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 212 flow [2023-08-04 00:14:57,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:14:57,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:14:57,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-04 00:14:57,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.544954128440367 [2023-08-04 00:14:57,949 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-04 00:14:57,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-04 00:14:57,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:14:57,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-04 00:14:57,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:57,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:57,954 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 218.0) internal successors, (1308), 6 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:57,954 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 94 flow. Second operand 5 states and 594 transitions. [2023-08-04 00:14:57,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 212 flow [2023-08-04 00:14:57,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 00:14:57,956 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 108 flow [2023-08-04 00:14:57,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-08-04 00:14:57,957 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-04 00:14:57,957 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 108 flow [2023-08-04 00:14:57,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:57,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:14:57,958 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:14:57,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 00:14:58,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:14:58,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:14:58,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:14:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1779959260, now seen corresponding path program 1 times [2023-08-04 00:14:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:14:58,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681749705] [2023-08-04 00:14:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:14:58,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:14:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:14:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:14:58,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:14:58,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681749705] [2023-08-04 00:14:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681749705] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:14:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634568618] [2023-08-04 00:14:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:14:58,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:14:58,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:14:58,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:14:58,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 00:14:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:14:58,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:14:58,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:14:58,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:14:58,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:14:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:14:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634568618] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:14:58,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:14:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:14:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478706479] [2023-08-04 00:14:58,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:14:58,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:14:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:14:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:14:58,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:14:58,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 218 [2023-08-04 00:14:58,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:58,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:14:58,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 218 [2023-08-04 00:14:58,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:14:59,552 INFO L124 PetriNetUnfolderBase]: 3964/6151 cut-off events. [2023-08-04 00:14:59,552 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2023-08-04 00:14:59,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12525 conditions, 6151 events. 3964/6151 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 36640 event pairs, 1404 based on Foata normal form. 6/5601 useless extension candidates. Maximal degree in co-relation 2736. Up to 5437 conditions per place. [2023-08-04 00:14:59,583 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2023-08-04 00:14:59,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 218 flow [2023-08-04 00:14:59,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:14:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:14:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 00:14:59,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5538990825688074 [2023-08-04 00:14:59,586 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 00:14:59,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 00:14:59,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:14:59,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 00:14:59,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:59,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:59,590 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:59,590 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 108 flow. Second operand 4 states and 483 transitions. [2023-08-04 00:14:59,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 218 flow [2023-08-04 00:14:59,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 213 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 00:14:59,592 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 101 flow [2023-08-04 00:14:59,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-08-04 00:14:59,594 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-04 00:14:59,594 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 101 flow [2023-08-04 00:14:59,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:59,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:14:59,595 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:14:59,605 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 00:14:59,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:14:59,800 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:14:59,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:14:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash -655993497, now seen corresponding path program 1 times [2023-08-04 00:14:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:14:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332851668] [2023-08-04 00:14:59,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:14:59,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:14:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:14:59,887 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:14:59,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:14:59,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332851668] [2023-08-04 00:14:59,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332851668] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:14:59,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:14:59,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 00:14:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849600444] [2023-08-04 00:14:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:14:59,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:14:59,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:14:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:14:59,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:14:59,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 218 [2023-08-04 00:14:59,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:14:59,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:14:59,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 218 [2023-08-04 00:14:59,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:00,511 INFO L124 PetriNetUnfolderBase]: 2140/3498 cut-off events. [2023-08-04 00:15:00,511 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2023-08-04 00:15:00,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 3498 events. 2140/3498 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 19440 event pairs, 100 based on Foata normal form. 576/3710 useless extension candidates. Maximal degree in co-relation 2705. Up to 2460 conditions per place. [2023-08-04 00:15:00,520 INFO L140 encePairwiseOnDemand]: 216/218 looper letters, 0 selfloop transitions, 0 changer transitions 53/53 dead transitions. [2023-08-04 00:15:00,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 241 flow [2023-08-04 00:15:00,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:15:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:15:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-08-04 00:15:00,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5653669724770642 [2023-08-04 00:15:00,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-08-04 00:15:00,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-08-04 00:15:00,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:00,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-08-04 00:15:00,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:00,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:00,526 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:00,526 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 101 flow. Second operand 4 states and 493 transitions. [2023-08-04 00:15:00,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 241 flow [2023-08-04 00:15:00,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 00:15:00,534 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-04 00:15:00,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=45, PETRI_TRANSITIONS=0} [2023-08-04 00:15:00,535 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-04 00:15:00,535 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-04 00:15:00,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:00,535 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 00:15:00,536 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 00:15:00,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 00:15:00,536 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 00:15:00,536 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 00:15:00,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 136 transitions, 296 flow [2023-08-04 00:15:00,578 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-04 00:15:00,578 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 00:15:00,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 464 events. 30/464 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1852 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 342. Up to 18 conditions per place. [2023-08-04 00:15:00,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 136 transitions, 296 flow [2023-08-04 00:15:00,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 136 transitions, 296 flow [2023-08-04 00:15:00,581 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:15:00,581 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 136 transitions, 296 flow [2023-08-04 00:15:00,582 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 136 transitions, 296 flow [2023-08-04 00:15:00,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 136 transitions, 296 flow [2023-08-04 00:15:00,620 INFO L124 PetriNetUnfolderBase]: 30/464 cut-off events. [2023-08-04 00:15:00,620 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 00:15:00,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 497 conditions, 464 events. 30/464 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1852 event pairs, 0 based on Foata normal form. 0/411 useless extension candidates. Maximal degree in co-relation 342. Up to 18 conditions per place. [2023-08-04 00:15:00,626 INFO L119 LiptonReduction]: Number of co-enabled transitions 3436 [2023-08-04 00:15:07,948 INFO L134 LiptonReduction]: Checked pairs total: 11719 [2023-08-04 00:15:07,948 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-04 00:15:07,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 00:15:07,950 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;@13e9f69f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:15:07,950 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 00:15:07,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:15:07,954 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 00:15:07,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:15:07,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:07,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 00:15:07,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:15:07,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1049714843, now seen corresponding path program 1 times [2023-08-04 00:15:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:07,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297286751] [2023-08-04 00:15:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:07,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:15:08,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297286751] [2023-08-04 00:15:08,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297286751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:08,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:15:08,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:15:08,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713410129] [2023-08-04 00:15:08,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:08,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:15:08,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:08,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:15:08,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:15:08,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-08-04 00:15:08,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:08,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:08,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-08-04 00:15:08,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:11,516 INFO L124 PetriNetUnfolderBase]: 16958/24761 cut-off events. [2023-08-04 00:15:11,517 INFO L125 PetriNetUnfolderBase]: For 648/648 co-relation queries the response was YES. [2023-08-04 00:15:11,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48857 conditions, 24761 events. 16958/24761 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 889. Compared 155177 event pairs, 11748 based on Foata normal form. 0/20903 useless extension candidates. Maximal degree in co-relation 9595. Up to 23211 conditions per place. [2023-08-04 00:15:11,712 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 35 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-04 00:15:11,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 184 flow [2023-08-04 00:15:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:15:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:15:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2023-08-04 00:15:11,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966532797858099 [2023-08-04 00:15:11,715 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2023-08-04 00:15:11,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2023-08-04 00:15:11,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:11,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2023-08-04 00:15:11,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:11,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:11,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:11,718 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 96 flow. Second operand 3 states and 371 transitions. [2023-08-04 00:15:11,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 184 flow [2023-08-04 00:15:11,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 180 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 00:15:11,724 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 104 flow [2023-08-04 00:15:11,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-04 00:15:11,726 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2023-08-04 00:15:11,726 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 104 flow [2023-08-04 00:15:11,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:11,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:11,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 00:15:11,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 00:15:11,726 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:15:11,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1049423600, now seen corresponding path program 1 times [2023-08-04 00:15:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190060937] [2023-08-04 00:15:11,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:15:11,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:11,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190060937] [2023-08-04 00:15:11,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190060937] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:11,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:15:11,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 00:15:11,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521786664] [2023-08-04 00:15:11,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:11,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:15:11,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:11,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:15:11,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:15:11,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 249 [2023-08-04 00:15:11,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:11,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:11,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 249 [2023-08-04 00:15:11,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:14,947 INFO L124 PetriNetUnfolderBase]: 14280/19891 cut-off events. [2023-08-04 00:15:14,947 INFO L125 PetriNetUnfolderBase]: For 534/534 co-relation queries the response was YES. [2023-08-04 00:15:14,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40164 conditions, 19891 events. 14280/19891 cut-off events. For 534/534 co-relation queries the response was YES. Maximal size of possible extension queue 710. Compared 117892 event pairs, 3276 based on Foata normal form. 0/17429 useless extension candidates. Maximal degree in co-relation 40118. Up to 16965 conditions per place. [2023-08-04 00:15:15,029 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 51 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-04 00:15:15,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 278 flow [2023-08-04 00:15:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:15:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:15:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-04 00:15:15,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301204819277109 [2023-08-04 00:15:15,031 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-04 00:15:15,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-04 00:15:15,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:15,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-04 00:15:15,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:15,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:15,034 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:15,034 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 104 flow. Second operand 3 states and 396 transitions. [2023-08-04 00:15:15,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 278 flow [2023-08-04 00:15:15,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 275 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:15:15,036 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 123 flow [2023-08-04 00:15:15,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-04 00:15:15,037 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2023-08-04 00:15:15,037 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 123 flow [2023-08-04 00:15:15,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:15,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:15,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:15,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 00:15:15,038 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:15:15,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:15,038 INFO L85 PathProgramCache]: Analyzing trace with hash -711249430, now seen corresponding path program 1 times [2023-08-04 00:15:15,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:15,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65360791] [2023-08-04 00:15:15,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:15,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:15,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:15:15,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:15,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65360791] [2023-08-04 00:15:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65360791] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:15,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560992903] [2023-08-04 00:15:15,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:15,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:15,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:15,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:15,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 00:15:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:15,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:15:15,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:15,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:15:15,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:15:15,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560992903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:15,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:15:15,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:15:15,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778548148] [2023-08-04 00:15:15,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:15,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:15:15,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:15,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:15:15,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:15:15,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2023-08-04 00:15:15,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:15,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:15,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2023-08-04 00:15:15,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:17,891 INFO L124 PetriNetUnfolderBase]: 14064/20375 cut-off events. [2023-08-04 00:15:17,892 INFO L125 PetriNetUnfolderBase]: For 1774/1774 co-relation queries the response was YES. [2023-08-04 00:15:17,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43603 conditions, 20375 events. 14064/20375 cut-off events. For 1774/1774 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 123521 event pairs, 9651 based on Foata normal form. 0/17740 useless extension candidates. Maximal degree in co-relation 21073. Up to 18747 conditions per place. [2023-08-04 00:15:17,993 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 48 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-04 00:15:17,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 271 flow [2023-08-04 00:15:17,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:15:17,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:15:17,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-04 00:15:17,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073627844712182 [2023-08-04 00:15:17,995 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-04 00:15:17,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-04 00:15:17,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:17,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-04 00:15:17,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:17,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:17,998 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:17,998 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 123 flow. Second operand 3 states and 379 transitions. [2023-08-04 00:15:17,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 271 flow [2023-08-04 00:15:18,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:15:18,001 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 132 flow [2023-08-04 00:15:18,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-08-04 00:15:18,002 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2023-08-04 00:15:18,002 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 132 flow [2023-08-04 00:15:18,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:18,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:18,002 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:18,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 00:15:18,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:18,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 00:15:18,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash -778950703, now seen corresponding path program 1 times [2023-08-04 00:15:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:18,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635620035] [2023-08-04 00:15:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:15:18,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:15:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:15:18,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:15:18,259 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:15:18,259 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 00:15:18,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 00:15:18,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 00:15:18,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 00:15:18,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 00:15:18,260 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 00:15:18,261 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-04 00:15:18,263 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 00:15:18,263 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 00:15:18,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 12:15:18 BasicIcfg [2023-08-04 00:15:18,327 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 00:15:18,327 INFO L158 Benchmark]: Toolchain (without parser) took 38365.70ms. Allocated memory was 461.4MB in the beginning and 2.3GB in the end (delta: 1.9GB). Free memory was 413.3MB in the beginning and 1.2GB in the end (delta: -763.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-04 00:15:18,327 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 333.4MB. Free memory is still 286.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 00:15:18,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 572.00ms. Allocated memory is still 461.4MB. Free memory was 412.9MB in the beginning and 389.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 00:15:18,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.65ms. Allocated memory is still 461.4MB. Free memory was 389.1MB in the beginning and 386.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 00:15:18,328 INFO L158 Benchmark]: Boogie Preprocessor took 32.87ms. Allocated memory is still 461.4MB. Free memory was 386.5MB in the beginning and 384.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 00:15:18,328 INFO L158 Benchmark]: RCFGBuilder took 905.73ms. Allocated memory is still 461.4MB. Free memory was 384.4MB in the beginning and 375.6MB in the end (delta: 8.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. [2023-08-04 00:15:18,329 INFO L158 Benchmark]: TraceAbstraction took 36799.12ms. Allocated memory was 461.4MB in the beginning and 2.3GB in the end (delta: 1.9GB). Free memory was 374.6MB in the beginning and 1.2GB in the end (delta: -802.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-04 00:15:18,330 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.12ms. Allocated memory is still 333.4MB. Free memory is still 286.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 572.00ms. Allocated memory is still 461.4MB. Free memory was 412.9MB in the beginning and 389.1MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.65ms. Allocated memory is still 461.4MB. Free memory was 389.1MB in the beginning and 386.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.87ms. Allocated memory is still 461.4MB. Free memory was 386.5MB in the beginning and 384.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 905.73ms. Allocated memory is still 461.4MB. Free memory was 384.4MB in the beginning and 375.6MB in the end (delta: 8.7MB). Peak memory consumption was 27.6MB. Max. memory is 16.0GB. * TraceAbstraction took 36799.12ms. Allocated memory was 461.4MB in the beginning and 2.3GB in the end (delta: 1.9GB). Free memory was 374.6MB in the beginning and 1.2GB in the end (delta: -802.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 96 PlacesBefore, 23 PlacesAfterwards, 92 TransitionsBefore, 18 TransitionsAfterwards, 652 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 1941 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1271, independent: 1143, independent conditional: 0, independent unconditional: 1143, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 366, independent: 348, independent conditional: 0, independent unconditional: 348, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1271, independent: 795, independent conditional: 0, independent unconditional: 795, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 366, unknown conditional: 0, unknown unconditional: 366] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, 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: 6.5s, 117 PlacesBefore, 40 PlacesAfterwards, 109 TransitionsBefore, 31 TransitionsAfterwards, 1816 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 7006 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2750, independent: 2507, independent conditional: 0, independent unconditional: 2507, dependent: 243, dependent conditional: 0, dependent unconditional: 243, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 876, independent: 847, independent conditional: 0, independent unconditional: 847, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2750, independent: 1660, independent conditional: 0, independent unconditional: 1660, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 876, unknown conditional: 0, unknown unconditional: 876] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4s, 141 PlacesBefore, 45 PlacesAfterwards, 136 TransitionsBefore, 36 TransitionsAfterwards, 3436 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 113 TotalNumberOfCompositions, 11719 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5110, independent: 4809, independent conditional: 0, independent unconditional: 4809, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1780, independent: 1725, independent conditional: 0, independent unconditional: 1725, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5110, independent: 3084, independent conditional: 0, independent unconditional: 3084, dependent: 246, dependent conditional: 0, dependent unconditional: 246, unknown: 1780, unknown conditional: 0, unknown unconditional: 1780] , Statistics on independence cache: Total cache size (in pairs): 230, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L713] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L714] 0 int __unbuffered_p1_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L721] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L722] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L723] 0 int __unbuffered_p1_EAX$w_buff0; [L724] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L725] 0 int __unbuffered_p1_EAX$w_buff1; [L726] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L727] 0 _Bool main$tmp_guard0; [L728] 0 _Bool main$tmp_guard1; [L730] 0 int x = 0; [L731] 0 _Bool x$flush_delayed; [L732] 0 int x$mem_tmp; [L733] 0 _Bool x$r_buff0_thd0; [L734] 0 _Bool x$r_buff0_thd1; [L735] 0 _Bool x$r_buff0_thd2; [L736] 0 _Bool x$r_buff1_thd0; [L737] 0 _Bool x$r_buff1_thd1; [L738] 0 _Bool x$r_buff1_thd2; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice1; [L749] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1923[2]; [L826] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1923={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] COND TRUE 0 asdf<2 [L826] FCALL, FORK 0 pthread_create(&t1923[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923[asdf], ((void *)0), P0, ((void *)0))=-2, t1923={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1923={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] COND TRUE 0 asdf<2 [L753] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L756] 1 x$w_buff1 = x$w_buff0 [L757] 1 x$w_buff0 = 1 [L758] 1 x$w_buff1_used = x$w_buff0_used [L759] 1 x$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 1 x$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] FCALL, FORK 0 pthread_create(&t1923[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1923[asdf], ((void *)0), P0, ((void *)0))=-1, t1923={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L753] 2 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 1 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 133 locations, 5 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.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 39 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=54occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.5s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 151 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 310 IncrementalHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 2 mSDtfsCounter, 310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=2, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 42/50 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 203 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 1 mSDtfsCounter, 203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 46 SizeOfPredicates, 0 NumberOfNonLiveVariables, 185 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 00:15:18,351 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...