/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-SemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 21:36:54,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 21:36:54,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 21:36:54,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 21:36:54,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 21:36:54,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 21:36:54,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 21:36:54,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 21:36:54,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 21:36:54,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 21:36:54,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 21:36:54,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 21:36:54,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 21:36:54,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 21:36:54,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 21:36:54,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 21:36:54,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 21:36:54,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 21:36:55,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 21:36:55,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 21:36:55,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 21:36:55,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 21:36:55,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 21:36:55,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 21:36:55,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 21:36:55,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 21:36:55,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 21:36:55,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 21:36:55,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 21:36:55,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 21:36:55,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 21:36:55,021 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 21:36:55,022 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 21:36:55,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 21:36:55,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 21:36:55,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 21:36:55,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 21:36:55,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 21:36:55,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 21:36:55,024 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 21:36:55,025 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 21:36:55,026 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-SemanticLbe.epf [2022-12-12 21:36:55,053 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 21:36:55,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 21:36:55,054 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 21:36:55,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 21:36:55,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 21:36:55,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 21:36:55,056 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 21:36:55,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 21:36:55,056 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 21:36:55,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 21:36:55,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 21:36:55,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 21:36:55,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 21:36:55,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 21:36:55,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 21:36:55,058 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 21:36:55,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 21:36:55,058 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 21:36:55,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 21:36:55,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 21:36:55,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 21:36:55,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 21:36:55,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 21:36:55,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:55,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 21:36:55,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 21:36:55,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 21:36:55,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 21:36:55,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 21:36:55,059 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 21:36:55,059 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 21:36:55,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 21:36:55,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 21:36:55,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 21:36:55,353 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 21:36:55,354 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 21:36:55,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2022-12-12 21:36:56,439 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 21:36:56,644 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 21:36:56,644 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038.opt.i [2022-12-12 21:36:56,654 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ba58d7c/b05c014b013c4c30be319581a318b87e/FLAG3710715ee [2022-12-12 21:36:56,665 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91ba58d7c/b05c014b013c4c30be319581a318b87e [2022-12-12 21:36:56,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 21:36:56,668 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 21:36:56,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:56,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 21:36:56,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 21:36:56,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77c28c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:56, skipping insertion in model container [2022-12-12 21:36:56,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 09:36:56" (1/1) ... [2022-12-12 21:36:56,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 21:36:56,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 21:36:56,874 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/mix038.opt.i[944,957] [2022-12-12 21:36:57,006 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,007 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,008 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,025 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,026 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,030 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,040 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,041 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,058 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:57,068 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 21:36:57,077 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/mix038.opt.i[944,957] [2022-12-12 21:36:57,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,096 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,097 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 21:36:57,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 21:36:57,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 21:36:57,142 INFO L208 MainTranslator]: Completed translation [2022-12-12 21:36:57,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57 WrapperNode [2022-12-12 21:36:57,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 21:36:57,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:57,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 21:36:57,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 21:36:57,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,199 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2022-12-12 21:36:57,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 21:36:57,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 21:36:57,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 21:36:57,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 21:36:57,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,211 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,217 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 21:36:57,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 21:36:57,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 21:36:57,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 21:36:57,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (1/1) ... [2022-12-12 21:36:57,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 21:36:57,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 21:36:57,268 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-12 21:36:57,275 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-12 21:36:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 21:36:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 21:36:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 21:36:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 21:36:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 21:36:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-12 21:36:57,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-12 21:36:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-12 21:36:57,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-12 21:36:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-12 21:36:57,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-12 21:36:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 21:36:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 21:36:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 21:36:57,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 21:36:57,295 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 21:36:57,382 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 21:36:57,384 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 21:36:57,608 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 21:36:57,711 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 21:36:57,711 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-12 21:36:57,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:57 BoogieIcfgContainer [2022-12-12 21:36:57,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 21:36:57,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 21:36:57,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 21:36:57,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 21:36:57,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 09:36:56" (1/3) ... [2022-12-12 21:36:57,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187627b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:57, skipping insertion in model container [2022-12-12 21:36:57,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 09:36:57" (2/3) ... [2022-12-12 21:36:57,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@187627b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 09:36:57, skipping insertion in model container [2022-12-12 21:36:57,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 09:36:57" (3/3) ... [2022-12-12 21:36:57,718 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2022-12-12 21:36:57,731 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 21:36:57,731 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-12 21:36:57,731 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 21:36:57,788 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-12 21:36:57,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2022-12-12 21:36:57,873 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-12 21:36:57,874 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:57,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:36:57,880 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 110 transitions, 235 flow [2022-12-12 21:36:57,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 107 transitions, 223 flow [2022-12-12 21:36:57,884 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 21:36:57,901 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-12 21:36:57,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 223 flow [2022-12-12 21:36:57,935 INFO L130 PetriNetUnfolder]: 2/107 cut-off events. [2022-12-12 21:36:57,935 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:36:57,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2022-12-12 21:36:57,939 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 107 transitions, 223 flow [2022-12-12 21:36:57,939 INFO L226 LiptonReduction]: Number of co-enabled transitions 1840 [2022-12-12 21:37:02,022 INFO L241 LiptonReduction]: Total number of compositions: 88 [2022-12-12 21:37:02,031 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 21:37:02,035 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;@181d6a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 21:37:02,036 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-12 21:37:02,039 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-12 21:37:02,039 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-12 21:37:02,039 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:02,039 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:02,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:02,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash -14424378, now seen corresponding path program 1 times [2022-12-12 21:37:02,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:02,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137888942] [2022-12-12 21:37:02,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:02,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:02,357 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-12 21:37:02,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:02,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137888942] [2022-12-12 21:37:02,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137888942] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:02,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:02,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:37:02,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6690554] [2022-12-12 21:37:02,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:02,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:02,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:02,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:02,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:02,379 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 56 [2022-12-12 21:37:02,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-12 21:37:02,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:02,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 56 [2022-12-12 21:37:02,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:03,367 INFO L130 PetriNetUnfolder]: 8354/12960 cut-off events. [2022-12-12 21:37:03,367 INFO L131 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-12-12 21:37:03,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24918 conditions, 12960 events. 8354/12960 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 93873 event pairs, 824 based on Foata normal form. 0/7424 useless extension candidates. Maximal degree in co-relation 24907. Up to 10531 conditions per place. [2022-12-12 21:37:03,404 INFO L137 encePairwiseOnDemand]: 50/56 looper letters, 29 selfloop transitions, 3 changer transitions 42/84 dead transitions. [2022-12-12 21:37:03,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 325 flow [2022-12-12 21:37:03,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:03,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-12-12 21:37:03,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6488095238095238 [2022-12-12 21:37:03,415 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 0 predicate places. [2022-12-12 21:37:03,416 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 84 transitions, 325 flow [2022-12-12 21:37:03,435 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 42 transitions, 157 flow [2022-12-12 21:37:03,436 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 157 flow [2022-12-12 21:37:03,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-12 21:37:03,436 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:03,436 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:03,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 21:37:03,437 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:03,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:03,443 INFO L85 PathProgramCache]: Analyzing trace with hash -976891757, now seen corresponding path program 1 times [2022-12-12 21:37:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:03,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388212597] [2022-12-12 21:37:03,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:03,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:03,550 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-12 21:37:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:03,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388212597] [2022-12-12 21:37:03,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388212597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:03,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:03,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 21:37:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043447728] [2022-12-12 21:37:03,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:03,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:03,552 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:37:03,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-12 21:37:03,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:03,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:37:03,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:03,974 INFO L130 PetriNetUnfolder]: 3419/5342 cut-off events. [2022-12-12 21:37:03,975 INFO L131 PetriNetUnfolder]: For 541/541 co-relation queries the response was YES. [2022-12-12 21:37:03,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14802 conditions, 5342 events. 3419/5342 cut-off events. For 541/541 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30874 event pairs, 240 based on Foata normal form. 126/4350 useless extension candidates. Maximal degree in co-relation 14788. Up to 3783 conditions per place. [2022-12-12 21:37:03,997 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 53 selfloop transitions, 8 changer transitions 2/70 dead transitions. [2022-12-12 21:37:03,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 392 flow [2022-12-12 21:37:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-12-12 21:37:03,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.39880952380952384 [2022-12-12 21:37:03,999 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -19 predicate places. [2022-12-12 21:37:03,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 70 transitions, 392 flow [2022-12-12 21:37:04,016 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 68 transitions, 384 flow [2022-12-12 21:37:04,016 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 68 transitions, 384 flow [2022-12-12 21:37:04,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-12 21:37:04,017 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:04,017 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:04,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 21:37:04,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:04,017 INFO L85 PathProgramCache]: Analyzing trace with hash -218873479, now seen corresponding path program 1 times [2022-12-12 21:37:04,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:04,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473841127] [2022-12-12 21:37:04,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:04,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:04,175 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-12 21:37:04,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:04,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473841127] [2022-12-12 21:37:04,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473841127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:04,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:04,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:37:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913727839] [2022-12-12 21:37:04,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:04,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:04,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:04,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:04,180 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:37:04,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 68 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-12 21:37:04,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:04,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:37:04,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:04,527 INFO L130 PetriNetUnfolder]: 2463/3929 cut-off events. [2022-12-12 21:37:04,527 INFO L131 PetriNetUnfolder]: For 354/354 co-relation queries the response was YES. [2022-12-12 21:37:04,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14748 conditions, 3929 events. 2463/3929 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21700 event pairs, 178 based on Foata normal form. 60/3169 useless extension candidates. Maximal degree in co-relation 14731. Up to 2939 conditions per place. [2022-12-12 21:37:04,554 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 68 selfloop transitions, 7 changer transitions 2/84 dead transitions. [2022-12-12 21:37:04,554 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 632 flow [2022-12-12 21:37:04,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:37:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:37:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-12 21:37:04,557 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.33482142857142855 [2022-12-12 21:37:04,558 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -17 predicate places. [2022-12-12 21:37:04,559 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 84 transitions, 632 flow [2022-12-12 21:37:04,579 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 82 transitions, 616 flow [2022-12-12 21:37:04,580 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 82 transitions, 616 flow [2022-12-12 21:37:04,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-12 21:37:04,580 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:04,580 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:04,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 21:37:04,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:04,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1804891999, now seen corresponding path program 1 times [2022-12-12 21:37:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:04,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385314352] [2022-12-12 21:37:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:04,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:04,745 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-12 21:37:04,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:04,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385314352] [2022-12-12 21:37:04,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385314352] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:04,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:04,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:37:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74741930] [2022-12-12 21:37:04,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:04,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:04,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:04,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:04,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:04,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:37:04,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 82 transitions, 616 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-12 21:37:04,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:04,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:37:04,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:05,081 INFO L130 PetriNetUnfolder]: 2168/3494 cut-off events. [2022-12-12 21:37:05,082 INFO L131 PetriNetUnfolder]: For 423/423 co-relation queries the response was YES. [2022-12-12 21:37:05,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16296 conditions, 3494 events. 2168/3494 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 19251 event pairs, 98 based on Foata normal form. 10/2856 useless extension candidates. Maximal degree in co-relation 16276. Up to 2533 conditions per place. [2022-12-12 21:37:05,101 INFO L137 encePairwiseOnDemand]: 49/56 looper letters, 80 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2022-12-12 21:37:05,102 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 103 transitions, 978 flow [2022-12-12 21:37:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:37:05,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:37:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-12 21:37:05,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2022-12-12 21:37:05,104 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -15 predicate places. [2022-12-12 21:37:05,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 103 transitions, 978 flow [2022-12-12 21:37:05,119 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 103 transitions, 978 flow [2022-12-12 21:37:05,120 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 103 transitions, 978 flow [2022-12-12 21:37:05,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-12 21:37:05,120 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:05,120 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:05,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 21:37:05,120 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:05,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 116016837, now seen corresponding path program 1 times [2022-12-12 21:37:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:05,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744830856] [2022-12-12 21:37:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:05,202 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-12 21:37:05,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:05,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744830856] [2022-12-12 21:37:05,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744830856] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:05,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:05,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:37:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524800494] [2022-12-12 21:37:05,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:05,204 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:37:05,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 103 transitions, 978 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-12 21:37:05,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:05,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:37:05,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:05,705 INFO L130 PetriNetUnfolder]: 3913/6081 cut-off events. [2022-12-12 21:37:05,705 INFO L131 PetriNetUnfolder]: For 8789/8882 co-relation queries the response was YES. [2022-12-12 21:37:05,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32036 conditions, 6081 events. 3913/6081 cut-off events. For 8789/8882 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 35703 event pairs, 568 based on Foata normal form. 519/5581 useless extension candidates. Maximal degree in co-relation 32013. Up to 4396 conditions per place. [2022-12-12 21:37:05,737 INFO L137 encePairwiseOnDemand]: 44/56 looper letters, 112 selfloop transitions, 34 changer transitions 122/279 dead transitions. [2022-12-12 21:37:05,737 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 279 transitions, 3211 flow [2022-12-12 21:37:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 21:37:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 21:37:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-12 21:37:05,739 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3964285714285714 [2022-12-12 21:37:05,739 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -11 predicate places. [2022-12-12 21:37:05,739 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 279 transitions, 3211 flow [2022-12-12 21:37:05,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 157 transitions, 1795 flow [2022-12-12 21:37:05,761 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 157 transitions, 1795 flow [2022-12-12 21:37:05,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-12 21:37:05,761 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:05,761 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 21:37:05,761 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash 804185814, now seen corresponding path program 1 times [2022-12-12 21:37:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:05,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114853265] [2022-12-12 21:37:05,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:05,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:05,848 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-12 21:37:05,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:05,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114853265] [2022-12-12 21:37:05,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114853265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:05,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:05,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 21:37:05,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467160564] [2022-12-12 21:37:05,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:05,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 21:37:05,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:05,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 21:37:05,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 21:37:05,850 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2022-12-12 21:37:05,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 157 transitions, 1795 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-12 21:37:05,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:05,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2022-12-12 21:37:05,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:06,400 INFO L130 PetriNetUnfolder]: 4040/6263 cut-off events. [2022-12-12 21:37:06,400 INFO L131 PetriNetUnfolder]: For 11359/11488 co-relation queries the response was YES. [2022-12-12 21:37:06,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38042 conditions, 6263 events. 4040/6263 cut-off events. For 11359/11488 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 36168 event pairs, 723 based on Foata normal form. 219/5411 useless extension candidates. Maximal degree in co-relation 38016. Up to 5744 conditions per place. [2022-12-12 21:37:06,432 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 127 selfloop transitions, 11 changer transitions 52/203 dead transitions. [2022-12-12 21:37:06,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 203 transitions, 2733 flow [2022-12-12 21:37:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 21:37:06,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 21:37:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-12 21:37:06,433 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-12 21:37:06,434 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -11 predicate places. [2022-12-12 21:37:06,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 203 transitions, 2733 flow [2022-12-12 21:37:06,456 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 151 transitions, 2003 flow [2022-12-12 21:37:06,456 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 151 transitions, 2003 flow [2022-12-12 21:37:06,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-12 21:37:06,456 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:06,471 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:06,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 21:37:06,472 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:06,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1756619122, now seen corresponding path program 1 times [2022-12-12 21:37:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:06,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891426666] [2022-12-12 21:37:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:06,636 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-12 21:37:06,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:06,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891426666] [2022-12-12 21:37:06,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891426666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:06,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:06,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105906009] [2022-12-12 21:37:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:06,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:06,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:06,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:06,638 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:37:06,638 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 151 transitions, 2003 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-12 21:37:06,638 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:06,638 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:37:06,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:07,110 INFO L130 PetriNetUnfolder]: 2427/4268 cut-off events. [2022-12-12 21:37:07,110 INFO L131 PetriNetUnfolder]: For 9057/9231 co-relation queries the response was YES. [2022-12-12 21:37:07,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29758 conditions, 4268 events. 2427/4268 cut-off events. For 9057/9231 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 28413 event pairs, 207 based on Foata normal form. 578/4108 useless extension candidates. Maximal degree in co-relation 29729. Up to 3880 conditions per place. [2022-12-12 21:37:07,128 INFO L137 encePairwiseOnDemand]: 44/56 looper letters, 93 selfloop transitions, 57 changer transitions 106/266 dead transitions. [2022-12-12 21:37:07,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 266 transitions, 4038 flow [2022-12-12 21:37:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 21:37:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 21:37:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2022-12-12 21:37:07,130 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2022-12-12 21:37:07,131 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -6 predicate places. [2022-12-12 21:37:07,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 266 transitions, 4038 flow [2022-12-12 21:37:07,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 160 transitions, 2402 flow [2022-12-12 21:37:07,143 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 160 transitions, 2402 flow [2022-12-12 21:37:07,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-12 21:37:07,143 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:07,144 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:07,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 21:37:07,144 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:07,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash -941704094, now seen corresponding path program 1 times [2022-12-12 21:37:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:07,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829747277] [2022-12-12 21:37:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:07,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:07,292 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-12 21:37:07,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:07,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829747277] [2022-12-12 21:37:07,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829747277] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:07,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:07,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 21:37:07,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366396468] [2022-12-12 21:37:07,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:07,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 21:37:07,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:07,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 21:37:07,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 21:37:07,295 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:37:07,295 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 160 transitions, 2402 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-12 21:37:07,295 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:07,296 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:37:07,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:07,552 INFO L130 PetriNetUnfolder]: 855/1909 cut-off events. [2022-12-12 21:37:07,552 INFO L131 PetriNetUnfolder]: For 6466/6609 co-relation queries the response was YES. [2022-12-12 21:37:07,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14931 conditions, 1909 events. 855/1909 cut-off events. For 6466/6609 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 13742 event pairs, 15 based on Foata normal form. 365/1994 useless extension candidates. Maximal degree in co-relation 14899. Up to 1672 conditions per place. [2022-12-12 21:37:07,560 INFO L137 encePairwiseOnDemand]: 44/56 looper letters, 63 selfloop transitions, 66 changer transitions 42/179 dead transitions. [2022-12-12 21:37:07,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 179 transitions, 3014 flow [2022-12-12 21:37:07,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:37:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:37:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-12-12 21:37:07,562 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3239795918367347 [2022-12-12 21:37:07,562 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -2 predicate places. [2022-12-12 21:37:07,562 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 179 transitions, 3014 flow [2022-12-12 21:37:07,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 137 transitions, 2312 flow [2022-12-12 21:37:07,568 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 137 transitions, 2312 flow [2022-12-12 21:37:07,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-12 21:37:07,569 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:07,569 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:07,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 21:37:07,569 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -514538857, now seen corresponding path program 1 times [2022-12-12 21:37:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:07,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816023664] [2022-12-12 21:37:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:07,725 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-12 21:37:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:07,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816023664] [2022-12-12 21:37:07,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816023664] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:07,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:07,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 21:37:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654423688] [2022-12-12 21:37:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:07,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 21:37:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:07,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 21:37:07,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 21:37:07,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 56 [2022-12-12 21:37:07,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 137 transitions, 2312 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-12 21:37:07,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:07,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 56 [2022-12-12 21:37:07,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:07,870 INFO L130 PetriNetUnfolder]: 584/1140 cut-off events. [2022-12-12 21:37:07,870 INFO L131 PetriNetUnfolder]: For 4138/4171 co-relation queries the response was YES. [2022-12-12 21:37:07,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10055 conditions, 1140 events. 584/1140 cut-off events. For 4138/4171 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6094 event pairs, 0 based on Foata normal form. 32/957 useless extension candidates. Maximal degree in co-relation 10020. Up to 1033 conditions per place. [2022-12-12 21:37:07,874 INFO L137 encePairwiseOnDemand]: 53/56 looper letters, 55 selfloop transitions, 2 changer transitions 124/193 dead transitions. [2022-12-12 21:37:07,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 193 transitions, 3674 flow [2022-12-12 21:37:07,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 21:37:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 21:37:07,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-12-12 21:37:07,876 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3392857142857143 [2022-12-12 21:37:07,876 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, -2 predicate places. [2022-12-12 21:37:07,876 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 193 transitions, 3674 flow [2022-12-12 21:37:07,879 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 69 transitions, 1225 flow [2022-12-12 21:37:07,880 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 69 transitions, 1225 flow [2022-12-12 21:37:07,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-12 21:37:07,880 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:07,880 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:07,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 21:37:07,880 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash 662143922, now seen corresponding path program 1 times [2022-12-12 21:37:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:07,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341658232] [2022-12-12 21:37:07,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 21:37:08,194 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-12 21:37:08,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 21:37:08,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341658232] [2022-12-12 21:37:08,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341658232] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 21:37:08,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 21:37:08,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 21:37:08,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750882345] [2022-12-12 21:37:08,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 21:37:08,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 21:37:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 21:37:08,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 21:37:08,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 21:37:08,195 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2022-12-12 21:37:08,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 1225 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-12 21:37:08,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 21:37:08,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2022-12-12 21:37:08,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 21:37:08,338 INFO L130 PetriNetUnfolder]: 269/633 cut-off events. [2022-12-12 21:37:08,338 INFO L131 PetriNetUnfolder]: For 1552/1552 co-relation queries the response was YES. [2022-12-12 21:37:08,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 633 events. 269/633 cut-off events. For 1552/1552 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3708 event pairs, 0 based on Foata normal form. 27/526 useless extension candidates. Maximal degree in co-relation 5957. Up to 604 conditions per place. [2022-12-12 21:37:08,341 INFO L137 encePairwiseOnDemand]: 47/56 looper letters, 35 selfloop transitions, 8 changer transitions 56/109 dead transitions. [2022-12-12 21:37:08,341 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 109 transitions, 2211 flow [2022-12-12 21:37:08,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 21:37:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 21:37:08,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2022-12-12 21:37:08,342 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2423469387755102 [2022-12-12 21:37:08,343 INFO L295 CegarLoopForPetriNet]: 65 programPoint places, 2 predicate places. [2022-12-12 21:37:08,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 109 transitions, 2211 flow [2022-12-12 21:37:08,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 53 transitions, 1009 flow [2022-12-12 21:37:08,345 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 1009 flow [2022-12-12 21:37:08,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-12 21:37:08,345 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 21:37:08,345 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:08,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 21:37:08,346 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-12 21:37:08,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 21:37:08,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1813719133, now seen corresponding path program 1 times [2022-12-12 21:37:08,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 21:37:08,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205592441] [2022-12-12 21:37:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 21:37:08,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 21:37:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:37:08,380 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-12 21:37:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-12 21:37:08,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-12 21:37:08,440 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-12 21:37:08,440 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-12 21:37:08,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-12 21:37:08,441 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-12 21:37:08,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-12 21:37:08,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-12 21:37:08,442 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-12 21:37:08,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 21:37:08,442 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 21:37:08,446 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 21:37:08,446 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 21:37:08,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 09:37:08 BasicIcfg [2022-12-12 21:37:08,490 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 21:37:08,490 INFO L158 Benchmark]: Toolchain (without parser) took 11822.39ms. Allocated memory was 180.4MB in the beginning and 740.3MB in the end (delta: 559.9MB). Free memory was 154.9MB in the beginning and 493.6MB in the end (delta: -338.7MB). Peak memory consumption was 222.6MB. Max. memory is 8.0GB. [2022-12-12 21:37:08,490 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 21:37:08,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 474.19ms. Allocated memory is still 180.4MB. Free memory was 154.9MB in the beginning and 128.9MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-12 21:37:08,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.14ms. Allocated memory is still 180.4MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:37:08,491 INFO L158 Benchmark]: Boogie Preprocessor took 20.11ms. Allocated memory is still 180.4MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 21:37:08,491 INFO L158 Benchmark]: RCFGBuilder took 492.40ms. Allocated memory is still 180.4MB. Free memory was 124.2MB in the beginning and 94.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-12-12 21:37:08,491 INFO L158 Benchmark]: TraceAbstraction took 10775.29ms. Allocated memory was 180.4MB in the beginning and 740.3MB in the end (delta: 559.9MB). Free memory was 93.3MB in the beginning and 493.6MB in the end (delta: -400.3MB). Peak memory consumption was 160.7MB. Max. memory is 8.0GB. [2022-12-12 21:37:08,492 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 180.4MB. Free memory is still 156.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 474.19ms. Allocated memory is still 180.4MB. Free memory was 154.9MB in the beginning and 128.9MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.14ms. Allocated memory is still 180.4MB. Free memory was 128.4MB in the beginning and 126.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.11ms. Allocated memory is still 180.4MB. Free memory was 126.3MB in the beginning and 124.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 492.40ms. Allocated memory is still 180.4MB. Free memory was 124.2MB in the beginning and 94.3MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 10775.29ms. Allocated memory was 180.4MB in the beginning and 740.3MB in the end (delta: 559.9MB). Free memory was 93.3MB in the beginning and 493.6MB in the end (delta: -400.3MB). Peak memory consumption was 160.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 115 PlacesBefore, 65 PlacesAfterwards, 107 TransitionsBefore, 56 TransitionsAfterwards, 1840 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 40 TrivialYvCompositions, 43 ConcurrentYvCompositions, 3 ChoiceCompositions, 88 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3464, independent: 3343, independent conditional: 3343, independent unconditional: 0, dependent: 121, dependent conditional: 121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3464, independent: 3343, independent conditional: 0, independent unconditional: 3343, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3464, independent: 3343, independent conditional: 0, independent unconditional: 3343, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3464, independent: 3343, independent conditional: 0, independent unconditional: 3343, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1952, independent: 1905, independent conditional: 0, independent unconditional: 1905, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1952, independent: 1871, independent conditional: 0, independent unconditional: 1871, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3464, independent: 1438, independent conditional: 0, independent unconditional: 1438, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 1952, unknown conditional: 0, unknown unconditional: 1952] , Statistics on independence cache: Total cache size (in pairs): 3696, Positive cache size: 3649, Positive conditional cache size: 0, Positive unconditional cache size: 3649, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1004, ((void *)0), P0, ((void *)0))=-1, t1004={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1005, ((void *)0), P1, ((void *)0))=0, t1004={5:0}, t1005={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1006, ((void *)0), P2, ((void *)0))=1, t1004={5:0}, t1005={6:0}, t1006={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L802] 3 z = 1 [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 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) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 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) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 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 [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 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 [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] - 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: 838]: 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: 834]: 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: 836]: 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 7 procedures, 137 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.1s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 904 IncrementalHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 13 mSDtfsCounter, 904 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2402occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 8327 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 634 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-12 21:37:08,515 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...