/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_safe029_power.opt_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 01:07:08,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 01:07:08,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 01:07:08,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 01:07:08,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 01:07:08,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 01:07:08,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 01:07:08,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 01:07:08,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 01:07:08,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 01:07:08,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 01:07:08,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 01:07:08,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 01:07:08,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 01:07:08,797 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 01:07:08,797 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 01:07:08,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 01:07:08,798 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 01:07:08,798 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 01:07:08,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 01:07:08,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 01:07:08,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 01:07:08,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 01:07:08,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 01:07:08,799 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 01:07:08,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 01:07:08,800 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 01:07:08,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 01:07:08,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 01:07:08,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 01:07:08,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:07:08,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 01:07:08,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 01:07:08,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 01:07:08,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 01:07:08,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 01:07:08,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 01:07:08,802 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 01:07:08,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 01:07:08,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 01:07:08,803 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 01:07:08,803 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 01:07:09,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 01:07:09,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 01:07:09,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 01:07:09,027 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 01:07:09,028 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 01:07:09,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 01:07:10,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 01:07:10,462 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 01:07:10,463 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 01:07:10,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba2d4761/b655496b1ad7435893c7e28a5d2dd513/FLAG25bb09d7f [2023-08-04 01:07:10,491 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba2d4761/b655496b1ad7435893c7e28a5d2dd513 [2023-08-04 01:07:10,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 01:07:10,499 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 01:07:10,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 01:07:10,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 01:07:10,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 01:07:10,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:10,507 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f2b5865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10, skipping insertion in model container [2023-08-04 01:07:10,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:10,570 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 01:07:10,721 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_safe029_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-04 01:07:10,869 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:07:10,879 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 01:07:10,894 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_safe029_power.opt_pso.opt_rmo.opt_bound2.i[967,980] [2023-08-04 01:07:10,913 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 01:07:10,915 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 01:07:10,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 01:07:10,987 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 01:07:10,987 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 01:07:10,993 INFO L206 MainTranslator]: Completed translation [2023-08-04 01:07:10,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10 WrapperNode [2023-08-04 01:07:10,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 01:07:10,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 01:07:10,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 01:07:10,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 01:07:11,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,063 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-04 01:07:11,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 01:07:11,064 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 01:07:11,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 01:07:11,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 01:07:11,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,088 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 01:07:11,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 01:07:11,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 01:07:11,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 01:07:11,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (1/1) ... [2023-08-04 01:07:11,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 01:07:11,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:07:11,166 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 01:07:11,199 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 01:07:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 01:07:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 01:07:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 01:07:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 01:07:11,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 01:07:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 01:07:11,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 01:07:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 01:07:11,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 01:07:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 01:07:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 01:07:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 01:07:11,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 01:07:11,215 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 01:07:11,359 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 01:07:11,360 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 01:07:11,602 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 01:07:11,745 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 01:07:11,745 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 01:07:11,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:07:11 BoogieIcfgContainer [2023-08-04 01:07:11,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 01:07:11,750 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 01:07:11,750 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 01:07:11,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 01:07:11,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 01:07:10" (1/3) ... [2023-08-04 01:07:11,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6463f6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:07:11, skipping insertion in model container [2023-08-04 01:07:11,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 01:07:10" (2/3) ... [2023-08-04 01:07:11,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6463f6f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 01:07:11, skipping insertion in model container [2023-08-04 01:07:11,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 01:07:11" (3/3) ... [2023-08-04 01:07:11,757 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe029_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 01:07:11,764 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 01:07:11,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 01:07:11,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 01:07:11,773 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 01:07:11,823 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 01:07:11,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 100 transitions, 210 flow [2023-08-04 01:07:11,967 INFO L124 PetriNetUnfolderBase]: 14/216 cut-off events. [2023-08-04 01:07:11,967 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:07:11,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 216 events. 14/216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 603 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-04 01:07:11,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 100 transitions, 210 flow [2023-08-04 01:07:11,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 73 transitions, 156 flow [2023-08-04 01:07:11,984 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:07:12,002 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 73 transitions, 156 flow [2023-08-04 01:07:12,005 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 73 transitions, 156 flow [2023-08-04 01:07:12,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 73 transitions, 156 flow [2023-08-04 01:07:12,030 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2023-08-04 01:07:12,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:07:12,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 157 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2023-08-04 01:07:12,033 INFO L119 LiptonReduction]: Number of co-enabled transitions 622 [2023-08-04 01:07:14,286 INFO L134 LiptonReduction]: Checked pairs total: 1479 [2023-08-04 01:07:14,287 INFO L136 LiptonReduction]: Total number of compositions: 60 [2023-08-04 01:07:14,298 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:07:14,303 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;@512edd2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:07:14,303 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 01:07:14,307 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:07:14,307 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 01:07:14,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:07:14,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:14,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 01:07:14,308 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:07:14,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:14,312 INFO L85 PathProgramCache]: Analyzing trace with hash 409160224, now seen corresponding path program 1 times [2023-08-04 01:07:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:14,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865062013] [2023-08-04 01:07:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:14,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:14,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:14,491 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 01:07:14,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:14,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865062013] [2023-08-04 01:07:14,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865062013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:07:14,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:07:14,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:07:14,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551487382] [2023-08-04 01:07:14,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:07:14,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:07:14,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:07:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:07:14,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 160 [2023-08-04 01:07:14,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 01:07:14,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:14,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 160 [2023-08-04 01:07:14,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:14,604 INFO L124 PetriNetUnfolderBase]: 55/138 cut-off events. [2023-08-04 01:07:14,605 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:07:14,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 138 events. 55/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 547 event pairs, 16 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 265. Up to 108 conditions per place. [2023-08-04 01:07:14,607 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 16 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-08-04 01:07:14,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 90 flow [2023-08-04 01:07:14,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:07:14,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:07:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2023-08-04 01:07:14,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2023-08-04 01:07:14,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 268 transitions. [2023-08-04 01:07:14,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 268 transitions. [2023-08-04 01:07:14,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:14,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 268 transitions. [2023-08-04 01:07:14,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 01:07:14,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 01:07:14,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 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 01:07:14,631 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 46 flow. Second operand 3 states and 268 transitions. [2023-08-04 01:07:14,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 90 flow [2023-08-04 01:07:14,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 22 transitions, 90 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 01:07:14,635 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 54 flow [2023-08-04 01:07:14,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, 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 01:07:14,639 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-04 01:07:14,639 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 54 flow [2023-08-04 01:07:14,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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 01:07:14,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:14,640 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 01:07:14,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 01:07:14,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:07:14,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:14,641 INFO L85 PathProgramCache]: Analyzing trace with hash -210236654, now seen corresponding path program 1 times [2023-08-04 01:07:14,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:14,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547859800] [2023-08-04 01:07:14,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:14,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:07:14,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:07:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:07:14,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:07:14,692 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:07:14,693 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 01:07:14,695 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 01:07:14,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 01:07:14,695 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 01:07:14,697 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 01:07:14,698 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 01:07:14,698 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 01:07:14,723 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 01:07:14,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 117 transitions, 258 flow [2023-08-04 01:07:14,811 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-04 01:07:14,811 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 01:07:14,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 449 events. 30/449 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1896 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 324. Up to 18 conditions per place. [2023-08-04 01:07:14,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 117 transitions, 258 flow [2023-08-04 01:07:14,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 204 flow [2023-08-04 01:07:14,814 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:07:14,814 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 204 flow [2023-08-04 01:07:14,814 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 204 flow [2023-08-04 01:07:14,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 204 flow [2023-08-04 01:07:14,833 INFO L124 PetriNetUnfolderBase]: 3/206 cut-off events. [2023-08-04 01:07:14,833 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 01:07:14,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 206 events. 3/206 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 515 event pairs, 0 based on Foata normal form. 0/194 useless extension candidates. Maximal degree in co-relation 162. Up to 9 conditions per place. [2023-08-04 01:07:14,836 INFO L119 LiptonReduction]: Number of co-enabled transitions 1752 [2023-08-04 01:07:17,105 INFO L134 LiptonReduction]: Checked pairs total: 5810 [2023-08-04 01:07:17,106 INFO L136 LiptonReduction]: Total number of compositions: 65 [2023-08-04 01:07:17,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 01:07:17,109 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;@512edd2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:07:17,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 01:07:17,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:07:17,117 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2023-08-04 01:07:17,118 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 01:07:17,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:17,118 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-04 01:07:17,118 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:07:17,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:17,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1311462185, now seen corresponding path program 1 times [2023-08-04 01:07:17,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:17,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672832942] [2023-08-04 01:07:17,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:17,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:17,195 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 01:07:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:17,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672832942] [2023-08-04 01:07:17,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672832942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:07:17,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:07:17,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:07:17,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655125855] [2023-08-04 01:07:17,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:07:17,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:07:17,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:17,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:07:17,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:07:17,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 182 [2023-08-04 01:07:17,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 01:07:17,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:17,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 182 [2023-08-04 01:07:17,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:17,719 INFO L124 PetriNetUnfolderBase]: 2993/4677 cut-off events. [2023-08-04 01:07:17,719 INFO L125 PetriNetUnfolderBase]: For 368/368 co-relation queries the response was YES. [2023-08-04 01:07:17,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9448 conditions, 4677 events. 2993/4677 cut-off events. For 368/368 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 28028 event pairs, 2036 based on Foata normal form. 0/4180 useless extension candidates. Maximal degree in co-relation 2083. Up to 4270 conditions per place. [2023-08-04 01:07:17,757 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 26 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2023-08-04 01:07:17,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 152 flow [2023-08-04 01:07:17,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:07:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:07:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-04 01:07:17,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5695970695970696 [2023-08-04 01:07:17,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-04 01:07:17,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-04 01:07:17,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:17,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-04 01:07:17,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 01:07:17,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 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 01:07:17,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 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 01:07:17,764 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 3 states and 311 transitions. [2023-08-04 01:07:17,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 152 flow [2023-08-04 01:07:17,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 148 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 01:07:17,768 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 94 flow [2023-08-04 01:07:17,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, 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 01:07:17,769 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-04 01:07:17,769 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 94 flow [2023-08-04 01:07:17,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 01:07:17,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:17,770 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 01:07:17,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 01:07:17,770 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:07:17,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:17,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1819802747, now seen corresponding path program 1 times [2023-08-04 01:07:17,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:17,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098822090] [2023-08-04 01:07:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:17,886 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 01:07:17,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:17,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098822090] [2023-08-04 01:07:17,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098822090] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:07:17,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602374495] [2023-08-04 01:07:17,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:17,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:07:17,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:07:17,897 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 01:07:17,952 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 01:07:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:18,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 01:07:18,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:07:18,081 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 01:07:18,081 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 01:07:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602374495] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:07:18,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 01:07:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 01:07:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512016964] [2023-08-04 01:07:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:07:18,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:07:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:18,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:07:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 01:07:18,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 182 [2023-08-04 01:07:18,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 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 01:07:18,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:18,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 182 [2023-08-04 01:07:18,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:18,658 INFO L124 PetriNetUnfolderBase]: 2969/4625 cut-off events. [2023-08-04 01:07:18,658 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2023-08-04 01:07:18,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9347 conditions, 4625 events. 2969/4625 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 27905 event pairs, 1280 based on Foata normal form. 16/4160 useless extension candidates. Maximal degree in co-relation 2485. Up to 4187 conditions per place. [2023-08-04 01:07:18,688 INFO L140 encePairwiseOnDemand]: 178/182 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-04 01:07:18,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 184 flow [2023-08-04 01:07:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 01:07:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 01:07:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2023-08-04 01:07:18,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5505494505494506 [2023-08-04 01:07:18,691 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2023-08-04 01:07:18,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2023-08-04 01:07:18,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:18,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2023-08-04 01:07:18,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 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 01:07:18,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:07:18,697 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:07:18,698 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 94 flow. Second operand 5 states and 501 transitions. [2023-08-04 01:07:18,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 184 flow [2023-08-04 01:07:18,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 01:07:18,701 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 108 flow [2023-08-04 01:07:18,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, 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 01:07:18,703 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-04 01:07:18,703 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 108 flow [2023-08-04 01:07:18,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.6) internal successors, (473), 5 states have internal predecessors, (473), 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 01:07:18,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:18,704 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:07:18,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 01:07:18,913 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 01:07:18,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:07:18,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:18,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1824327835, now seen corresponding path program 1 times [2023-08-04 01:07:18,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:18,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797311350] [2023-08-04 01:07:18,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:18,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:18,982 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 01:07:18,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:18,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797311350] [2023-08-04 01:07:18,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797311350] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:07:18,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857957089] [2023-08-04 01:07:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:18,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:07:18,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:07:18,985 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 01:07:19,006 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 01:07:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:19,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:07:19,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:07:19,083 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 01:07:19,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:07:19,099 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 01:07:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857957089] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:07:19,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:07:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:07:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533251863] [2023-08-04 01:07:19,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:07:19,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:07:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:07:19,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:07:19,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 182 [2023-08-04 01:07:19,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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 01:07:19,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:19,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 182 [2023-08-04 01:07:19,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:19,573 INFO L124 PetriNetUnfolderBase]: 2530/3866 cut-off events. [2023-08-04 01:07:19,573 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2023-08-04 01:07:19,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7872 conditions, 3866 events. 2530/3866 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 21919 event pairs, 1024 based on Foata normal form. 4/3485 useless extension candidates. Maximal degree in co-relation 2073. Up to 3505 conditions per place. [2023-08-04 01:07:19,595 INFO L140 encePairwiseOnDemand]: 179/182 looper letters, 31 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-04 01:07:19,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 190 flow [2023-08-04 01:07:19,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:07:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:07:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 407 transitions. [2023-08-04 01:07:19,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590659340659341 [2023-08-04 01:07:19,597 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 407 transitions. [2023-08-04 01:07:19,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 407 transitions. [2023-08-04 01:07:19,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:19,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 407 transitions. [2023-08-04 01:07:19,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:07:19,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 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 01:07:19,600 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 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 01:07:19,600 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 108 flow. Second operand 4 states and 407 transitions. [2023-08-04 01:07:19,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 190 flow [2023-08-04 01:07:19,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 41 transitions, 185 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 01:07:19,602 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 101 flow [2023-08-04 01:07:19,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, 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 01:07:19,603 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-04 01:07:19,603 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 101 flow [2023-08-04 01:07:19,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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 01:07:19,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:19,604 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:07:19,615 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 01:07:19,810 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 01:07:19,810 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 01:07:19,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:19,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1120797260, now seen corresponding path program 1 times [2023-08-04 01:07:19,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:19,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779193731] [2023-08-04 01:07:19,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:19,857 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 01:07:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:19,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779193731] [2023-08-04 01:07:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779193731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:07:19,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:07:19,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 01:07:19,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219135404] [2023-08-04 01:07:19,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:07:19,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 01:07:19,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:19,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 01:07:19,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 01:07:19,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 182 [2023-08-04 01:07:19,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:07:19,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:19,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 182 [2023-08-04 01:07:19,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:20,107 INFO L124 PetriNetUnfolderBase]: 1290/2119 cut-off events. [2023-08-04 01:07:20,108 INFO L125 PetriNetUnfolderBase]: For 245/245 co-relation queries the response was YES. [2023-08-04 01:07:20,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4425 conditions, 2119 events. 1290/2119 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11491 event pairs, 42 based on Foata normal form. 400/2326 useless extension candidates. Maximal degree in co-relation 2013. Up to 1584 conditions per place. [2023-08-04 01:07:20,115 INFO L140 encePairwiseOnDemand]: 180/182 looper letters, 0 selfloop transitions, 0 changer transitions 46/46 dead transitions. [2023-08-04 01:07:20,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 46 transitions, 209 flow [2023-08-04 01:07:20,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:07:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:07:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 416 transitions. [2023-08-04 01:07:20,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2023-08-04 01:07:20,116 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 416 transitions. [2023-08-04 01:07:20,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 416 transitions. [2023-08-04 01:07:20,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:20,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 416 transitions. [2023-08-04 01:07:20,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 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 01:07:20,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 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 01:07:20,120 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 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 01:07:20,120 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 101 flow. Second operand 4 states and 416 transitions. [2023-08-04 01:07:20,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 46 transitions, 209 flow [2023-08-04 01:07:20,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 01:07:20,124 INFO L231 Difference]: Finished difference. Result has 45 places, 0 transitions, 0 flow [2023-08-04 01:07:20,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, 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 01:07:20,124 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-04 01:07:20,125 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 0 transitions, 0 flow [2023-08-04 01:07:20,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 01:07:20,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 01:07:20,125 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 01:07:20,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 01:07:20,126 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 01:07:20,126 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 01:07:20,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 117 transitions, 258 flow [2023-08-04 01:07:20,162 INFO L124 PetriNetUnfolderBase]: 30/449 cut-off events. [2023-08-04 01:07:20,162 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 01:07:20,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 449 events. 30/449 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1896 event pairs, 0 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 324. Up to 18 conditions per place. [2023-08-04 01:07:20,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 117 transitions, 258 flow [2023-08-04 01:07:20,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 116 transitions, 252 flow [2023-08-04 01:07:20,166 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 01:07:20,166 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 116 transitions, 252 flow [2023-08-04 01:07:20,166 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 116 transitions, 252 flow [2023-08-04 01:07:20,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 116 transitions, 252 flow [2023-08-04 01:07:20,197 INFO L124 PetriNetUnfolderBase]: 30/448 cut-off events. [2023-08-04 01:07:20,197 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 01:07:20,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 448 events. 30/448 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1891 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 321. Up to 18 conditions per place. [2023-08-04 01:07:20,203 INFO L119 LiptonReduction]: Number of co-enabled transitions 3344 [2023-08-04 01:07:22,949 INFO L134 LiptonReduction]: Checked pairs total: 9121 [2023-08-04 01:07:22,949 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-04 01:07:22,951 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 01:07:22,951 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;@512edd2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 01:07:22,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 01:07:22,953 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 01:07:22,954 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-04 01:07:22,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 01:07:22,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:22,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 01:07:22,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 01:07:22,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:22,954 INFO L85 PathProgramCache]: Analyzing trace with hash 686499753, now seen corresponding path program 1 times [2023-08-04 01:07:22,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:22,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949643139] [2023-08-04 01:07:22,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:22,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:22,995 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 01:07:22,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949643139] [2023-08-04 01:07:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949643139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:07:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:07:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 01:07:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090758726] [2023-08-04 01:07:22,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:07:22,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:07:22,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:22,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:07:22,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:07:23,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-08-04 01:07:23,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 01:07:23,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:23,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-08-04 01:07:23,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:24,904 INFO L124 PetriNetUnfolderBase]: 15012/21876 cut-off events. [2023-08-04 01:07:24,905 INFO L125 PetriNetUnfolderBase]: For 380/380 co-relation queries the response was YES. [2023-08-04 01:07:24,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43030 conditions, 21876 events. 15012/21876 cut-off events. For 380/380 co-relation queries the response was YES. Maximal size of possible extension queue 885. Compared 139788 event pairs, 10800 based on Foata normal form. 620/18527 useless extension candidates. Maximal degree in co-relation 9500. Up to 20629 conditions per place. [2023-08-04 01:07:25,005 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 33 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-04 01:07:25,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 174 flow [2023-08-04 01:07:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:07:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:07:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 319 transitions. [2023-08-04 01:07:25,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-04 01:07:25,007 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 319 transitions. [2023-08-04 01:07:25,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 319 transitions. [2023-08-04 01:07:25,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:25,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 319 transitions. [2023-08-04 01:07:25,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 01:07:25,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 01:07:25,011 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 01:07:25,011 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 96 flow. Second operand 3 states and 319 transitions. [2023-08-04 01:07:25,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 174 flow [2023-08-04 01:07:25,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 172 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 01:07:25,015 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 104 flow [2023-08-04 01:07:25,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-04 01:07:25,016 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-08-04 01:07:25,016 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 104 flow [2023-08-04 01:07:25,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 01:07:25,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:25,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:07:25,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 01:07:25,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 01:07:25,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2064930098, now seen corresponding path program 1 times [2023-08-04 01:07:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:25,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236051533] [2023-08-04 01:07:25,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:25,062 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 01:07:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:25,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236051533] [2023-08-04 01:07:25,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236051533] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 01:07:25,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545569053] [2023-08-04 01:07:25,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:25,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:07:25,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 01:07:25,066 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 01:07:25,093 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 01:07:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:25,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 01:07:25,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 01:07:25,161 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 01:07:25,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 01:07:25,173 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 01:07:25,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545569053] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 01:07:25,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 01:07:25,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 01:07:25,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268979108] [2023-08-04 01:07:25,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 01:07:25,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 01:07:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 01:07:25,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 01:07:25,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 209 [2023-08-04 01:07:25,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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 01:07:25,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:25,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 209 [2023-08-04 01:07:25,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:26,902 INFO L124 PetriNetUnfolderBase]: 12690/18190 cut-off events. [2023-08-04 01:07:26,903 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2023-08-04 01:07:26,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35789 conditions, 18190 events. 12690/18190 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 110908 event pairs, 5964 based on Foata normal form. 4/15057 useless extension candidates. Maximal degree in co-relation 9501. Up to 17113 conditions per place. [2023-08-04 01:07:26,985 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 38 selfloop transitions, 3 changer transitions 1/49 dead transitions. [2023-08-04 01:07:26,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 210 flow [2023-08-04 01:07:26,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 01:07:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 01:07:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2023-08-04 01:07:26,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4964114832535885 [2023-08-04 01:07:26,987 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2023-08-04 01:07:26,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2023-08-04 01:07:26,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:26,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2023-08-04 01:07:26,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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 01:07:26,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 01:07:26,990 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 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 01:07:26,990 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 104 flow. Second operand 4 states and 415 transitions. [2023-08-04 01:07:26,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 210 flow [2023-08-04 01:07:26,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:07:26,991 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 116 flow [2023-08-04 01:07:26,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-04 01:07:26,993 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-04 01:07:26,993 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 116 flow [2023-08-04 01:07:26,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 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 01:07:26,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:26,993 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:07:26,999 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 01:07:27,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 01:07:27,200 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 01:07:27,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1196413308, now seen corresponding path program 1 times [2023-08-04 01:07:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:27,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809556044] [2023-08-04 01:07:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:07:27,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:27,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809556044] [2023-08-04 01:07:27,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809556044] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:07:27,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:07:27,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 01:07:27,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100982163] [2023-08-04 01:07:27,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:07:27,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:07:27,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:27,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:07:27,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:07:27,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 209 [2023-08-04 01:07:27,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 01:07:27,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:27,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 209 [2023-08-04 01:07:27,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:28,450 INFO L124 PetriNetUnfolderBase]: 10842/15639 cut-off events. [2023-08-04 01:07:28,451 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2023-08-04 01:07:28,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30758 conditions, 15639 events. 10842/15639 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 94476 event pairs, 2442 based on Foata normal form. 0/13350 useless extension candidates. Maximal degree in co-relation 14357. Up to 13633 conditions per place. [2023-08-04 01:07:28,509 INFO L140 encePairwiseOnDemand]: 204/209 looper letters, 45 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2023-08-04 01:07:28,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 251 flow [2023-08-04 01:07:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:07:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:07:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions. [2023-08-04 01:07:28,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5422647527910686 [2023-08-04 01:07:28,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 340 transitions. [2023-08-04 01:07:28,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions. [2023-08-04 01:07:28,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:28,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions. [2023-08-04 01:07:28,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 01:07:28,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 01:07:28,513 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 01:07:28,513 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 116 flow. Second operand 3 states and 340 transitions. [2023-08-04 01:07:28,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 251 flow [2023-08-04 01:07:28,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 55 transitions, 244 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 01:07:28,515 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 130 flow [2023-08-04 01:07:28,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2023-08-04 01:07:28,515 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-04 01:07:28,515 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 130 flow [2023-08-04 01:07:28,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 01:07:28,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:28,516 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:07:28,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 01:07:28,516 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 01:07:28,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1565243783, now seen corresponding path program 1 times [2023-08-04 01:07:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:28,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363079497] [2023-08-04 01:07:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 01:07:28,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 01:07:28,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 01:07:28,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363079497] [2023-08-04 01:07:28,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363079497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 01:07:28,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 01:07:28,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 01:07:28,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461306514] [2023-08-04 01:07:28,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 01:07:28,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 01:07:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 01:07:28,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 01:07:28,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 01:07:28,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 209 [2023-08-04 01:07:28,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 01:07:28,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 01:07:28,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 209 [2023-08-04 01:07:28,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 01:07:29,861 INFO L124 PetriNetUnfolderBase]: 10698/15127 cut-off events. [2023-08-04 01:07:29,861 INFO L125 PetriNetUnfolderBase]: For 1289/1289 co-relation queries the response was YES. [2023-08-04 01:07:29,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32614 conditions, 15127 events. 10698/15127 cut-off events. For 1289/1289 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 89639 event pairs, 8154 based on Foata normal form. 0/12886 useless extension candidates. Maximal degree in co-relation 15309. Up to 14281 conditions per place. [2023-08-04 01:07:29,943 INFO L140 encePairwiseOnDemand]: 205/209 looper letters, 42 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-08-04 01:07:29,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 243 flow [2023-08-04 01:07:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 01:07:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 01:07:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2023-08-04 01:07:29,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.518341307814992 [2023-08-04 01:07:29,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2023-08-04 01:07:29,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2023-08-04 01:07:29,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 01:07:29,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2023-08-04 01:07:29,946 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 01:07:29,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 01:07:29,948 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 209.0) internal successors, (836), 4 states have internal predecessors, (836), 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 01:07:29,948 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 130 flow. Second operand 3 states and 325 transitions. [2023-08-04 01:07:29,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 243 flow [2023-08-04 01:07:29,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 51 transitions, 239 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 01:07:29,951 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 141 flow [2023-08-04 01:07:29,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-04 01:07:29,951 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2023-08-04 01:07:29,951 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 141 flow [2023-08-04 01:07:29,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 01:07:29,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 01:07:29,952 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 01:07:29,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 01:07:29,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 01:07:29,953 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 01:07:29,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2027096530, now seen corresponding path program 1 times [2023-08-04 01:07:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 01:07:29,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772358781] [2023-08-04 01:07:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 01:07:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 01:07:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:07:29,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 01:07:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 01:07:30,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 01:07:30,011 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 01:07:30,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 01:07:30,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 01:07:30,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 01:07:30,011 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 01:07:30,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 01:07:30,012 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 01:07:30,012 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2023-08-04 01:07:30,015 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 01:07:30,015 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 01:07:30,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 01:07:30 BasicIcfg [2023-08-04 01:07:30,100 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 01:07:30,100 INFO L158 Benchmark]: Toolchain (without parser) took 19601.88ms. Allocated memory was 339.7MB in the beginning and 2.3GB in the end (delta: 2.0GB). Free memory was 285.6MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 611.0MB. Max. memory is 16.0GB. [2023-08-04 01:07:30,101 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 293.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 01:07:30,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.86ms. Allocated memory is still 339.7MB. Free memory was 285.3MB in the beginning and 262.5MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 01:07:30,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.63ms. Allocated memory is still 339.7MB. Free memory was 262.5MB in the beginning and 259.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 01:07:30,101 INFO L158 Benchmark]: Boogie Preprocessor took 33.07ms. Allocated memory is still 339.7MB. Free memory was 259.8MB in the beginning and 258.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 01:07:30,102 INFO L158 Benchmark]: RCFGBuilder took 649.99ms. Allocated memory was 339.7MB in the beginning and 469.8MB in the end (delta: 130.0MB). Free memory was 258.0MB in the beginning and 411.8MB in the end (delta: -153.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.0GB. [2023-08-04 01:07:30,102 INFO L158 Benchmark]: TraceAbstraction took 18349.97ms. Allocated memory was 469.8MB in the beginning and 2.3GB in the end (delta: 1.8GB). Free memory was 410.8MB in the beginning and 1.6GB in the end (delta: -1.2GB). Peak memory consumption was 604.4MB. Max. memory is 16.0GB. [2023-08-04 01:07:30,103 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 339.7MB. Free memory is still 293.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 493.86ms. Allocated memory is still 339.7MB. Free memory was 285.3MB in the beginning and 262.5MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.63ms. Allocated memory is still 339.7MB. Free memory was 262.5MB in the beginning and 259.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.07ms. Allocated memory is still 339.7MB. Free memory was 259.8MB in the beginning and 258.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 649.99ms. Allocated memory was 339.7MB in the beginning and 469.8MB in the end (delta: 130.0MB). Free memory was 258.0MB in the beginning and 411.8MB in the end (delta: -153.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.0GB. * TraceAbstraction took 18349.97ms. Allocated memory was 469.8MB in the beginning and 2.3GB in the end (delta: 1.8GB). Free memory was 410.8MB in the beginning and 1.6GB in the end (delta: -1.2GB). Peak memory consumption was 604.4MB. 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: 2.3s, 77 PlacesBefore, 23 PlacesAfterwards, 73 TransitionsBefore, 18 TransitionsAfterwards, 622 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 60 TotalNumberOfCompositions, 1479 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 777, independent: 693, independent conditional: 0, independent unconditional: 693, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 318, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 777, independent: 384, independent conditional: 0, independent unconditional: 384, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 318, unknown conditional: 0, unknown unconditional: 318] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 98 PlacesBefore, 40 PlacesAfterwards, 90 TransitionsBefore, 31 TransitionsAfterwards, 1752 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 65 TotalNumberOfCompositions, 5810 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1848, independent: 1662, independent conditional: 0, independent unconditional: 1662, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 818, independent: 793, independent conditional: 0, independent unconditional: 793, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1848, independent: 869, independent conditional: 0, independent unconditional: 869, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 818, unknown conditional: 0, unknown unconditional: 818] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 121 PlacesBefore, 46 PlacesAfterwards, 116 TransitionsBefore, 38 TransitionsAfterwards, 3344 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 9121 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2981, independent: 2779, independent conditional: 0, independent unconditional: 2779, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1608, independent: 1570, independent conditional: 0, independent unconditional: 1570, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2981, independent: 1209, independent conditional: 0, independent unconditional: 1209, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 1608, unknown conditional: 0, unknown unconditional: 1608] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 103, Positive conditional cache size: 0, Positive unconditional cache size: 103, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475[2]; [L791] 0 int asdf=0; VAL [__unbuffered_cnt=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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=0, y=0] [L791] COND TRUE 0 asdf<2 [L791] FCALL, FORK 0 pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0))=-3, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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=0, y=0] [L791] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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=0, y=0] [L791] COND TRUE 0 asdf<2 [L791] FCALL, FORK 0 pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2475[asdf], ((void *)0), P0, ((void *)0))=-2, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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=0, y=0] [L791] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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=0, y=0] [L791] COND FALSE 0 !(asdf<2) [L792] 0 pthread_t t2476[2]; [L793] 0 int asdf=0; VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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=0, y=0] [L793] COND TRUE 0 asdf<2 [L793] FCALL, FORK 0 pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0))=-1, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_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=0, y=0] [L754] 3 x$w_buff1 = x$w_buff0 [L755] 3 x$w_buff0 = 2 [L756] 3 x$w_buff1_used = x$w_buff0_used [L757] 3 x$w_buff0_used = (_Bool)1 [L758] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L758] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] 0 asdf++ VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L793] COND TRUE 0 asdf<2 [L793] FCALL, FORK 0 pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2476[asdf], ((void *)0), P1, ((void *)0))=0, t2475={5:0}, t2476={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 4 x$w_buff1 = x$w_buff0 [L755] 4 x$w_buff0 = 2 [L756] 4 x$w_buff1_used = x$w_buff0_used [L757] 4 x$w_buff0_used = (_Bool)1 [L758] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=1, __unbuffered_cnt=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, x=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, 114 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: 2.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 34 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.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 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, 131 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: 5.4s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 9 mSDtfsCounter, 302 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, 280 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, 131 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: 9.9s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 3 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141occurred in iteration=4, InterpolantAutomatonStates: 13, 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, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 01:07:30,129 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...