/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi000_power.opt_pso.opt_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:20:43,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:20:43,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:20:43,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:20:43,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:20:43,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:20:43,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:20:43,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:20:43,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:20:43,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:20:43,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:20:43,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:20:43,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:20:43,548 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:20:43,548 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:20:43,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:20:43,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:20:43,549 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:20:43,549 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:20:43,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:20:43,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:20:43,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:20:43,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:20:43,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:20:43,551 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:20:43,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:20:43,551 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:20:43,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:20:43,552 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:20:43,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:20:43,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:20:43,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:20:43,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:20:43,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:20:43,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:20:43,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:20:43,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:20:43,554 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:20:43,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:20:43,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:20:43,554 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:20:43,555 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 06:20:43,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:20:43,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:20:43,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:20:43,788 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:20:43,788 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:20:43,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi000_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 06:20:44,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:20:45,068 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:20:45,070 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi000_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 06:20:45,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34f053d1/669fb9c2243c48d996fdd17385041a7c/FLAG832918f44 [2023-08-04 06:20:45,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c34f053d1/669fb9c2243c48d996fdd17385041a7c [2023-08-04 06:20:45,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:20:45,098 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:20:45,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:20:45,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:20:45,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:20:45,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ff0d729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45, skipping insertion in model container [2023-08-04 06:20:45,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,147 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:20:45,295 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_rfi000_power.opt_pso.opt_rmo.opt_bound2.i[966,979] [2023-08-04 06:20:45,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:20:45,499 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:20:45,511 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_rfi000_power.opt_pso.opt_rmo.opt_bound2.i[966,979] [2023-08-04 06:20:45,527 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:20:45,528 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:20:45,553 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:20:45,587 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:20:45,587 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:20:45,593 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:20:45,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45 WrapperNode [2023-08-04 06:20:45,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:20:45,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:20:45,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:20:45,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:20:45,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,654 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2023-08-04 06:20:45,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:20:45,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:20:45,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:20:45,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:20:45,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,681 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:20:45,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:20:45,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:20:45,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:20:45,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (1/1) ... [2023-08-04 06:20:45,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:20:45,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:20:45,726 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 06:20:45,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 06:20:45,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:20:45,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:20:45,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:20:45,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:20:45,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:20:45,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:20:45,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:20:45,756 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:20:45,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:20:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:20:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:20:45,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:20:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:20:45,758 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 06:20:45,860 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:20:45,862 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:20:46,109 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:20:46,234 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:20:46,234 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 06:20:46,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:20:46 BoogieIcfgContainer [2023-08-04 06:20:46,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:20:46,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:20:46,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:20:46,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:20:46,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:20:45" (1/3) ... [2023-08-04 06:20:46,243 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339b02de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:20:46, skipping insertion in model container [2023-08-04 06:20:46,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:20:45" (2/3) ... [2023-08-04 06:20:46,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339b02de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:20:46, skipping insertion in model container [2023-08-04 06:20:46,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:20:46" (3/3) ... [2023-08-04 06:20:46,245 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi000_power.opt_pso.opt_rmo.opt_bound2.i [2023-08-04 06:20:46,251 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:20:46,257 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:20:46,257 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:20:46,257 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:20:46,308 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:20:46,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 104 transitions, 218 flow [2023-08-04 06:20:46,407 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-04 06:20:46,407 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:46,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 629 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 06:20:46,412 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 104 transitions, 218 flow [2023-08-04 06:20:46,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 103 transitions, 214 flow [2023-08-04 06:20:46,423 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:20:46,434 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 103 transitions, 214 flow [2023-08-04 06:20:46,437 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 103 transitions, 214 flow [2023-08-04 06:20:46,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 214 flow [2023-08-04 06:20:46,500 INFO L124 PetriNetUnfolderBase]: 14/221 cut-off events. [2023-08-04 06:20:46,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:46,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 221 events. 14/221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 624 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2023-08-04 06:20:46,504 INFO L119 LiptonReduction]: Number of co-enabled transitions 1594 [2023-08-04 06:20:49,910 INFO L134 LiptonReduction]: Checked pairs total: 4014 [2023-08-04 06:20:49,910 INFO L136 LiptonReduction]: Total number of compositions: 90 [2023-08-04 06:20:49,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:20:49,928 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;@3176868, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:20:49,928 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:20:49,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:20:49,932 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2023-08-04 06:20:49,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:49,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:20:49,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:20:49,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:20:49,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:20:49,937 INFO L85 PathProgramCache]: Analyzing trace with hash 446879983, now seen corresponding path program 1 times [2023-08-04 06:20:49,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:20:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32643973] [2023-08-04 06:20:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:20:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:20:50,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:20:50,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32643973] [2023-08-04 06:20:50,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32643973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:20:50,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:20:50,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:20:50,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120467170] [2023-08-04 06:20:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:20:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:20:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:20:50,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:20:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:20:50,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 194 [2023-08-04 06:20:50,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 24 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:20:50,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 194 [2023-08-04 06:20:50,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:20:50,326 INFO L124 PetriNetUnfolderBase]: 225/492 cut-off events. [2023-08-04 06:20:50,327 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:50,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 492 events. 225/492 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2424 event pairs, 96 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 901. Up to 398 conditions per place. [2023-08-04 06:20:50,336 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 20 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2023-08-04 06:20:50,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 110 flow [2023-08-04 06:20:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:20:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:20:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-08-04 06:20:50,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896907216494845 [2023-08-04 06:20:50,356 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-08-04 06:20:50,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-08-04 06:20:50,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:20:50,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-08-04 06:20:50,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,372 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,374 INFO L175 Difference]: Start difference. First operand has 29 places, 24 transitions, 56 flow. Second operand 3 states and 285 transitions. [2023-08-04 06:20:50,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 110 flow [2023-08-04 06:20:50,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 110 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:20:50,378 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 64 flow [2023-08-04 06:20:50,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-04 06:20:50,383 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2023-08-04 06:20:50,383 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 64 flow [2023-08-04 06:20:50,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:20:50,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:20:50,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:20:50,384 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:20:50,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:20:50,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1911483507, now seen corresponding path program 1 times [2023-08-04 06:20:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:20:50,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628985993] [2023-08-04 06:20:50,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:50,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:20:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:20:50,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:20:50,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628985993] [2023-08-04 06:20:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628985993] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:20:50,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158377910] [2023-08-04 06:20:50,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:50,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:20:50,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:20:50,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:20:50,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 06:20:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:50,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:20:50,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:20:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:20:50,648 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:20:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158377910] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:20:50,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:20:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:20:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659439003] [2023-08-04 06:20:50,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:20:50,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:20:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:20:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:20:50,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:20:50,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 194 [2023-08-04 06:20:50,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:20:50,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 194 [2023-08-04 06:20:50,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:20:50,752 INFO L124 PetriNetUnfolderBase]: 213/404 cut-off events. [2023-08-04 06:20:50,753 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 06:20:50,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 404 events. 213/404 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1776 event pairs, 136 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 809. Up to 327 conditions per place. [2023-08-04 06:20:50,755 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 25 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 06:20:50,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 134 flow [2023-08-04 06:20:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:20:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:20:50,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2023-08-04 06:20:50,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965635738831615 [2023-08-04 06:20:50,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 289 transitions. [2023-08-04 06:20:50,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 289 transitions. [2023-08-04 06:20:50,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:20:50,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 289 transitions. [2023-08-04 06:20:50,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,761 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 64 flow. Second operand 3 states and 289 transitions. [2023-08-04 06:20:50,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 134 flow [2023-08-04 06:20:50,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:20:50,763 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 68 flow [2023-08-04 06:20:50,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2023-08-04 06:20:50,763 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2023-08-04 06:20:50,764 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 68 flow [2023-08-04 06:20:50,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:50,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:20:50,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:20:50,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 06:20:50,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:20:50,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:20:50,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:20:50,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1911466501, now seen corresponding path program 1 times [2023-08-04 06:20:50,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:20:50,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361144607] [2023-08-04 06:20:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:50,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:20:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:51,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:20:51,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:20:51,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361144607] [2023-08-04 06:20:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361144607] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:20:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873617318] [2023-08-04 06:20:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:51,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:20:51,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:20:51,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:20:51,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 06:20:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:51,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:20:51,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:20:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:20:51,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:20:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:20:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873617318] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:20:51,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:20:51,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:20:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919880617] [2023-08-04 06:20:51,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:20:51,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:20:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:20:51,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:20:51,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:20:51,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 194 [2023-08-04 06:20:51,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:51,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:20:51,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 194 [2023-08-04 06:20:51,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:20:51,252 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 06:20:51,253 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 06:20:51,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 21 events. 6/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 06:20:51,253 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 06:20:51,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 12 transitions, 51 flow [2023-08-04 06:20:51,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:20:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:20:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 356 transitions. [2023-08-04 06:20:51,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4587628865979381 [2023-08-04 06:20:51,255 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 356 transitions. [2023-08-04 06:20:51,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 356 transitions. [2023-08-04 06:20:51,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:20:51,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 356 transitions. [2023-08-04 06:20:51,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.0) internal successors, (356), 4 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:51,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:51,260 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:51,260 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 68 flow. Second operand 4 states and 356 transitions. [2023-08-04 06:20:51,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 12 transitions, 51 flow [2023-08-04 06:20:51,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:20:51,260 INFO L231 Difference]: Finished difference. Result has 17 places, 0 transitions, 0 flow [2023-08-04 06:20:51,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=17, PETRI_TRANSITIONS=0} [2023-08-04 06:20:51,263 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -12 predicate places. [2023-08-04 06:20:51,263 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 0 transitions, 0 flow [2023-08-04 06:20:51,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:51,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:20:51,266 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:20:51,267 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:20:51,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 06:20:51,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 06:20:51,473 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 06:20:51,475 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:20:51,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 104 transitions, 218 flow [2023-08-04 06:20:51,507 INFO L124 PetriNetUnfolderBase]: 14/222 cut-off events. [2023-08-04 06:20:51,507 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:51,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 222 events. 14/222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 629 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 06:20:51,508 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 104 transitions, 218 flow [2023-08-04 06:20:51,509 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 77 transitions, 164 flow [2023-08-04 06:20:51,509 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:20:51,509 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 81 places, 77 transitions, 164 flow [2023-08-04 06:20:51,509 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 81 places, 77 transitions, 164 flow [2023-08-04 06:20:51,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 77 transitions, 164 flow [2023-08-04 06:20:51,519 INFO L124 PetriNetUnfolderBase]: 2/114 cut-off events. [2023-08-04 06:20:51,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:51,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 169 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 75. Up to 4 conditions per place. [2023-08-04 06:20:51,521 INFO L119 LiptonReduction]: Number of co-enabled transitions 690 [2023-08-04 06:20:53,603 INFO L134 LiptonReduction]: Checked pairs total: 1866 [2023-08-04 06:20:53,603 INFO L136 LiptonReduction]: Total number of compositions: 62 [2023-08-04 06:20:53,605 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:20:53,606 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;@3176868, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:20:53,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 06:20:53,608 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:20:53,608 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 06:20:53,608 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:53,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:20:53,609 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:20:53,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:20:53,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:20:53,609 INFO L85 PathProgramCache]: Analyzing trace with hash 506408906, now seen corresponding path program 1 times [2023-08-04 06:20:53,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:20:53,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108520501] [2023-08-04 06:20:53,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:53,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:20:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:53,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:20:53,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:20:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108520501] [2023-08-04 06:20:53,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108520501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:20:53,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:20:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:20:53,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887468132] [2023-08-04 06:20:53,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:20:53,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:20:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:20:53,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:20:53,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:20:53,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 166 [2023-08-04 06:20:53,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:53,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:20:53,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 166 [2023-08-04 06:20:53,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:20:53,713 INFO L124 PetriNetUnfolderBase]: 55/146 cut-off events. [2023-08-04 06:20:53,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:53,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 146 events. 55/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 549 event pairs, 16 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 261. Up to 108 conditions per place. [2023-08-04 06:20:53,714 INFO L140 encePairwiseOnDemand]: 163/166 looper letters, 16 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-04 06:20:53,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 94 flow [2023-08-04 06:20:53,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:20:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:20:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2023-08-04 06:20:53,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5622489959839357 [2023-08-04 06:20:53,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 280 transitions. [2023-08-04 06:20:53,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 280 transitions. [2023-08-04 06:20:53,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:20:53,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 280 transitions. [2023-08-04 06:20:53,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:53,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:53,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:53,718 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 50 flow. Second operand 3 states and 280 transitions. [2023-08-04 06:20:53,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 94 flow [2023-08-04 06:20:53,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:20:53,720 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 58 flow [2023-08-04 06:20:53,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-08-04 06:20:53,720 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2023-08-04 06:20:53,721 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 58 flow [2023-08-04 06:20:53,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:53,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:20:53,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:20:53,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:20:53,721 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:20:53,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:20:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1492215017, now seen corresponding path program 1 times [2023-08-04 06:20:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:20:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491385461] [2023-08-04 06:20:53,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:20:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:20:53,734 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:20:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:20:53,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:20:53,754 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:20:53,754 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 06:20:53,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 06:20:53,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:20:53,754 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:20:53,755 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 06:20:53,755 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:20:53,755 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:20:53,772 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:20:53,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 123 transitions, 270 flow [2023-08-04 06:20:53,810 INFO L124 PetriNetUnfolderBase]: 30/463 cut-off events. [2023-08-04 06:20:53,811 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 06:20:53,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 463 events. 30/463 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2005 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 332. Up to 18 conditions per place. [2023-08-04 06:20:53,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 123 transitions, 270 flow [2023-08-04 06:20:53,814 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 122 transitions, 264 flow [2023-08-04 06:20:53,814 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:20:53,814 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-04 06:20:53,814 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 122 transitions, 264 flow [2023-08-04 06:20:53,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 122 transitions, 264 flow [2023-08-04 06:20:53,848 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-04 06:20:53,848 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 06:20:53,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 462 events. 30/462 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1997 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 331. Up to 18 conditions per place. [2023-08-04 06:20:53,855 INFO L119 LiptonReduction]: Number of co-enabled transitions 3828 [2023-08-04 06:20:57,033 INFO L134 LiptonReduction]: Checked pairs total: 11734 [2023-08-04 06:20:57,034 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-04 06:20:57,038 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:20:57,038 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;@3176868, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:20:57,038 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:20:57,041 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:20:57,041 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 06:20:57,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:20:57,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:20:57,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:20:57,041 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 06:20:57,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:20:57,042 INFO L85 PathProgramCache]: Analyzing trace with hash 732282315, now seen corresponding path program 1 times [2023-08-04 06:20:57,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:20:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035489212] [2023-08-04 06:20:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:57,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:20:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:57,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:20:57,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:20:57,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035489212] [2023-08-04 06:20:57,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035489212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:20:57,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:20:57,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:20:57,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584662232] [2023-08-04 06:20:57,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:20:57,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:20:57,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:20:57,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:20:57,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:20:57,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 218 [2023-08-04 06:20:57,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:57,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:20:57,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 218 [2023-08-04 06:20:57,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:20:59,165 INFO L124 PetriNetUnfolderBase]: 11578/18182 cut-off events. [2023-08-04 06:20:59,166 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2023-08-04 06:20:59,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34662 conditions, 18182 events. 11578/18182 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 811. Compared 129884 event pairs, 8296 based on Foata normal form. 0/15138 useless extension candidates. Maximal degree in co-relation 7624. Up to 15955 conditions per place. [2023-08-04 06:20:59,277 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 31 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-08-04 06:20:59,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 44 transitions, 174 flow [2023-08-04 06:20:59,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:20:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:20:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-04 06:20:59,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107033639143731 [2023-08-04 06:20:59,279 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-04 06:20:59,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-04 06:20:59,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:20:59,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-04 06:20:59,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:59,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:59,282 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:59,282 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 98 flow. Second operand 3 states and 334 transitions. [2023-08-04 06:20:59,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 44 transitions, 174 flow [2023-08-04 06:20:59,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 172 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 06:20:59,293 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 108 flow [2023-08-04 06:20:59,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-04 06:20:59,294 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2023-08-04 06:20:59,295 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 108 flow [2023-08-04 06:20:59,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:59,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:20:59,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:20:59,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 06:20:59,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:20:59,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:20:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1503208496, now seen corresponding path program 1 times [2023-08-04 06:20:59,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:20:59,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732189778] [2023-08-04 06:20:59,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:59,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:20:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:20:59,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:20:59,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732189778] [2023-08-04 06:20:59,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732189778] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:20:59,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536060361] [2023-08-04 06:20:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:20:59,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:20:59,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:20:59,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:20:59,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 06:20:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:20:59,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:20:59,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:20:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 06:20:59,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:20:59,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536060361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:20:59,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:20:59,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:20:59,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159436480] [2023-08-04 06:20:59,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:20:59,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:20:59,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:20:59,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:20:59,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:20:59,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 218 [2023-08-04 06:20:59,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:20:59,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:20:59,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 218 [2023-08-04 06:20:59,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:01,339 INFO L124 PetriNetUnfolderBase]: 11470/17727 cut-off events. [2023-08-04 06:21:01,340 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2023-08-04 06:21:01,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33986 conditions, 17727 events. 11470/17727 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 124270 event pairs, 9601 based on Foata normal form. 0/14830 useless extension candidates. Maximal degree in co-relation 33945. Up to 15444 conditions per place. [2023-08-04 06:21:01,435 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 39 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 06:21:01,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 214 flow [2023-08-04 06:21:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:21:01,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:21:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-04 06:21:01,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214067278287462 [2023-08-04 06:21:01,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-04 06:21:01,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-04 06:21:01,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:01,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-04 06:21:01,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:01,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:01,442 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:01,442 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 108 flow. Second operand 3 states and 341 transitions. [2023-08-04 06:21:01,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 214 flow [2023-08-04 06:21:01,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:21:01,445 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 118 flow [2023-08-04 06:21:01,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=118, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-04 06:21:01,447 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 5 predicate places. [2023-08-04 06:21:01,447 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 118 flow [2023-08-04 06:21:01,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:01,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:01,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:21:01,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 06:21:01,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:01,661 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 06:21:01,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1503198007, now seen corresponding path program 1 times [2023-08-04 06:21:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919679428] [2023-08-04 06:21:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:01,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919679428] [2023-08-04 06:21:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919679428] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:21:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323879785] [2023-08-04 06:21:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:01,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:21:01,715 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:21:01,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 06:21:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:01,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:21:01,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:21:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:01,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:21:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 06:21:01,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323879785] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:21:01,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:21:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:21:01,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477968746] [2023-08-04 06:21:01,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:21:01,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:21:01,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:01,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:21:01,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:21:01,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 218 [2023-08-04 06:21:01,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:01,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:01,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 218 [2023-08-04 06:21:01,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:03,136 INFO L124 PetriNetUnfolderBase]: 9698/14414 cut-off events. [2023-08-04 06:21:03,136 INFO L125 PetriNetUnfolderBase]: For 1132/1132 co-relation queries the response was YES. [2023-08-04 06:21:03,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29018 conditions, 14414 events. 9698/14414 cut-off events. For 1132/1132 co-relation queries the response was YES. Maximal size of possible extension queue 687. Compared 92465 event pairs, 4556 based on Foata normal form. 4/12370 useless extension candidates. Maximal degree in co-relation 7666. Up to 13065 conditions per place. [2023-08-04 06:21:03,200 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 37 selfloop transitions, 3 changer transitions 1/52 dead transitions. [2023-08-04 06:21:03,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 222 flow [2023-08-04 06:21:03,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:21:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:21:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 437 transitions. [2023-08-04 06:21:03,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5011467889908257 [2023-08-04 06:21:03,202 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 437 transitions. [2023-08-04 06:21:03,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 437 transitions. [2023-08-04 06:21:03,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:03,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 437 transitions. [2023-08-04 06:21:03,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:03,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:03,205 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:03,205 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 118 flow. Second operand 4 states and 437 transitions. [2023-08-04 06:21:03,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 222 flow [2023-08-04 06:21:03,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:21:03,207 INFO L231 Difference]: Finished difference. Result has 57 places, 41 transitions, 130 flow [2023-08-04 06:21:03,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=57, PETRI_TRANSITIONS=41} [2023-08-04 06:21:03,208 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-04 06:21:03,208 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 41 transitions, 130 flow [2023-08-04 06:21:03,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:03,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:03,209 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:21:03,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 06:21:03,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:03,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:21:03,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:03,415 INFO L85 PathProgramCache]: Analyzing trace with hash -327295516, now seen corresponding path program 1 times [2023-08-04 06:21:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:03,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070544362] [2023-08-04 06:21:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:03,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:03,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:03,533 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 06:21:03,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:03,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070544362] [2023-08-04 06:21:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070544362] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:21:03,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:21:03,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:21:03,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951676297] [2023-08-04 06:21:03,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:21:03,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:21:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:03,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:21:03,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:21:03,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 218 [2023-08-04 06:21:03,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 41 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:03,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:03,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 218 [2023-08-04 06:21:03,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:04,707 INFO L124 PetriNetUnfolderBase]: 8266/12999 cut-off events. [2023-08-04 06:21:04,707 INFO L125 PetriNetUnfolderBase]: For 1175/1175 co-relation queries the response was YES. [2023-08-04 06:21:04,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25463 conditions, 12999 events. 8266/12999 cut-off events. For 1175/1175 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 88338 event pairs, 1546 based on Foata normal form. 0/11463 useless extension candidates. Maximal degree in co-relation 11941. Up to 10529 conditions per place. [2023-08-04 06:21:04,767 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 43 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2023-08-04 06:21:04,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 57 transitions, 265 flow [2023-08-04 06:21:04,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:21:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:21:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-08-04 06:21:04,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5412844036697247 [2023-08-04 06:21:04,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-08-04 06:21:04,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-08-04 06:21:04,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:04,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-08-04 06:21:04,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:04,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:04,773 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:04,773 INFO L175 Difference]: Start difference. First operand has 57 places, 41 transitions, 130 flow. Second operand 3 states and 354 transitions. [2023-08-04 06:21:04,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 57 transitions, 265 flow [2023-08-04 06:21:04,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 258 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:21:04,775 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 144 flow [2023-08-04 06:21:04,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-04 06:21:04,777 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 9 predicate places. [2023-08-04 06:21:04,777 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 144 flow [2023-08-04 06:21:04,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:04,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:04,778 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:21:04,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:21:04,778 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:21:04,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1807162599, now seen corresponding path program 1 times [2023-08-04 06:21:04,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:04,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438116991] [2023-08-04 06:21:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:04,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:21:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:21:04,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438116991] [2023-08-04 06:21:04,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438116991] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:21:04,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760985111] [2023-08-04 06:21:04,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:04,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:21:04,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:21:04,857 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:21:04,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 06:21:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:21:04,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:21:04,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:21:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:21:04,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:21:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:21:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760985111] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:21:04,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:21:04,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:21:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160798239] [2023-08-04 06:21:04,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:21:04,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:21:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:21:04,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:21:04,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:21:04,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 218 [2023-08-04 06:21:04,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:04,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:21:04,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 218 [2023-08-04 06:21:04,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:21:05,982 INFO L124 PetriNetUnfolderBase]: 7690/10887 cut-off events. [2023-08-04 06:21:05,983 INFO L125 PetriNetUnfolderBase]: For 1627/1627 co-relation queries the response was YES. [2023-08-04 06:21:05,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24343 conditions, 10887 events. 7690/10887 cut-off events. For 1627/1627 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 65125 event pairs, 3386 based on Foata normal form. 64/9775 useless extension candidates. Maximal degree in co-relation 11445. Up to 7209 conditions per place. [2023-08-04 06:21:06,031 INFO L140 encePairwiseOnDemand]: 214/218 looper letters, 55 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2023-08-04 06:21:06,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 333 flow [2023-08-04 06:21:06,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:21:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:21:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-04 06:21:06,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172018348623854 [2023-08-04 06:21:06,033 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-04 06:21:06,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-04 06:21:06,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:21:06,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-04 06:21:06,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:06,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:06,036 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:06,037 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 144 flow. Second operand 4 states and 451 transitions. [2023-08-04 06:21:06,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 333 flow [2023-08-04 06:21:06,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:21:06,039 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 161 flow [2023-08-04 06:21:06,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-08-04 06:21:06,039 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 13 predicate places. [2023-08-04 06:21:06,040 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 161 flow [2023-08-04 06:21:06,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.2) internal successors, (511), 5 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:21:06,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:21:06,040 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:21:06,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 06:21:06,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-04 06:21:06,246 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:21:06,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:21:06,246 INFO L85 PathProgramCache]: Analyzing trace with hash -210779745, now seen corresponding path program 1 times [2023-08-04 06:21:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:21:06,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698363] [2023-08-04 06:21:06,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:21:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:21:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:21:06,267 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:21:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:21:06,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:21:06,298 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:21:06,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:21:06,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:21:06,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:21:06,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:21:06,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 06:21:06,299 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-04 06:21:06,299 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:21:06,301 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:21:06,301 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:21:06,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:21:06 BasicIcfg [2023-08-04 06:21:06,370 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:21:06,371 INFO L158 Benchmark]: Toolchain (without parser) took 21273.09ms. Allocated memory was 419.4MB in the beginning and 2.0GB in the end (delta: 1.5GB). Free memory was 372.0MB in the beginning and 1.2GB in the end (delta: -813.2MB). Peak memory consumption was 732.3MB. Max. memory is 16.0GB. [2023-08-04 06:21:06,371 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 348.1MB. Free memory was 303.6MB in the beginning and 303.4MB in the end (delta: 185.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:21:06,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.90ms. Allocated memory is still 419.4MB. Free memory was 372.0MB in the beginning and 349.1MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 06:21:06,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.74ms. Allocated memory is still 419.4MB. Free memory was 349.1MB in the beginning and 345.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 06:21:06,372 INFO L158 Benchmark]: Boogie Preprocessor took 33.91ms. Allocated memory is still 419.4MB. Free memory was 345.8MB in the beginning and 344.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:21:06,372 INFO L158 Benchmark]: RCFGBuilder took 546.73ms. Allocated memory is still 419.4MB. Free memory was 344.6MB in the beginning and 311.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-04 06:21:06,372 INFO L158 Benchmark]: TraceAbstraction took 20131.98ms. Allocated memory was 419.4MB in the beginning and 2.0GB in the end (delta: 1.5GB). Free memory was 310.2MB in the beginning and 1.2GB in the end (delta: -875.0MB). Peak memory consumption was 669.4MB. Max. memory is 16.0GB. [2023-08-04 06:21:06,380 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 348.1MB. Free memory was 303.6MB in the beginning and 303.4MB in the end (delta: 185.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 496.90ms. Allocated memory is still 419.4MB. Free memory was 372.0MB in the beginning and 349.1MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.74ms. Allocated memory is still 419.4MB. Free memory was 349.1MB in the beginning and 345.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 33.91ms. Allocated memory is still 419.4MB. Free memory was 345.8MB in the beginning and 344.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 546.73ms. Allocated memory is still 419.4MB. Free memory was 344.6MB in the beginning and 311.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 20131.98ms. Allocated memory was 419.4MB in the beginning and 2.0GB in the end (delta: 1.5GB). Free memory was 310.2MB in the beginning and 1.2GB in the end (delta: -875.0MB). Peak memory consumption was 669.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: 3.5s, 104 PlacesBefore, 29 PlacesAfterwards, 103 TransitionsBefore, 24 TransitionsAfterwards, 1594 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 90 TotalNumberOfCompositions, 4014 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1878, independent: 1734, independent conditional: 0, independent unconditional: 1734, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 874, independent: 827, independent conditional: 0, independent unconditional: 827, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1878, independent: 907, independent conditional: 0, independent unconditional: 907, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 874, unknown conditional: 0, unknown unconditional: 874] , Statistics on independence cache: Total cache size (in pairs): 72, Positive cache size: 60, Positive conditional cache size: 0, Positive unconditional cache size: 60, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 81 PlacesBefore, 25 PlacesAfterwards, 77 TransitionsBefore, 20 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 62 TotalNumberOfCompositions, 1866 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 992, independent: 879, independent conditional: 0, independent unconditional: 879, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 352, independent: 338, independent conditional: 0, independent unconditional: 338, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 992, independent: 541, independent conditional: 0, independent unconditional: 541, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 352, unknown conditional: 0, unknown unconditional: 352] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 37, Positive conditional cache size: 0, Positive unconditional cache size: 37, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 127 PlacesBefore, 48 PlacesAfterwards, 122 TransitionsBefore, 39 TransitionsAfterwards, 3828 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 4 ChoiceCompositions, 95 TotalNumberOfCompositions, 11734 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4485, independent: 4227, independent conditional: 0, independent unconditional: 4227, dependent: 258, dependent conditional: 0, dependent unconditional: 258, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1873, independent: 1807, independent conditional: 0, independent unconditional: 1807, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4485, independent: 2420, independent conditional: 0, independent unconditional: 2420, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 1873, unknown conditional: 0, unknown unconditional: 1873] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$read_delayed; [L726] 0 int *x$read_delayed_var; [L727] 0 int x$w_buff0; [L728] 0 _Bool x$w_buff0_used; [L729] 0 int x$w_buff1; [L730] 0 _Bool x$w_buff1_used; [L732] 0 int y = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L800] 0 pthread_t t1587[2]; [L801] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1587={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] [L801] COND TRUE 0 asdf<2 [L801] FCALL, FORK 0 pthread_create(&t1587[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587[asdf], ((void *)0), P0, ((void *)0))=-3, t1587={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] [L801] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1587={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] [L801] COND TRUE 0 asdf<2 [L801] FCALL, FORK 0 pthread_create(&t1587[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1587[asdf], ((void *)0), P0, ((void *)0))=-2, t1587={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] [L801] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1587={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] [L801] COND FALSE 0 !(asdf<2) [L802] 0 pthread_t t1588[2]; [L803] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1587={5:0}, t1588={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] [L803] COND TRUE 0 asdf<2 [L803] FCALL, FORK 0 pthread_create(&t1588[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588[asdf], ((void *)0), P1, ((void *)0))=-1, t1587={5:0}, t1588={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] [L758] 3 x$w_buff1 = x$w_buff0 [L759] 3 x$w_buff0 = 2 [L760] 3 x$w_buff1_used = x$w_buff0_used [L761] 3 x$w_buff0_used = (_Bool)1 [L762] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L762] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L763] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L764] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L765] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L766] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L803] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1587={5:0}, t1588={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] [L803] COND TRUE 0 asdf<2 [L803] FCALL, FORK 0 pthread_create(&t1588[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1588[asdf], ((void *)0), P1, ((void *)0))=0, t1587={5:0}, t1588={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] [L758] 4 x$w_buff1 = x$w_buff0 [L759] 4 x$w_buff0 = 2 [L760] 4 x$w_buff1_used = x$w_buff0_used [L761] 4 x$w_buff0_used = (_Bool)1 [L762] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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 with 1 thread instances CFG has 5 procedures, 120 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: 5.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 1 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 75 SizeOfPredicates, 0 NumberOfNonLiveVariables, 305 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 1/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.5s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 149 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 15 mSDtfsCounter, 364 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=5, InterpolantAutomatonStates: 17, 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.4s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 502 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 25/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 120 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.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, 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=58occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-04 06:21:06,406 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...