/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_mix038_tso.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 06:04:39,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:04:39,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:04:39,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:04:39,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:04:39,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:04:39,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:04:39,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:04:39,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:04:39,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:04:39,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:04:39,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:04:39,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:04:39,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:04:39,715 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:04:39,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:04:39,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:04:39,715 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:04:39,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:04:39,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:04:39,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:04:39,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:04:39,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:04:39,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:04:39,717 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:04:39,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:04:39,717 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:04:39,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:04:39,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:04:39,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:04:39,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:04:39,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:04:39,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:04:39,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:04:39,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:04:39,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:04:39,719 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:04:39,719 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:04:39,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:04:39,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:04:39,720 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:04:39,720 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:04:39,908 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:04:39,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:04:39,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:04:39,929 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:04:39,929 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:04:39,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix038_tso.oepc_bound2.i [2023-08-04 06:04:41,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:04:41,258 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:04:41,258 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix038_tso.oepc_bound2.i [2023-08-04 06:04:41,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d09015c/60166e6da055434bb7dbcc1fb866a943/FLAGd4a896aba [2023-08-04 06:04:41,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d09015c/60166e6da055434bb7dbcc1fb866a943 [2023-08-04 06:04:41,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:04:41,638 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:04:41,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:04:41,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:04:41,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:04:41,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:04:41" (1/1) ... [2023-08-04 06:04:41,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34fa5e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:41, skipping insertion in model container [2023-08-04 06:04:41,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:04:41" (1/1) ... [2023-08-04 06:04:41,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:04:41,766 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_mix038_tso.oepc_bound2.i[949,962] [2023-08-04 06:04:41,900 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:04:41,908 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:04:41,917 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_mix038_tso.oepc_bound2.i[949,962] [2023-08-04 06:04:41,933 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:04:41,935 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 06:04:41,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:04:42,004 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:04:42,004 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:04:42,009 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:04:42,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42 WrapperNode [2023-08-04 06:04:42,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:04:42,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:04:42,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:04:42,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:04:42,019 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:04:42" (1/1) ... [2023-08-04 06:04:42,034 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:04:42" (1/1) ... [2023-08-04 06:04:42,054 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 171 [2023-08-04 06:04:42,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:04:42,055 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:04:42,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:04:42,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:04:42,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,081 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:04:42,082 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:04:42,082 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:04:42,082 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:04:42,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (1/1) ... [2023-08-04 06:04:42,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:04:42,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:04:42,129 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:04:42,135 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:04:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:04:42,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:04:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:04:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:04:42,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:04:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:04:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:04:42,168 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:04:42,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:04:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 06:04:42,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 06:04:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:04:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:04:42,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:04:42,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:04:42,177 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:04:42,303 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:04:42,304 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:04:42,568 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:04:42,708 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:04:42,709 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 06:04:42,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:04:42 BoogieIcfgContainer [2023-08-04 06:04:42,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:04:42,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:04:42,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:04:42,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:04:42,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:04:41" (1/3) ... [2023-08-04 06:04:42,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d2fd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:04:42, skipping insertion in model container [2023-08-04 06:04:42,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:04:42" (2/3) ... [2023-08-04 06:04:42,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d2fd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:04:42, skipping insertion in model container [2023-08-04 06:04:42,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:04:42" (3/3) ... [2023-08-04 06:04:42,720 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix038_tso.oepc_bound2.i [2023-08-04 06:04:42,725 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:04:42,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:04:42,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 06:04:42,731 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:04:42,772 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:04:42,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 06:04:42,953 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 06:04:42,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:04:42,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2060 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-04 06:04:42,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 06:04:42,969 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 132 transitions, 277 flow [2023-08-04 06:04:42,972 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:04:42,992 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 132 transitions, 277 flow [2023-08-04 06:04:42,996 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 132 transitions, 277 flow [2023-08-04 06:04:42,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 277 flow [2023-08-04 06:04:43,083 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 06:04:43,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:04:43,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 458 events. 30/458 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2056 event pairs, 0 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 270. Up to 16 conditions per place. [2023-08-04 06:04:43,092 INFO L119 LiptonReduction]: Number of co-enabled transitions 2900 [2023-08-04 06:04:46,713 INFO L134 LiptonReduction]: Checked pairs total: 6916 [2023-08-04 06:04:46,713 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-04 06:04:46,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:04:46,738 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;@30465af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:04:46,738 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:04:46,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:04:46,743 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 06:04:46,743 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:04:46,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:04:46,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:04:46,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:04:46,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:04:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash 547812603, now seen corresponding path program 1 times [2023-08-04 06:04:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:04:46,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021402747] [2023-08-04 06:04:46,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:04:46,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:04:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:04:47,060 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:04:47,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:04:47,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021402747] [2023-08-04 06:04:47,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021402747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:04:47,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:04:47,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:04:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215759204] [2023-08-04 06:04:47,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:04:47,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:04:47,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:04:47,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:04:47,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:04:47,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 246 [2023-08-04 06:04:47,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:04:47,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:04:47,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 246 [2023-08-04 06:04:47,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:04:47,937 INFO L124 PetriNetUnfolderBase]: 1677/2712 cut-off events. [2023-08-04 06:04:47,937 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-04 06:04:47,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5414 conditions, 2712 events. 1677/2712 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15357 event pairs, 1008 based on Foata normal form. 0/2212 useless extension candidates. Maximal degree in co-relation 5401. Up to 2570 conditions per place. [2023-08-04 06:04:47,954 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 27 selfloop transitions, 2 changer transitions 1/36 dead transitions. [2023-08-04 06:04:47,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 145 flow [2023-08-04 06:04:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:04:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:04:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-04 06:04:47,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5013550135501355 [2023-08-04 06:04:47,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-04 06:04:47,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-04 06:04:47,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:04:47,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-04 06:04:47,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:04:47,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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:04:47,978 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 246.0) internal successors, (984), 4 states have internal predecessors, (984), 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:04:47,979 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 77 flow. Second operand 3 states and 370 transitions. [2023-08-04 06:04:47,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 145 flow [2023-08-04 06:04:47,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 145 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:04:47,983 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 85 flow [2023-08-04 06:04:47,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-04 06:04:47,986 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-04 06:04:47,987 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 85 flow [2023-08-04 06:04:47,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:04:47,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:04:47,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:04:47,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:04:47,988 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:04:47,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:04:47,988 INFO L85 PathProgramCache]: Analyzing trace with hash 46870662, now seen corresponding path program 1 times [2023-08-04 06:04:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:04:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513362505] [2023-08-04 06:04:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:04:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:04:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:04:48,048 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:04:48,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:04:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513362505] [2023-08-04 06:04:48,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513362505] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:04:48,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786241826] [2023-08-04 06:04:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:04:48,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:04:48,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:04:48,052 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:04:48,084 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:04:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:04:48,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:04:48,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:04:48,166 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:04:48,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:04:48,184 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:04:48,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786241826] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:04:48,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:04:48,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:04:48,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976905902] [2023-08-04 06:04:48,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:04:48,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:04:48,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:04:48,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:04:48,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:04:48,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 246 [2023-08-04 06:04:48,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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:04:48,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:04:48,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 246 [2023-08-04 06:04:48,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:04:48,220 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 06:04:48,220 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 06:04:48,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 21 events. 6/21 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 2 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 52. Up to 14 conditions per place. [2023-08-04 06:04:48,220 INFO L140 encePairwiseOnDemand]: 243/246 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 06:04:48,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 12 transitions, 55 flow [2023-08-04 06:04:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:04:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:04:48,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2023-08-04 06:04:48,223 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46747967479674796 [2023-08-04 06:04:48,223 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2023-08-04 06:04:48,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2023-08-04 06:04:48,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:04:48,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2023-08-04 06:04:48,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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:04:48,226 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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:04:48,227 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 246.0) internal successors, (1230), 5 states have internal predecessors, (1230), 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:04:48,227 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 85 flow. Second operand 4 states and 460 transitions. [2023-08-04 06:04:48,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 12 transitions, 55 flow [2023-08-04 06:04:48,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 06:04:48,227 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 06:04:48,227 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=246, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=13, 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=16, PETRI_TRANSITIONS=0} [2023-08-04 06:04:48,228 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -23 predicate places. [2023-08-04 06:04:48,228 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 06:04:48,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 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:04:48,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 06:04:48,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 06:04:48,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 06:04:48,249 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:04:48,438 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:04:48,438 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:04:48,442 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 06:04:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 06:04:48,482 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 06:04:48,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:04:48,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2060 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-08-04 06:04:48,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 135 places, 133 transitions, 281 flow [2023-08-04 06:04:48,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 104 transitions, 223 flow [2023-08-04 06:04:48,485 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:04:48,485 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 104 transitions, 223 flow [2023-08-04 06:04:48,485 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 104 transitions, 223 flow [2023-08-04 06:04:48,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 104 transitions, 223 flow [2023-08-04 06:04:48,501 INFO L124 PetriNetUnfolderBase]: 6/227 cut-off events. [2023-08-04 06:04:48,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:04:48,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 227 events. 6/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 687 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 156. Up to 8 conditions per place. [2023-08-04 06:04:48,503 INFO L119 LiptonReduction]: Number of co-enabled transitions 1522 [2023-08-04 06:04:50,890 INFO L134 LiptonReduction]: Checked pairs total: 3633 [2023-08-04 06:04:50,890 INFO L136 LiptonReduction]: Total number of compositions: 83 [2023-08-04 06:04:50,892 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:04:50,893 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;@30465af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:04:50,893 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 06:04:50,895 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:04:50,896 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 06:04:50,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:04:50,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:04:50,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 06:04:50,896 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:04:50,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:04:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1998208502, now seen corresponding path program 1 times [2023-08-04 06:04:50,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:04:50,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813305592] [2023-08-04 06:04:50,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:04:50,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:04:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:04:50,928 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:04:50,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:04:50,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813305592] [2023-08-04 06:04:50,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813305592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:04:50,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:04:50,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:04:50,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149616610] [2023-08-04 06:04:50,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:04:50,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:04:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:04:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:04:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:04:50,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 216 [2023-08-04 06:04:50,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:04:50,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:04:50,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 216 [2023-08-04 06:04:50,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:04:51,030 INFO L124 PetriNetUnfolderBase]: 559/974 cut-off events. [2023-08-04 06:04:51,031 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-04 06:04:51,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1990 conditions, 974 events. 559/974 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4677 event pairs, 304 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 1969. Up to 900 conditions per place. [2023-08-04 06:04:51,035 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-04 06:04:51,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 129 flow [2023-08-04 06:04:51,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:04:51,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:04:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2023-08-04 06:04:51,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2023-08-04 06:04:51,037 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2023-08-04 06:04:51,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2023-08-04 06:04:51,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:04:51,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2023-08-04 06:04:51,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:04:51,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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:04:51,040 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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:04:51,040 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 69 flow. Second operand 3 states and 366 transitions. [2023-08-04 06:04:51,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 129 flow [2023-08-04 06:04:51,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 129 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:04:51,041 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2023-08-04 06:04:51,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-04 06:04:51,042 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 06:04:51,042 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2023-08-04 06:04:51,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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:04:51,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:04:51,042 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:04:51,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 06:04:51,043 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 06:04:51,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:04:51,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1995345929, now seen corresponding path program 1 times [2023-08-04 06:04:51,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:04:51,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688186217] [2023-08-04 06:04:51,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:04:51,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:04:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:04:51,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:04:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:04:51,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:04:51,086 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:04:51,087 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 06:04:51,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 06:04:51,087 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 06:04:51,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:04:51,087 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:04:51,088 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 06:04:51,088 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:04:51,089 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:04:51,114 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:04:51,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 06:04:51,239 INFO L124 PetriNetUnfolderBase]: 93/1419 cut-off events. [2023-08-04 06:04:51,239 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 06:04:51,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1419 events. 93/1419 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9914 event pairs, 0 based on Foata normal form. 0/1254 useless extension candidates. Maximal degree in co-relation 1024. Up to 54 conditions per place. [2023-08-04 06:04:51,247 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 06:04:51,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 159 transitions, 350 flow [2023-08-04 06:04:51,255 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:04:51,255 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 167 places, 159 transitions, 350 flow [2023-08-04 06:04:51,255 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 167 places, 159 transitions, 350 flow [2023-08-04 06:04:51,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 159 transitions, 350 flow [2023-08-04 06:04:51,358 INFO L124 PetriNetUnfolderBase]: 93/1418 cut-off events. [2023-08-04 06:04:51,358 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-04 06:04:51,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 1418 events. 93/1418 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9895 event pairs, 0 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1021. Up to 54 conditions per place. [2023-08-04 06:04:51,390 INFO L119 LiptonReduction]: Number of co-enabled transitions 7088 [2023-08-04 06:04:54,854 INFO L134 LiptonReduction]: Checked pairs total: 24957 [2023-08-04 06:04:54,855 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-04 06:04:54,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:04:54,857 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;@30465af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:04:54,857 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 06:04:54,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:04:54,860 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 06:04:54,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:04:54,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:04:54,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:04:54,860 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:04:54,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:04:54,861 INFO L85 PathProgramCache]: Analyzing trace with hash 921867119, now seen corresponding path program 1 times [2023-08-04 06:04:54,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:04:54,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68765632] [2023-08-04 06:04:54,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:04:54,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:04:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:04:54,884 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:04:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:04:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68765632] [2023-08-04 06:04:54,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68765632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:04:54,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:04:54,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:04:54,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313559274] [2023-08-04 06:04:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:04:54,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:04:54,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:04:54,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:04:54,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:04:54,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281 [2023-08-04 06:04:54,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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:04:54,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:04:54,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281 [2023-08-04 06:04:54,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:05:45,327 INFO L124 PetriNetUnfolderBase]: 363272/498744 cut-off events. [2023-08-04 06:05:45,328 INFO L125 PetriNetUnfolderBase]: For 8748/8748 co-relation queries the response was YES. [2023-08-04 06:05:47,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964960 conditions, 498744 events. 363272/498744 cut-off events. For 8748/8748 co-relation queries the response was YES. Maximal size of possible extension queue 14961. Compared 3989031 event pairs, 293960 based on Foata normal form. 0/427983 useless extension candidates. Maximal degree in co-relation 207750. Up to 455689 conditions per place. [2023-08-04 06:05:49,846 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 42 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 06:05:49,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 59 transitions, 238 flow [2023-08-04 06:05:49,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:05:49,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:05:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-08-04 06:05:49,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5231316725978647 [2023-08-04 06:05:49,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-08-04 06:05:49,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-08-04 06:05:49,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:05:49,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-08-04 06:05:49,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 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:05:49,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:05:49,852 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:05:49,853 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 140 flow. Second operand 3 states and 441 transitions. [2023-08-04 06:05:49,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 59 transitions, 238 flow [2023-08-04 06:05:49,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 59 transitions, 234 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 06:05:49,867 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 148 flow [2023-08-04 06:05:49,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2023-08-04 06:05:49,868 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 3 predicate places. [2023-08-04 06:05:49,868 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 148 flow [2023-08-04 06:05:49,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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:05:49,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:05:49,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:05:49,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:05:49,880 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:05:49,880 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:05:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash -13421610, now seen corresponding path program 1 times [2023-08-04 06:05:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:05:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469451674] [2023-08-04 06:05:49,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:05:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:05:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:05:49,946 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:05:49,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:05:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469451674] [2023-08-04 06:05:49,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469451674] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:05:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87428024] [2023-08-04 06:05:49,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:05:49,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:05:49,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:05:49,951 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:05:49,952 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:05:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:05:50,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:05:50,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:05:50,047 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:05:50,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:05:50,061 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:05:50,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87428024] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:05:50,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:05:50,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:05:50,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370807] [2023-08-04 06:05:50,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:05:50,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:05:50,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:05:50,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:05:50,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:05:50,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 281 [2023-08-04 06:05:50,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 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:05:50,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:05:50,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 281 [2023-08-04 06:05:50,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:06:27,962 INFO L124 PetriNetUnfolderBase]: 301714/409614 cut-off events. [2023-08-04 06:06:27,962 INFO L125 PetriNetUnfolderBase]: For 6392/6392 co-relation queries the response was YES. [2023-08-04 06:06:29,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793151 conditions, 409614 events. 301714/409614 cut-off events. For 6392/6392 co-relation queries the response was YES. Maximal size of possible extension queue 12723. Compared 3140452 event pairs, 190828 based on Foata normal form. 4/352801 useless extension candidates. Maximal degree in co-relation 207521. Up to 375577 conditions per place. [2023-08-04 06:06:31,511 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 47 selfloop transitions, 3 changer transitions 1/66 dead transitions. [2023-08-04 06:06:31,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 272 flow [2023-08-04 06:06:31,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:06:31,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:06:31,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-08-04 06:06:31,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124555160142349 [2023-08-04 06:06:31,513 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-08-04 06:06:31,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-08-04 06:06:31,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:06:31,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-08-04 06:06:31,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 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:06:31,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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:06:31,517 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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:06:31,517 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 148 flow. Second operand 4 states and 576 transitions. [2023-08-04 06:06:31,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 272 flow [2023-08-04 06:06:31,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:06:31,525 INFO L231 Difference]: Finished difference. Result has 74 places, 55 transitions, 160 flow [2023-08-04 06:06:31,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=74, PETRI_TRANSITIONS=55} [2023-08-04 06:06:31,525 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2023-08-04 06:06:31,526 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 55 transitions, 160 flow [2023-08-04 06:06:31,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 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:06:31,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:06:31,526 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:06:31,548 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:06:31,732 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,SelfDestructingSolverStorable5 [2023-08-04 06:06:31,733 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:06:31,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:06:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1330281474, now seen corresponding path program 1 times [2023-08-04 06:06:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:06:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853356197] [2023-08-04 06:06:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:06:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:06:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:06:32,164 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:06:32,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:06:32,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853356197] [2023-08-04 06:06:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853356197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:06:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:06:32,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:06:32,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294119917] [2023-08-04 06:06:32,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:06:32,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:06:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:06:32,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:06:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:06:32,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 281 [2023-08-04 06:06:32,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 55 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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:06:32,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:06:32,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 281 [2023-08-04 06:06:32,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:07:06,695 INFO L124 PetriNetUnfolderBase]: 259610/342455 cut-off events. [2023-08-04 06:07:06,696 INFO L125 PetriNetUnfolderBase]: For 5808/5808 co-relation queries the response was YES. [2023-08-04 06:07:08,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673016 conditions, 342455 events. 259610/342455 cut-off events. For 5808/5808 co-relation queries the response was YES. Maximal size of possible extension queue 11164. Compared 2482111 event pairs, 42938 based on Foata normal form. 0/305190 useless extension candidates. Maximal degree in co-relation 320365. Up to 297729 conditions per place. [2023-08-04 06:07:09,673 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 63 selfloop transitions, 3 changer transitions 0/81 dead transitions. [2023-08-04 06:07:09,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 81 transitions, 357 flow [2023-08-04 06:07:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:07:09,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:07:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-04 06:07:09,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5599051008303677 [2023-08-04 06:07:09,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-04 06:07:09,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-04 06:07:09,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:07:09,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-04 06:07:09,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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:07:09,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:07:09,680 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:07:09,680 INFO L175 Difference]: Start difference. First operand has 74 places, 55 transitions, 160 flow. Second operand 3 states and 472 transitions. [2023-08-04 06:07:09,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 81 transitions, 357 flow [2023-08-04 06:07:09,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 81 transitions, 350 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:07:09,682 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 174 flow [2023-08-04 06:07:09,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2023-08-04 06:07:09,682 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2023-08-04 06:07:09,682 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 174 flow [2023-08-04 06:07:09,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 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:07:09,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:07:09,683 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:07:09,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 06:07:09,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:07:09,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:07:09,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1710724061, now seen corresponding path program 1 times [2023-08-04 06:07:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:07:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433296588] [2023-08-04 06:07:09,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:07:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:07:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:07:09,733 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:07:09,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:07:09,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433296588] [2023-08-04 06:07:09,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433296588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:07:09,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:07:09,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 06:07:09,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338326314] [2023-08-04 06:07:09,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:07:09,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:07:09,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:07:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:07:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:07:09,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281 [2023-08-04 06:07:09,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:07:09,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:07:09,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281 [2023-08-04 06:07:09,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:07:45,297 INFO L124 PetriNetUnfolderBase]: 253322/349719 cut-off events. [2023-08-04 06:07:45,297 INFO L125 PetriNetUnfolderBase]: For 26377/26377 co-relation queries the response was YES. [2023-08-04 06:07:46,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715464 conditions, 349719 events. 253322/349719 cut-off events. For 26377/26377 co-relation queries the response was YES. Maximal size of possible extension queue 11272. Compared 2757076 event pairs, 212698 based on Foata normal form. 0/311462 useless extension candidates. Maximal degree in co-relation 342173. Up to 315145 conditions per place. [2023-08-04 06:07:48,493 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 51 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-04 06:07:48,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 68 transitions, 305 flow [2023-08-04 06:07:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:07:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:07:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-08-04 06:07:48,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5302491103202847 [2023-08-04 06:07:48,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-08-04 06:07:48,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-08-04 06:07:48,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:07:48,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-08-04 06:07:48,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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:07:48,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:07:48,501 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:07:48,501 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 174 flow. Second operand 3 states and 447 transitions. [2023-08-04 06:07:48,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 68 transitions, 305 flow [2023-08-04 06:07:48,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:07:48,505 INFO L231 Difference]: Finished difference. Result has 76 places, 58 transitions, 183 flow [2023-08-04 06:07:48,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=76, PETRI_TRANSITIONS=58} [2023-08-04 06:07:48,507 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, 9 predicate places. [2023-08-04 06:07:48,507 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 58 transitions, 183 flow [2023-08-04 06:07:48,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:07:48,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:07:48,508 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:07:48,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 06:07:48,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:07:48,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:07:48,508 INFO L85 PathProgramCache]: Analyzing trace with hash -596432368, now seen corresponding path program 1 times [2023-08-04 06:07:48,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:07:48,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365636569] [2023-08-04 06:07:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:07:48,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:07:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:07:48,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:07:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:07:48,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:07:48,628 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:07:48,632 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:07:48,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:07:48,632 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:07:48,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:07:48,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 06:07:48,633 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 06:07:48,634 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:07:48,635 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:07:48,635 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:07:48,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:07:48 BasicIcfg [2023-08-04 06:07:48,736 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:07:48,737 INFO L158 Benchmark]: Toolchain (without parser) took 187098.43ms. Allocated memory was 348.1MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 304.3MB in the beginning and 10.9GB in the end (delta: -10.6GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. [2023-08-04 06:07:48,737 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 255.9MB. Free memory was 213.4MB in the beginning and 213.2MB in the end (delta: 193.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:07:48,737 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.84ms. Allocated memory is still 348.1MB. Free memory was 304.0MB in the beginning and 280.3MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 06:07:48,737 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.26ms. Allocated memory is still 348.1MB. Free memory was 280.3MB in the beginning and 277.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:07:48,738 INFO L158 Benchmark]: Boogie Preprocessor took 26.77ms. Allocated memory is still 348.1MB. Free memory was 277.6MB in the beginning and 275.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:07:48,738 INFO L158 Benchmark]: RCFGBuilder took 629.69ms. Allocated memory is still 348.1MB. Free memory was 275.5MB in the beginning and 288.2MB in the end (delta: -12.7MB). Peak memory consumption was 15.2MB. Max. memory is 16.0GB. [2023-08-04 06:07:48,738 INFO L158 Benchmark]: TraceAbstraction took 186022.20ms. Allocated memory was 348.1MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 287.5MB in the beginning and 10.9GB in the end (delta: -10.6GB). Peak memory consumption was 5.0GB. Max. memory is 16.0GB. [2023-08-04 06:07:48,739 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.09ms. Allocated memory is still 255.9MB. Free memory was 213.4MB in the beginning and 213.2MB in the end (delta: 193.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 373.84ms. Allocated memory is still 348.1MB. Free memory was 304.0MB in the beginning and 280.3MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.26ms. Allocated memory is still 348.1MB. Free memory was 280.3MB in the beginning and 277.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.77ms. Allocated memory is still 348.1MB. Free memory was 277.6MB in the beginning and 275.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 629.69ms. Allocated memory is still 348.1MB. Free memory was 275.5MB in the beginning and 288.2MB in the end (delta: -12.7MB). Peak memory consumption was 15.2MB. Max. memory is 16.0GB. * TraceAbstraction took 186022.20ms. Allocated memory was 348.1MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 287.5MB in the beginning and 10.9GB in the end (delta: -10.6GB). Peak memory consumption was 5.0GB. 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.7s, 134 PlacesBefore, 39 PlacesAfterwards, 132 TransitionsBefore, 32 TransitionsAfterwards, 2900 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 113 TotalNumberOfCompositions, 6916 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3494, independent: 3328, independent conditional: 0, independent unconditional: 3328, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1558, independent: 1518, independent conditional: 0, independent unconditional: 1518, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3494, independent: 1810, independent conditional: 0, independent unconditional: 1810, dependent: 126, dependent conditional: 0, dependent unconditional: 126, unknown: 1558, unknown conditional: 0, unknown unconditional: 1558] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 129, Positive conditional cache size: 0, Positive unconditional cache size: 129, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 109 PlacesBefore, 34 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1522 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 83 TotalNumberOfCompositions, 3633 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1836, independent: 1716, independent conditional: 0, independent unconditional: 1716, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 793, independent: 777, independent conditional: 0, independent unconditional: 777, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1836, independent: 939, independent conditional: 0, independent unconditional: 939, dependent: 104, dependent conditional: 0, dependent unconditional: 104, unknown: 793, unknown conditional: 0, unknown unconditional: 793] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 167 PlacesBefore, 67 PlacesAfterwards, 159 TransitionsBefore, 54 TransitionsAfterwards, 7088 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 5 ChoiceCompositions, 121 TotalNumberOfCompositions, 24957 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7587, independent: 7194, independent conditional: 0, independent unconditional: 7194, dependent: 393, dependent conditional: 0, dependent unconditional: 393, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3317, independent: 3260, independent conditional: 0, independent unconditional: 3260, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7587, independent: 3934, independent conditional: 0, independent unconditional: 3934, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 3317, unknown conditional: 0, unknown unconditional: 3317] , Statistics on independence cache: Total cache size (in pairs): 302, Positive cache size: 274, Positive conditional cache size: 0, Positive unconditional cache size: 274, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L830] 0 pthread_t t1019[2]; [L831] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1019={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L831] COND TRUE 0 asdf<2 [L831] FCALL, FORK 0 pthread_create(&t1019[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019[asdf], ((void *)0), P0, ((void *)0))=-3, t1019={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L831] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1019={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L831] COND TRUE 0 asdf<2 [L831] FCALL, FORK 0 pthread_create(&t1019[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1019[asdf], ((void *)0), P0, ((void *)0))=-2, t1019={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L831] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1019={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L831] COND FALSE 0 !(asdf<2) [L832] 0 pthread_t t1020[2]; [L833] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L833] COND TRUE 0 asdf<2 [L833] FCALL, FORK 0 pthread_create(&t1020[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020[asdf], ((void *)0), P1, ((void *)0))=-1, t1019={5:0}, t1020={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L767] 3 x$w_buff1 = x$w_buff0 [L768] 3 x$w_buff0 = 2 [L769] 3 x$w_buff1_used = x$w_buff0_used [L770] 3 x$w_buff0_used = (_Bool)1 [L771] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L771] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L776] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L833] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1019={5:0}, t1020={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L833] COND TRUE 0 asdf<2 [L833] FCALL, FORK 0 pthread_create(&t1020[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1020[asdf], ((void *)0), P1, ((void *)0))=0, t1019={5:0}, t1020={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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] [L767] 4 x$w_buff1 = x$w_buff0 [L768] 4 x$w_buff0 = 2 [L769] 4 x$w_buff1_used = x$w_buff0_used [L770] 4 x$w_buff0_used = (_Bool)1 [L771] 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_p2_EAX=0, __unbuffered_p2_EBX=0, a=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=1, InterpolantAutomatonStates: 7, 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, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 183 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 177.5s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 172.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 10 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 68 NumberOfCodeBlocks, 68 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 158 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 156 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 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, 50 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 06:07:48,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...