/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:35:07,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:35:07,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:35:07,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:35:07,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:35:07,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:35:07,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:35:07,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:35:07,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:35:07,900 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:35:07,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:35:07,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:35:07,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:35:07,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:35:07,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:35:07,909 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:35:07,909 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:35:07,910 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:35:07,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:35:07,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:35:07,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:35:07,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:35:07,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:35:07,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:35:07,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:35:07,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:35:07,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:35:07,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:35:07,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:35:07,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:35:07,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:35:07,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:35:07,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:35:07,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:35:07,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:35:07,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:35:07,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:35:07,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:35:07,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:35:07,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:35:07,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:35:07,949 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:35:07,981 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:35:07,981 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:35:07,983 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:35:07,983 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:35:07,983 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:35:07,984 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:35:07,984 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:35:07,984 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:35:07,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:35:07,985 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:35:07,985 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:35:07,985 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:35:07,986 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:35:07,986 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:35:07,986 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:35:07,986 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:35:07,986 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:35:07,986 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:35:07,986 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:35:07,986 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:35:07,987 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:35:07,987 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:35:07,987 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:35:07,987 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:35:07,987 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:35:07,987 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:35:07,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:35:07,988 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:35:07,988 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-06 04:35:08,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:35:08,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:35:08,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:35:08,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:35:08,333 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:35:08,334 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_tso.i [2022-12-06 04:35:09,415 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:35:09,678 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:35:09,679 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_tso.i [2022-12-06 04:35:09,695 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28da1040d/6d1b744c5f6447c287b2ce52b088a8b0/FLAG089fc7d17 [2022-12-06 04:35:09,712 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28da1040d/6d1b744c5f6447c287b2ce52b088a8b0 [2022-12-06 04:35:09,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:35:09,715 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:35:09,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:35:09,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:35:09,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:35:09,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:35:09" (1/1) ... [2022-12-06 04:35:09,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2793bc51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:09, skipping insertion in model container [2022-12-06 04:35:09,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:35:09" (1/1) ... [2022-12-06 04:35:09,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:35:09,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:35:09,932 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_tso.i[945,958] [2022-12-06 04:35:10,093 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,098 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:35:10,119 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:35:10,131 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_tso.i[945,958] [2022-12-06 04:35:10,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,166 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,170 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,171 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:35:10,172 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:35:10,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:35:10,217 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:35:10,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10 WrapperNode [2022-12-06 04:35:10,217 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:35:10,220 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:35:10,220 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:35:10,220 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:35:10,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,266 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2022-12-06 04:35:10,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:35:10,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:35:10,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:35:10,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:35:10,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,300 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:35:10,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:35:10,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:35:10,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:35:10,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (1/1) ... [2022-12-06 04:35:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:35:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:35:10,341 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) [2022-12-06 04:35:10,359 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 [2022-12-06 04:35:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:35:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:35:10,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:35:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:35:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:35:10,376 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 04:35:10,376 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 04:35:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 04:35:10,377 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 04:35:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:35:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:35:10,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:35:10,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:35:10,379 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:35:10,562 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:35:10,564 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:35:10,713 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:35:10,719 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:35:10,719 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:35:10,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:10 BoogieIcfgContainer [2022-12-06 04:35:10,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:35:10,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:35:10,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:35:10,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:35:10,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:35:09" (1/3) ... [2022-12-06 04:35:10,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8e6995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:35:10, skipping insertion in model container [2022-12-06 04:35:10,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:35:10" (2/3) ... [2022-12-06 04:35:10,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b8e6995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:35:10, skipping insertion in model container [2022-12-06 04:35:10,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:35:10" (3/3) ... [2022-12-06 04:35:10,728 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_tso.i [2022-12-06 04:35:10,744 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:35:10,745 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:35:10,745 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:35:10,781 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 04:35:10,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 72 places, 67 transitions, 144 flow [2022-12-06 04:35:10,857 INFO L130 PetriNetUnfolder]: 2/65 cut-off events. [2022-12-06 04:35:10,857 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:10,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 65 events. 2/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 36 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-12-06 04:35:10,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 67 transitions, 144 flow [2022-12-06 04:35:10,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 55 transitions, 116 flow [2022-12-06 04:35:10,866 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:10,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 55 transitions, 116 flow [2022-12-06 04:35:10,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 55 transitions, 116 flow [2022-12-06 04:35:10,897 INFO L130 PetriNetUnfolder]: 1/55 cut-off events. [2022-12-06 04:35:10,898 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:10,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2022-12-06 04:35:10,906 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 55 transitions, 116 flow [2022-12-06 04:35:10,910 INFO L188 LiptonReduction]: Number of co-enabled transitions 540 [2022-12-06 04:35:12,781 INFO L203 LiptonReduction]: Total number of compositions: 43 [2022-12-06 04:35:12,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:35:12,801 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@281d1986, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:35:12,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 04:35:12,804 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-06 04:35:12,804 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:12,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:12,805 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 04:35:12,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:35:12,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:12,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1712852893, now seen corresponding path program 1 times [2022-12-06 04:35:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:12,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547227646] [2022-12-06 04:35:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:12,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:35:13,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:13,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547227646] [2022-12-06 04:35:13,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547227646] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:13,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:13,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:35:13,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174365311] [2022-12-06 04:35:13,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:13,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:13,260 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 13 [2022-12-06 04:35:13,262 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 13 transitions, 32 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-12-06 04:35:13,262 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:13,262 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 13 [2022-12-06 04:35:13,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:13,326 INFO L130 PetriNetUnfolder]: 40/87 cut-off events. [2022-12-06 04:35:13,331 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:35:13,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 87 events. 40/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 261 event pairs, 14 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 170. Up to 74 conditions per place. [2022-12-06 04:35:13,334 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 14 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2022-12-06 04:35:13,334 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 18 transitions, 79 flow [2022-12-06 04:35:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-06 04:35:13,344 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 04:35:13,346 INFO L175 Difference]: Start difference. First operand has 19 places, 13 transitions, 32 flow. Second operand 3 states and 23 transitions. [2022-12-06 04:35:13,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 18 transitions, 79 flow [2022-12-06 04:35:13,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:13,353 INFO L231 Difference]: Finished difference. Result has 20 places, 14 transitions, 47 flow [2022-12-06 04:35:13,354 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=28, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=47, PETRI_PLACES=20, PETRI_TRANSITIONS=14} [2022-12-06 04:35:13,358 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 1 predicate places. [2022-12-06 04:35:13,358 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:13,359 INFO L89 Accepts]: Start accepts. Operand has 20 places, 14 transitions, 47 flow [2022-12-06 04:35:13,361 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:13,361 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:13,362 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 14 transitions, 47 flow [2022-12-06 04:35:13,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 14 transitions, 47 flow [2022-12-06 04:35:13,376 INFO L130 PetriNetUnfolder]: 3/19 cut-off events. [2022-12-06 04:35:13,394 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:13,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 19 events. 3/19 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 31 event pairs, 1 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 30. Up to 10 conditions per place. [2022-12-06 04:35:13,396 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 14 transitions, 47 flow [2022-12-06 04:35:13,396 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 04:35:13,406 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:13,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 50 [2022-12-06 04:35:13,408 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 47 flow [2022-12-06 04:35:13,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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) [2022-12-06 04:35:13,408 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:13,408 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:13,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:35:13,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:35:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1558832809, now seen corresponding path program 1 times [2022-12-06 04:35:13,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:13,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522889909] [2022-12-06 04:35:13,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:13,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:13,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:35:13,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:13,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522889909] [2022-12-06 04:35:13,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522889909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:13,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:13,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:35:13,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105124466] [2022-12-06 04:35:13,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:13,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:35:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:13,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:35:13,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:35:13,530 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 12 [2022-12-06 04:35:13,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 47 flow. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-12-06 04:35:13,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:13,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 12 [2022-12-06 04:35:13,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:13,594 INFO L130 PetriNetUnfolder]: 27/70 cut-off events. [2022-12-06 04:35:13,595 INFO L131 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2022-12-06 04:35:13,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 70 events. 27/70 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 206 event pairs, 6 based on Foata normal form. 13/81 useless extension candidates. Maximal degree in co-relation 164. Up to 32 conditions per place. [2022-12-06 04:35:13,596 INFO L137 encePairwiseOnDemand]: 7/12 looper letters, 14 selfloop transitions, 3 changer transitions 10/30 dead transitions. [2022-12-06 04:35:13,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 30 transitions, 144 flow [2022-12-06 04:35:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:35:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:35:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-12-06 04:35:13,598 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2022-12-06 04:35:13,598 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 47 flow. Second operand 5 states and 37 transitions. [2022-12-06 04:35:13,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 30 transitions, 144 flow [2022-12-06 04:35:13,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 30 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:35:13,601 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 71 flow [2022-12-06 04:35:13,601 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=71, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2022-12-06 04:35:13,601 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 7 predicate places. [2022-12-06 04:35:13,602 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:13,602 INFO L89 Accepts]: Start accepts. Operand has 26 places, 16 transitions, 71 flow [2022-12-06 04:35:13,602 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:13,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:13,603 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 16 transitions, 71 flow [2022-12-06 04:35:13,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 71 flow [2022-12-06 04:35:13,611 INFO L130 PetriNetUnfolder]: 8/30 cut-off events. [2022-12-06 04:35:13,612 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 04:35:13,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 30 events. 8/30 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 3 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 73. Up to 14 conditions per place. [2022-12-06 04:35:13,613 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 71 flow [2022-12-06 04:35:13,613 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 04:35:13,614 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:13,615 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-06 04:35:13,616 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 71 flow [2022-12-06 04:35:13,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-12-06 04:35:13,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:13,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:13,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:35:13,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:35:13,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:13,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1002989040, now seen corresponding path program 1 times [2022-12-06 04:35:13,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:13,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992214678] [2022-12-06 04:35:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:13,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:35:13,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:13,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992214678] [2022-12-06 04:35:13,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992214678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:13,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:13,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:35:13,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926431894] [2022-12-06 04:35:13,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:13,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 04:35:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:13,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 04:35:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 04:35:13,744 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 12 [2022-12-06 04:35:13,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-06 04:35:13,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:13,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 12 [2022-12-06 04:35:13,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:13,801 INFO L130 PetriNetUnfolder]: 12/39 cut-off events. [2022-12-06 04:35:13,801 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-06 04:35:13,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 39 events. 12/39 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 3 based on Foata normal form. 5/43 useless extension candidates. Maximal degree in co-relation 116. Up to 16 conditions per place. [2022-12-06 04:35:13,802 INFO L137 encePairwiseOnDemand]: 7/12 looper letters, 12 selfloop transitions, 5 changer transitions 5/25 dead transitions. [2022-12-06 04:35:13,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 149 flow [2022-12-06 04:35:13,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:35:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:35:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-12-06 04:35:13,804 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2022-12-06 04:35:13,804 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 71 flow. Second operand 6 states and 35 transitions. [2022-12-06 04:35:13,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 149 flow [2022-12-06 04:35:13,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 25 transitions, 136 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-06 04:35:13,806 INFO L231 Difference]: Finished difference. Result has 30 places, 16 transitions, 82 flow [2022-12-06 04:35:13,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2022-12-06 04:35:13,807 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 11 predicate places. [2022-12-06 04:35:13,807 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:13,807 INFO L89 Accepts]: Start accepts. Operand has 30 places, 16 transitions, 82 flow [2022-12-06 04:35:13,808 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:13,808 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:13,809 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 16 transitions, 82 flow [2022-12-06 04:35:13,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 16 transitions, 82 flow [2022-12-06 04:35:13,812 INFO L130 PetriNetUnfolder]: 2/17 cut-off events. [2022-12-06 04:35:13,812 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 04:35:13,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 17 events. 2/17 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 41. Up to 7 conditions per place. [2022-12-06 04:35:13,813 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 16 transitions, 82 flow [2022-12-06 04:35:13,813 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-06 04:35:13,892 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:35:13,893 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 86 [2022-12-06 04:35:13,893 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 15 transitions, 80 flow [2022-12-06 04:35:13,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2022-12-06 04:35:13,893 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:13,893 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:13,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:35:13,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:35:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:13,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1825887529, now seen corresponding path program 1 times [2022-12-06 04:35:13,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:13,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583196733] [2022-12-06 04:35:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:35:14,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:14,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583196733] [2022-12-06 04:35:14,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583196733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:14,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:14,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:35:14,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914718700] [2022-12-06 04:35:14,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:14,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:14,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:14,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:14,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:14,029 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 11 [2022-12-06 04:35:14,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 15 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-12-06 04:35:14,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:14,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 11 [2022-12-06 04:35:14,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:14,054 INFO L130 PetriNetUnfolder]: 10/38 cut-off events. [2022-12-06 04:35:14,054 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 04:35:14,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 38 events. 10/38 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 85 event pairs, 6 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 120. Up to 27 conditions per place. [2022-12-06 04:35:14,055 INFO L137 encePairwiseOnDemand]: 8/11 looper letters, 11 selfloop transitions, 2 changer transitions 5/19 dead transitions. [2022-12-06 04:35:14,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 19 transitions, 144 flow [2022-12-06 04:35:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:14,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-12-06 04:35:14,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2022-12-06 04:35:14,057 INFO L175 Difference]: Start difference. First operand has 27 places, 15 transitions, 80 flow. Second operand 3 states and 17 transitions. [2022-12-06 04:35:14,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 19 transitions, 144 flow [2022-12-06 04:35:14,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 19 transitions, 120 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 04:35:14,058 INFO L231 Difference]: Finished difference. Result has 25 places, 13 transitions, 64 flow [2022-12-06 04:35:14,059 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=13} [2022-12-06 04:35:14,059 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 6 predicate places. [2022-12-06 04:35:14,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:35:14,059 INFO L89 Accepts]: Start accepts. Operand has 25 places, 13 transitions, 64 flow [2022-12-06 04:35:14,060 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:35:14,060 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:14,061 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 13 transitions, 64 flow [2022-12-06 04:35:14,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 13 transitions, 64 flow [2022-12-06 04:35:14,063 INFO L130 PetriNetUnfolder]: 1/13 cut-off events. [2022-12-06 04:35:14,063 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 04:35:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 13 events. 1/13 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-12-06 04:35:14,064 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 13 transitions, 64 flow [2022-12-06 04:35:14,064 INFO L188 LiptonReduction]: Number of co-enabled transitions 4 [2022-12-06 04:35:14,145 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [206] $Ultimate##0-->L741: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_13| v_P1Thread1of1ForFork1_~arg.offset_13) (= v_P1Thread1of1ForFork1_~arg.base_13 |v_P1Thread1of1ForFork1_#in~arg.base_13|) (= v_~y~0_56 1) (= v_~x~0_36 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_13|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_13|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_13, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_13, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_13|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_13|, ~y~0=v_~y~0_56, ~x~0=v_~x~0_36} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~y~0, ~x~0] and [208] $Ultimate##0-->L726: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_11|) (= v_~y~0_60 2) (= v_~x~0_40 v_~__unbuffered_p0_EAX~0_56) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_11|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~x~0=v_~x~0_40} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~y~0=v_~y~0_60, ~x~0=v_~x~0_40, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-06 04:35:14,191 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [207] $Ultimate##0-->P1EXIT: Formula: (and (= v_~x~0_38 1) (= v_~__unbuffered_cnt~0_97 (+ v_~__unbuffered_cnt~0_98 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_15| v_P1Thread1of1ForFork1_~arg.offset_15) (= |v_P1Thread1of1ForFork1_#res.base_17| 0) (= |v_P1Thread1of1ForFork1_#res.offset_17| 0) (= v_P1Thread1of1ForFork1_~arg.base_15 |v_P1Thread1of1ForFork1_#in~arg.base_15|) (= v_~y~0_58 1)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_15, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_15, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_15|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~y~0=v_~y~0_58, ~x~0=v_~x~0_38, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_17|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] and [208] $Ultimate##0-->L726: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_11|) (= v_~y~0_60 2) (= v_~x~0_40 v_~__unbuffered_p0_EAX~0_56) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_11|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~x~0=v_~x~0_40} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_56, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_11|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_11|, ~y~0=v_~y~0_60, ~x~0=v_~x~0_40, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-06 04:35:14,251 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 04:35:14,252 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 04:35:14,252 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 10 transitions, 64 flow [2022-12-06 04:35:14,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2022-12-06 04:35:14,252 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:35:14,252 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:35:14,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:35:14,253 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:35:14,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:35:14,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1078691282, now seen corresponding path program 1 times [2022-12-06 04:35:14,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:35:14,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847227620] [2022-12-06 04:35:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:35:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:35:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:35:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:35:14,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:35:14,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847227620] [2022-12-06 04:35:14,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847227620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:35:14,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:35:14,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:35:14,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517634255] [2022-12-06 04:35:14,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:35:14,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:35:14,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:35:14,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:35:14,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:35:14,332 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 9 [2022-12-06 04:35:14,333 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 10 transitions, 64 flow. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-12-06 04:35:14,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:35:14,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 9 [2022-12-06 04:35:14,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:35:14,344 INFO L130 PetriNetUnfolder]: 1/9 cut-off events. [2022-12-06 04:35:14,344 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 04:35:14,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 9 events. 1/9 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 1/10 useless extension candidates. Maximal degree in co-relation 30. Up to 5 conditions per place. [2022-12-06 04:35:14,345 INFO L137 encePairwiseOnDemand]: 6/9 looper letters, 0 selfloop transitions, 0 changer transitions 9/9 dead transitions. [2022-12-06 04:35:14,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 9 transitions, 72 flow [2022-12-06 04:35:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:35:14,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:35:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-12-06 04:35:14,346 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 04:35:14,346 INFO L175 Difference]: Start difference. First operand has 22 places, 10 transitions, 64 flow. Second operand 3 states and 9 transitions. [2022-12-06 04:35:14,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 9 transitions, 72 flow [2022-12-06 04:35:14,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 9 transitions, 48 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-12-06 04:35:14,347 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2022-12-06 04:35:14,347 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=9, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2022-12-06 04:35:14,347 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -3 predicate places. [2022-12-06 04:35:14,348 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:35:14,348 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 16 places, 0 transitions, 0 flow [2022-12-06 04:35:14,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 04:35:14,348 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 04:35:14,348 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:35:14,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 04:35:14,359 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 04:35:14,359 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 04:35:14,359 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:35:14,360 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 04:35:14,360 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 04:35:14,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2022-12-06 04:35:14,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 04:35:14,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 04:35:14,363 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 04:35:14,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:35:14,364 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-12-06 04:35:14,366 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:35:14,366 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:35:14,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:35:14 BasicIcfg [2022-12-06 04:35:14,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:35:14,369 INFO L158 Benchmark]: Toolchain (without parser) took 4654.82ms. Allocated memory was 201.3MB in the beginning and 253.8MB in the end (delta: 52.4MB). Free memory was 164.7MB in the beginning and 229.1MB in the end (delta: -64.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:35:14,370 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:35:14,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 501.51ms. Allocated memory is still 201.3MB. Free memory was 164.7MB in the beginning and 142.2MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 04:35:14,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.40ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 140.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:35:14,371 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 138.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 04:35:14,371 INFO L158 Benchmark]: RCFGBuilder took 418.18ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 126.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 04:35:14,371 INFO L158 Benchmark]: TraceAbstraction took 3645.73ms. Allocated memory was 201.3MB in the beginning and 253.8MB in the end (delta: 52.4MB). Free memory was 125.4MB in the beginning and 229.1MB in the end (delta: -103.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:35:14,372 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 178.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 501.51ms. Allocated memory is still 201.3MB. Free memory was 164.7MB in the beginning and 142.2MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.40ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 140.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 138.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 418.18ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 126.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3645.73ms. Allocated memory was 201.3MB in the beginning and 253.8MB in the end (delta: 52.4MB). Free memory was 125.4MB in the beginning and 229.1MB in the end (delta: -103.7MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 61 PlacesBefore, 19 PlacesAfterwards, 55 TransitionsBefore, 13 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 24 ConcurrentYvCompositions, 0 ChoiceCompositions, 43 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 388, independent: 362, independent conditional: 362, independent unconditional: 0, dependent: 26, dependent conditional: 26, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 388, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 388, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 388, independent: 362, independent conditional: 0, independent unconditional: 362, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 338, independent: 319, independent conditional: 0, independent unconditional: 319, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 338, independent: 315, independent conditional: 0, independent unconditional: 315, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 388, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 338, unknown conditional: 0, unknown unconditional: 338] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 463, Positive conditional cache size: 0, Positive unconditional cache size: 463, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 17, independent conditional: 17, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 17, independent conditional: 3, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 17, unknown conditional: 0, unknown unconditional: 17] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 2, independent unconditional: 8, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 28 PlacesBefore, 27 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32, independent: 20, independent conditional: 4, independent unconditional: 16, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 17, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 25 PlacesBefore, 22 PlacesAfterwards, 13 TransitionsBefore, 10 TransitionsAfterwards, 4 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 82 locations, 3 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: 3.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 2 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 04:35:14,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...