/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-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 16:19:39,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 16:19:39,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 16:19:39,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 16:19:39,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 16:19:39,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 16:19:39,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 16:19:39,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 16:19:39,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 16:19:39,876 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 16:19:39,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 16:19:39,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 16:19:39,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 16:19:39,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 16:19:39,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 16:19:39,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 16:19:39,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 16:19:39,893 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 16:19:39,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 16:19:39,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 16:19:39,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 16:19:39,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 16:19:39,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 16:19:39,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 16:19:39,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 16:19:39,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 16:19:39,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 16:19:39,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 16:19:39,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 16:19:39,909 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 16:19:39,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 16:19:39,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 16:19:39,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 16:19:39,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 16:19:39,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 16:19:39,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 16:19:39,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 16:19:39,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 16:19:39,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 16:19:39,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 16:19:39,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 16:19:39,916 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-NoLbe.epf [2022-12-06 16:19:39,943 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 16:19:39,944 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 16:19:39,945 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 16:19:39,945 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 16:19:39,945 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 16:19:39,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 16:19:39,946 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 16:19:39,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 16:19:39,946 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 16:19:39,946 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 16:19:39,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 16:19:39,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 16:19:39,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 16:19:39,947 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 16:19:39,947 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 16:19:39,947 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 16:19:39,947 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 16:19:39,947 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 16:19:39,948 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 16:19:39,948 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 16:19:39,948 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 16:19:39,948 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 16:19:39,948 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 16:19:39,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:19:39,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 16:19:39,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 16:19:39,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 16:19:39,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 16:19:39,949 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 16:19:39,949 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 16:19:39,949 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 16:19:39,949 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 16:19:40,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 16:19:40,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 16:19:40,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 16:19:40,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 16:19:40,209 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 16:19:40,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 16:19:41,210 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 16:19:41,449 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 16:19:41,449 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 16:19:41,470 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce03a6cb7/89db9d2fab6546f9991d9d3a591493d6/FLAG3cfa8fe4d [2022-12-06 16:19:41,505 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce03a6cb7/89db9d2fab6546f9991d9d3a591493d6 [2022-12-06 16:19:41,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 16:19:41,508 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 16:19:41,509 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 16:19:41,509 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 16:19:41,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 16:19:41,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:41,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ff889e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41, skipping insertion in model container [2022-12-06 16:19:41,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:41,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 16:19:41,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 16:19:41,686 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-06 16:19:41,800 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,808 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,809 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,827 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,831 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,832 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,837 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,838 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,839 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,841 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:19:41,849 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 16:19:41,858 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/mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i[996,1009] [2022-12-06 16:19:41,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,896 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,908 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 16:19:41,915 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 16:19:41,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 16:19:41,939 INFO L208 MainTranslator]: Completed translation [2022-12-06 16:19:41,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41 WrapperNode [2022-12-06 16:19:41,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 16:19:41,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 16:19:41,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 16:19:41,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 16:19:41,945 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:19:41" (1/1) ... [2022-12-06 16:19:41,966 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:19:41" (1/1) ... [2022-12-06 16:19:41,988 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 114 [2022-12-06 16:19:41,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 16:19:41,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 16:19:41,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 16:19:41,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 16:19:41,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:41,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:41,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:41,997 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:42,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:42,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:42,003 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:42,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:42,006 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 16:19:42,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 16:19:42,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 16:19:42,006 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 16:19:42,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (1/1) ... [2022-12-06 16:19:42,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 16:19:42,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 16:19:42,058 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 16:19:42,067 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 16:19:42,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 16:19:42,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 16:19:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 16:19:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 16:19:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 16:19:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 16:19:42,092 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 16:19:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 16:19:42,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 16:19:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 16:19:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 16:19:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 16:19:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 16:19:42,096 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 16:19:42,249 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 16:19:42,250 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 16:19:42,436 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 16:19:42,516 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 16:19:42,516 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 16:19:42,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:19:42 BoogieIcfgContainer [2022-12-06 16:19:42,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 16:19:42,519 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 16:19:42,519 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 16:19:42,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 16:19:42,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:19:41" (1/3) ... [2022-12-06 16:19:42,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224344f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:19:42, skipping insertion in model container [2022-12-06 16:19:42,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:19:41" (2/3) ... [2022-12-06 16:19:42,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224344f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:19:42, skipping insertion in model container [2022-12-06 16:19:42,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:19:42" (3/3) ... [2022-12-06 16:19:42,523 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_power.oepc_power.opt_pso.oepc_rmo.oepc_rmo.opt_tso.oepc.i [2022-12-06 16:19:42,534 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 16:19:42,534 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 16:19:42,534 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 16:19:42,561 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 16:19:42,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-06 16:19:42,628 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-06 16:19:42,628 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:19:42,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 16:19:42,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-06 16:19:42,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-06 16:19:42,643 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 16:19:42,647 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4a4d8b44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 16:19:42,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 16:19:42,654 INFO L130 PetriNetUnfolder]: 0/41 cut-off events. [2022-12-06 16:19:42,654 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 16:19:42,654 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:19:42,654 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:19:42,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:19:42,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:19:42,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1241426171, now seen corresponding path program 1 times [2022-12-06 16:19:42,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:19:42,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59424208] [2022-12-06 16:19:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:19:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:19:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:19:43,048 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 16:19:43,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:19:43,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59424208] [2022-12-06 16:19:43,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59424208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:19:43,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:19:43,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 16:19:43,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952988243] [2022-12-06 16:19:43,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:19:43,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 16:19:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:19:43,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 16:19:43,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 16:19:43,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 90 [2022-12-06 16:19:43,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 16:19:43,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:19:43,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 90 [2022-12-06 16:19:43,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:19:43,138 INFO L130 PetriNetUnfolder]: 18/143 cut-off events. [2022-12-06 16:19:43,138 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 16:19:43,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 143 events. 18/143 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 364 event pairs, 2 based on Foata normal form. 10/144 useless extension candidates. Maximal degree in co-relation 149. Up to 31 conditions per place. [2022-12-06 16:19:43,140 INFO L137 encePairwiseOnDemand]: 85/90 looper letters, 10 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2022-12-06 16:19:43,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 88 transitions, 209 flow [2022-12-06 16:19:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 16:19:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 16:19:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2022-12-06 16:19:43,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.9296296296296296 [2022-12-06 16:19:43,153 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2022-12-06 16:19:43,153 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 209 flow [2022-12-06 16:19:43,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 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 16:19:43,153 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:19:43,154 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:19:43,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 16:19:43,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:19:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:19:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1642137115, now seen corresponding path program 1 times [2022-12-06 16:19:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:19:43,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528038266] [2022-12-06 16:19:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:19:43,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:19:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:19:43,359 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 16:19:43,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:19:43,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528038266] [2022-12-06 16:19:43,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528038266] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:19:43,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:19:43,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:19:43,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102988255] [2022-12-06 16:19:43,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:19:43,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:19:43,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:19:43,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:19:43,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:19:43,363 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 90 [2022-12-06 16:19:43,364 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 209 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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 16:19:43,364 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:19:43,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 90 [2022-12-06 16:19:43,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:19:43,604 INFO L130 PetriNetUnfolder]: 173/573 cut-off events. [2022-12-06 16:19:43,604 INFO L131 PetriNetUnfolder]: For 160/214 co-relation queries the response was YES. [2022-12-06 16:19:43,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 573 events. 173/573 cut-off events. For 160/214 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3161 event pairs, 44 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 1041. Up to 166 conditions per place. [2022-12-06 16:19:43,607 INFO L137 encePairwiseOnDemand]: 84/90 looper letters, 21 selfloop transitions, 2 changer transitions 44/128 dead transitions. [2022-12-06 16:19:43,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 128 transitions, 465 flow [2022-12-06 16:19:43,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 16:19:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 16:19:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 681 transitions. [2022-12-06 16:19:43,611 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8407407407407408 [2022-12-06 16:19:43,611 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 8 predicate places. [2022-12-06 16:19:43,611 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 128 transitions, 465 flow [2022-12-06 16:19:43,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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 16:19:43,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:19:43,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:19:43,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 16:19:43,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:19:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:19:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 705728399, now seen corresponding path program 1 times [2022-12-06 16:19:43,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:19:43,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32162897] [2022-12-06 16:19:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:19:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:19:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:19:43,776 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 16:19:43,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:19:43,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32162897] [2022-12-06 16:19:43,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32162897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:19:43,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:19:43,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 16:19:43,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612115340] [2022-12-06 16:19:43,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:19:43,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 16:19:43,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:19:43,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 16:19:43,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-06 16:19:43,778 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 90 [2022-12-06 16:19:43,779 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 128 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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 16:19:43,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:19:43,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 90 [2022-12-06 16:19:43,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:19:43,955 INFO L130 PetriNetUnfolder]: 233/676 cut-off events. [2022-12-06 16:19:43,956 INFO L131 PetriNetUnfolder]: For 520/544 co-relation queries the response was YES. [2022-12-06 16:19:43,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 676 events. 233/676 cut-off events. For 520/544 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3642 event pairs, 10 based on Foata normal form. 1/654 useless extension candidates. Maximal degree in co-relation 1510. Up to 220 conditions per place. [2022-12-06 16:19:43,958 INFO L137 encePairwiseOnDemand]: 81/90 looper letters, 31 selfloop transitions, 5 changer transitions 66/169 dead transitions. [2022-12-06 16:19:43,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 169 transitions, 802 flow [2022-12-06 16:19:43,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:19:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:19:43,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 761 transitions. [2022-12-06 16:19:43,960 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8455555555555555 [2022-12-06 16:19:43,960 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 17 predicate places. [2022-12-06 16:19:43,961 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 169 transitions, 802 flow [2022-12-06 16:19:43,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.66666666666667) internal successors, (424), 6 states have internal predecessors, (424), 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 16:19:43,961 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:19:43,961 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:19:43,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 16:19:43,961 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:19:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:19:43,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1794483426, now seen corresponding path program 1 times [2022-12-06 16:19:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:19:43,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398755558] [2022-12-06 16:19:43,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:19:43,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:19:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:19:44,219 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 16:19:44,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:19:44,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398755558] [2022-12-06 16:19:44,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398755558] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:19:44,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:19:44,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 16:19:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257675875] [2022-12-06 16:19:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:19:44,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 16:19:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:19:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 16:19:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 16:19:44,221 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 90 [2022-12-06 16:19:44,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 169 transitions, 802 flow. Second operand has 7 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 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 16:19:44,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:19:44,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 90 [2022-12-06 16:19:44,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:19:44,418 INFO L130 PetriNetUnfolder]: 183/489 cut-off events. [2022-12-06 16:19:44,418 INFO L131 PetriNetUnfolder]: For 490/582 co-relation queries the response was YES. [2022-12-06 16:19:44,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 489 events. 183/489 cut-off events. For 490/582 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2452 event pairs, 10 based on Foata normal form. 19/497 useless extension candidates. Maximal degree in co-relation 1445. Up to 146 conditions per place. [2022-12-06 16:19:44,419 INFO L137 encePairwiseOnDemand]: 81/90 looper letters, 21 selfloop transitions, 7 changer transitions 87/174 dead transitions. [2022-12-06 16:19:44,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 174 transitions, 1036 flow [2022-12-06 16:19:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 16:19:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 16:19:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 961 transitions. [2022-12-06 16:19:44,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8213675213675213 [2022-12-06 16:19:44,422 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 23 predicate places. [2022-12-06 16:19:44,422 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 174 transitions, 1036 flow [2022-12-06 16:19:44,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 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 16:19:44,422 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:19:44,423 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:19:44,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 16:19:44,423 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:19:44,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:19:44,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1543011277, now seen corresponding path program 1 times [2022-12-06 16:19:44,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:19:44,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285002902] [2022-12-06 16:19:44,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:19:44,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:19:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:19:44,960 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 16:19:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:19:44,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285002902] [2022-12-06 16:19:44,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285002902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:19:44,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:19:44,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-06 16:19:44,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132819897] [2022-12-06 16:19:44,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:19:44,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 16:19:44,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:19:44,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 16:19:44,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-06 16:19:44,962 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 90 [2022-12-06 16:19:44,963 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 174 transitions, 1036 flow. Second operand has 9 states, 9 states have (on average 65.44444444444444) internal successors, (589), 9 states have internal predecessors, (589), 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 16:19:44,963 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:19:44,963 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 90 [2022-12-06 16:19:44,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:19:45,171 INFO L130 PetriNetUnfolder]: 254/708 cut-off events. [2022-12-06 16:19:45,171 INFO L131 PetriNetUnfolder]: For 1071/1201 co-relation queries the response was YES. [2022-12-06 16:19:45,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2327 conditions, 708 events. 254/708 cut-off events. For 1071/1201 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4110 event pairs, 18 based on Foata normal form. 6/699 useless extension candidates. Maximal degree in co-relation 2259. Up to 186 conditions per place. [2022-12-06 16:19:45,173 INFO L137 encePairwiseOnDemand]: 79/90 looper letters, 29 selfloop transitions, 7 changer transitions 106/203 dead transitions. [2022-12-06 16:19:45,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 203 transitions, 1483 flow [2022-12-06 16:19:45,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 16:19:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 16:19:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 670 transitions. [2022-12-06 16:19:45,175 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2022-12-06 16:19:45,176 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 32 predicate places. [2022-12-06 16:19:45,176 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 203 transitions, 1483 flow [2022-12-06 16:19:45,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.44444444444444) internal successors, (589), 9 states have internal predecessors, (589), 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 16:19:45,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:19:45,176 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:19:45,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 16:19:45,177 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:19:45,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:19:45,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1101493943, now seen corresponding path program 2 times [2022-12-06 16:19:45,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:19:45,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183549729] [2022-12-06 16:19:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:19:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:19:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 16:19:45,398 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 16:19:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 16:19:45,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183549729] [2022-12-06 16:19:45,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183549729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 16:19:45,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 16:19:45,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 16:19:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016748470] [2022-12-06 16:19:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 16:19:45,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 16:19:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 16:19:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 16:19:45,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-06 16:19:45,400 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 90 [2022-12-06 16:19:45,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 203 transitions, 1483 flow. Second operand has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 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 16:19:45,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 16:19:45,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 90 [2022-12-06 16:19:45,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 16:19:45,589 INFO L130 PetriNetUnfolder]: 446/1246 cut-off events. [2022-12-06 16:19:45,589 INFO L131 PetriNetUnfolder]: For 2840/3302 co-relation queries the response was YES. [2022-12-06 16:19:45,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 1246 events. 446/1246 cut-off events. For 2840/3302 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8886 event pairs, 25 based on Foata normal form. 34/1262 useless extension candidates. Maximal degree in co-relation 4320. Up to 300 conditions per place. [2022-12-06 16:19:45,593 INFO L137 encePairwiseOnDemand]: 82/90 looper letters, 20 selfloop transitions, 3 changer transitions 193/273 dead transitions. [2022-12-06 16:19:45,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 273 transitions, 2583 flow [2022-12-06 16:19:45,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 16:19:45,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 16:19:45,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 555 transitions. [2022-12-06 16:19:45,594 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7708333333333334 [2022-12-06 16:19:45,596 INFO L294 CegarLoopForPetriNet]: 93 programPoint places, 39 predicate places. [2022-12-06 16:19:45,596 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 273 transitions, 2583 flow [2022-12-06 16:19:45,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 67.5) internal successors, (540), 8 states have internal predecessors, (540), 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 16:19:45,597 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 16:19:45,597 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 16:19:45,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 16:19:45,597 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 16:19:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 16:19:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1506288021, now seen corresponding path program 3 times [2022-12-06 16:19:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 16:19:45,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181037680] [2022-12-06 16:19:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 16:19:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 16:19:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:19:45,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 16:19:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 16:19:45,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 16:19:45,728 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 16:19:45,728 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 16:19:45,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 16:19:45,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 16:19:45,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 16:19:45,730 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 16:19:45,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 16:19:45,730 INFO L458 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-12-06 16:19:45,733 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 16:19:45,734 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 16:19:45,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:19:45 BasicIcfg [2022-12-06 16:19:45,779 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 16:19:45,779 INFO L158 Benchmark]: Toolchain (without parser) took 4270.89ms. Allocated memory was 222.3MB in the beginning and 381.7MB in the end (delta: 159.4MB). Free memory was 197.5MB in the beginning and 325.8MB in the end (delta: -128.3MB). Peak memory consumption was 226.3MB. Max. memory is 8.0GB. [2022-12-06 16:19:45,779 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 222.3MB. Free memory is still 198.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 16:19:45,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.98ms. Allocated memory is still 222.3MB. Free memory was 197.2MB in the beginning and 172.6MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 16:19:45,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.49ms. Allocated memory is still 222.3MB. Free memory was 172.0MB in the beginning and 169.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:19:45,780 INFO L158 Benchmark]: Boogie Preprocessor took 16.68ms. Allocated memory is still 222.3MB. Free memory was 169.9MB in the beginning and 168.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 16:19:45,780 INFO L158 Benchmark]: RCFGBuilder took 511.67ms. Allocated memory is still 222.3MB. Free memory was 168.4MB in the beginning and 137.4MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-06 16:19:45,781 INFO L158 Benchmark]: TraceAbstraction took 3259.50ms. Allocated memory was 222.3MB in the beginning and 381.7MB in the end (delta: 159.4MB). Free memory was 136.9MB in the beginning and 325.8MB in the end (delta: -188.9MB). Peak memory consumption was 165.5MB. Max. memory is 8.0GB. [2022-12-06 16:19:45,782 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.09ms. Allocated memory is still 222.3MB. Free memory is still 198.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.98ms. Allocated memory is still 222.3MB. Free memory was 197.2MB in the beginning and 172.6MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.49ms. Allocated memory is still 222.3MB. Free memory was 172.0MB in the beginning and 169.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.68ms. Allocated memory is still 222.3MB. Free memory was 169.9MB in the beginning and 168.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 511.67ms. Allocated memory is still 222.3MB. Free memory was 168.4MB in the beginning and 137.4MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 3259.50ms. Allocated memory was 222.3MB in the beginning and 381.7MB in the end (delta: 159.4MB). Free memory was 136.9MB in the beginning and 325.8MB in the end (delta: -188.9MB). Peak memory consumption was 165.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L715] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L716] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L718] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L720] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L721] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L722] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L723] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L724] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L725] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L730] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L731] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L732] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L733] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L734] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L736] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] 0 pthread_t t305; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] FCALL, FORK 0 pthread_create(&t305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t305, ((void *)0), P0, ((void *)0))=-1, t305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] 0 pthread_t t306; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t306, ((void *)0), P1, ((void *)0))=0, t305={5:0}, t306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1 = y$w_buff0 [L741] 1 y$w_buff0 = 1 [L742] 1 y$w_buff1_used = y$w_buff0_used [L743] 1 y$w_buff0_used = (_Bool)1 [L744] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L744] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L745] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L746] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L747] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L828] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t305={5:0}, t306={3:0}, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 815]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 813]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 222 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 532 IncrementalHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 44 mSDtfsCounter, 532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2583occurred in iteration=6, InterpolantAutomatonStates: 53, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 442 NumberOfCodeBlocks, 442 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 365 ConstructedInterpolants, 0 QuantifiedInterpolants, 1427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-06 16:19:45,807 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...