/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:22:41,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:22:41,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:22:42,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:22:42,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:22:42,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:22:42,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:22:42,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:22:42,014 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:22:42,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:22:42,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:22:42,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:22:42,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:22:42,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:22:42,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:22:42,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:22:42,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:22:42,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:22:42,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:22:42,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:22:42,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:22:42,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:22:42,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:22:42,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:22:42,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:22:42,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:22:42,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:22:42,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:22:42,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:22:42,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:22:42,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:22:42,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:22:42,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:22:42,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:22:42,033 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:22:42,033 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:22:42,034 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:22:42,034 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:22:42,034 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:22:42,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:22:42,035 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:22:42,036 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-05 20:22:42,051 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:22:42,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:22:42,052 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:22:42,052 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:22:42,053 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:22:42,053 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:22:42,053 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:22:42,053 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:22:42,053 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:22:42,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:22:42,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:22:42,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:22:42,054 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:22:42,054 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:22:42,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:22:42,054 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:22:42,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:22:42,054 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:22:42,054 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:22:42,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:22:42,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:22:42,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:22:42,055 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:22:42,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:42,055 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:22:42,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:22:42,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:22:42,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:22:42,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:22:42,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:22:42,056 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-05 20:22:42,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:22:42,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:22:42,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:22:42,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:22:42,340 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:22:42,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2022-12-05 20:22:43,374 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:22:43,625 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:22:43,625 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2022-12-05 20:22:43,673 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727e8154c/81e5b1df683b45cb92b6d62f91b0649e/FLAG544420746 [2022-12-05 20:22:43,686 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/727e8154c/81e5b1df683b45cb92b6d62f91b0649e [2022-12-05 20:22:43,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:22:43,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:22:43,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:22:43,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:22:43,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:22:43,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:22:43" (1/1) ... [2022-12-05 20:22:43,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc66ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:43, skipping insertion in model container [2022-12-05 20:22:43,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:22:43" (1/1) ... [2022-12-05 20:22:43,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:22:43,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:22:43,856 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/mix035.oepc.i[945,958] [2022-12-05 20:22:43,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,962 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,970 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,974 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,975 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,986 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,987 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,988 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,989 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:43,996 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:43,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:22:44,008 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:22:44,020 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/mix035.oepc.i[945,958] [2022-12-05 20:22:44,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,077 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,078 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,079 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,082 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:22:44,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:22:44,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:22:44,134 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:22:44,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44 WrapperNode [2022-12-05 20:22:44,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:22:44,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:22:44,136 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:22:44,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:22:44,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,240 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-12-05 20:22:44,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:22:44,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:22:44,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:22:44,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:22:44,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,266 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:22:44,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:22:44,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:22:44,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:22:44,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (1/1) ... [2022-12-05 20:22:44,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:22:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:22:44,320 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-05 20:22:44,351 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-05 20:22:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:22:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:22:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:22:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:22:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:22:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:22:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:22:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:22:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:22:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-05 20:22:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-05 20:22:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:22:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:22:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:22:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:22:44,381 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:22:44,511 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:22:44,513 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:22:44,740 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:22:44,875 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:22:44,875 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:22:44,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:22:44 BoogieIcfgContainer [2022-12-05 20:22:44,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:22:44,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:22:44,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:22:44,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:22:44,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:22:43" (1/3) ... [2022-12-05 20:22:44,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5f25f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:22:44, skipping insertion in model container [2022-12-05 20:22:44,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:22:44" (2/3) ... [2022-12-05 20:22:44,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5f25f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:22:44, skipping insertion in model container [2022-12-05 20:22:44,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:22:44" (3/3) ... [2022-12-05 20:22:44,887 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035.oepc.i [2022-12-05 20:22:44,901 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:22:44,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:22:44,901 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:22:44,955 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:22:44,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-05 20:22:45,046 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-05 20:22:45,047 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:45,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-05 20:22:45,053 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-05 20:22:45,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-05 20:22:45,059 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:22:45,076 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-05 20:22:45,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2022-12-05 20:22:45,109 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-05 20:22:45,109 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:45,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2022-12-05 20:22:45,112 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-05 20:22:45,112 INFO L188 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-05 20:22:48,769 INFO L203 LiptonReduction]: Total number of compositions: 86 [2022-12-05 20:22:48,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:22:48,792 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;@5e79fadf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:22:48,792 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-05 20:22:48,794 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-05 20:22:48,794 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:22:48,794 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:48,795 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-05 20:22:48,796 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:48,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:48,805 INFO L85 PathProgramCache]: Analyzing trace with hash 481496, now seen corresponding path program 1 times [2022-12-05 20:22:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:48,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727889046] [2022-12-05 20:22:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:49,114 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-05 20:22:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:49,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727889046] [2022-12-05 20:22:49,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727889046] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:49,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:49,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:49,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547815057] [2022-12-05 20:22:49,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:49,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:49,136 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 20:22:49,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:49,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:49,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 20:22:49,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:49,376 INFO L130 PetriNetUnfolder]: 1330/2127 cut-off events. [2022-12-05 20:22:49,376 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-05 20:22:49,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4141 conditions, 2127 events. 1330/2127 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11682 event pairs, 214 based on Foata normal form. 0/1913 useless extension candidates. Maximal degree in co-relation 4130. Up to 1594 conditions per place. [2022-12-05 20:22:49,386 INFO L137 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 2 changer transitions 8/45 dead transitions. [2022-12-05 20:22:49,386 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 191 flow [2022-12-05 20:22:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-05 20:22:49,395 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2022-12-05 20:22:49,396 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 54 transitions. [2022-12-05 20:22:49,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 191 flow [2022-12-05 20:22:49,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 186 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 20:22:49,399 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 54 flow [2022-12-05 20:22:49,401 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-05 20:22:49,403 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2022-12-05 20:22:49,403 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 54 flow [2022-12-05 20:22:49,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:49,403 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:49,403 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:49,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:22:49,404 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:49,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:49,404 INFO L85 PathProgramCache]: Analyzing trace with hash 259675895, now seen corresponding path program 1 times [2022-12-05 20:22:49,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:49,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431850188] [2022-12-05 20:22:49,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:49,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:49,512 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-05 20:22:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:49,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431850188] [2022-12-05 20:22:49,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431850188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:49,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:49,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:22:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399794127] [2022-12-05 20:22:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:49,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:22:49,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:22:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:22:49,515 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 20:22:49,515 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:49,515 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:49,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 20:22:49,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:49,676 INFO L130 PetriNetUnfolder]: 775/1173 cut-off events. [2022-12-05 20:22:49,677 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-05 20:22:49,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 1173 events. 775/1173 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4968 event pairs, 263 based on Foata normal form. 32/1201 useless extension candidates. Maximal degree in co-relation 2475. Up to 817 conditions per place. [2022-12-05 20:22:49,682 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 26 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2022-12-05 20:22:49,682 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 128 flow [2022-12-05 20:22:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:22:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:22:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 20:22:49,683 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40229885057471265 [2022-12-05 20:22:49,684 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 54 flow. Second operand 3 states and 35 transitions. [2022-12-05 20:22:49,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 128 flow [2022-12-05 20:22:49,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:49,685 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-12-05 20:22:49,685 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-05 20:22:49,685 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -6 predicate places. [2022-12-05 20:22:49,686 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-12-05 20:22:49,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:22:49,686 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:49,686 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:49,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:22:49,686 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:49,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash 380850722, now seen corresponding path program 1 times [2022-12-05 20:22:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:49,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445825788] [2022-12-05 20:22:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:49,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:49,845 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-05 20:22:49,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:49,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445825788] [2022-12-05 20:22:49,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445825788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:49,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:49,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:49,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234951631] [2022-12-05 20:22:49,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:49,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:49,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:49,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:49,847 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 20:22:49,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-05 20:22:49,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:49,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 20:22:49,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:50,052 INFO L130 PetriNetUnfolder]: 597/974 cut-off events. [2022-12-05 20:22:50,052 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-05 20:22:50,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 974 events. 597/974 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4522 event pairs, 119 based on Foata normal form. 96/1066 useless extension candidates. Maximal degree in co-relation 2108. Up to 551 conditions per place. [2022-12-05 20:22:50,055 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 31 selfloop transitions, 4 changer transitions 23/60 dead transitions. [2022-12-05 20:22:50,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 60 transitions, 263 flow [2022-12-05 20:22:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:22:50,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:22:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-12-05 20:22:50,056 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2022-12-05 20:22:50,057 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 5 states and 70 transitions. [2022-12-05 20:22:50,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 60 transitions, 263 flow [2022-12-05 20:22:50,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:50,058 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 90 flow [2022-12-05 20:22:50,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-05 20:22:50,059 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2022-12-05 20:22:50,059 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 90 flow [2022-12-05 20:22:50,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-05 20:22:50,059 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:50,059 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:22:50,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash -830516136, now seen corresponding path program 1 times [2022-12-05 20:22:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033604861] [2022-12-05 20:22:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:50,181 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-05 20:22:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:50,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033604861] [2022-12-05 20:22:50,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033604861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:50,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:50,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701966854] [2022-12-05 20:22:50,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:50,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:22:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:50,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:22:50,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:22:50,183 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 20:22:50,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-05 20:22:50,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:50,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 20:22:50,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:50,337 INFO L130 PetriNetUnfolder]: 291/518 cut-off events. [2022-12-05 20:22:50,338 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-12-05 20:22:50,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 518 events. 291/518 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2178 event pairs, 83 based on Foata normal form. 51/565 useless extension candidates. Maximal degree in co-relation 1409. Up to 168 conditions per place. [2022-12-05 20:22:50,340 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 41 selfloop transitions, 7 changer transitions 23/73 dead transitions. [2022-12-05 20:22:50,340 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 73 transitions, 376 flow [2022-12-05 20:22:50,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:22:50,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:22:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-12-05 20:22:50,341 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4885057471264368 [2022-12-05 20:22:50,341 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 90 flow. Second operand 6 states and 85 transitions. [2022-12-05 20:22:50,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 73 transitions, 376 flow [2022-12-05 20:22:50,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 73 transitions, 370 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:50,344 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 140 flow [2022-12-05 20:22:50,344 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=140, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-05 20:22:50,344 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-05 20:22:50,345 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 140 flow [2022-12-05 20:22:50,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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-05 20:22:50,345 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:50,345 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:50,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:22:50,345 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:50,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:50,345 INFO L85 PathProgramCache]: Analyzing trace with hash -46400173, now seen corresponding path program 1 times [2022-12-05 20:22:50,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:50,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564286842] [2022-12-05 20:22:50,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:50,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:50,930 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-05 20:22:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:50,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564286842] [2022-12-05 20:22:50,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564286842] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:50,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:50,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:22:50,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729758113] [2022-12-05 20:22:50,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:50,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:22:50,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:50,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:22:50,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:22:50,932 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 20:22:50,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-05 20:22:50,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:50,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 20:22:50,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:51,147 INFO L130 PetriNetUnfolder]: 334/659 cut-off events. [2022-12-05 20:22:51,147 INFO L131 PetriNetUnfolder]: For 872/872 co-relation queries the response was YES. [2022-12-05 20:22:51,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 659 events. 334/659 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3214 event pairs, 79 based on Foata normal form. 7/665 useless extension candidates. Maximal degree in co-relation 2079. Up to 277 conditions per place. [2022-12-05 20:22:51,150 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 57 selfloop transitions, 8 changer transitions 24/91 dead transitions. [2022-12-05 20:22:51,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 91 transitions, 666 flow [2022-12-05 20:22:51,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:22:51,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:22:51,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 82 transitions. [2022-12-05 20:22:51,151 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4039408866995074 [2022-12-05 20:22:51,152 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 140 flow. Second operand 7 states and 82 transitions. [2022-12-05 20:22:51,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 91 transitions, 666 flow [2022-12-05 20:22:51,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 91 transitions, 548 flow, removed 45 selfloop flow, removed 4 redundant places. [2022-12-05 20:22:51,156 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 164 flow [2022-12-05 20:22:51,156 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2022-12-05 20:22:51,157 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-05 20:22:51,157 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 164 flow [2022-12-05 20:22:51,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-05 20:22:51,157 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:51,157 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:51,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:22:51,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:51,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash 198509837, now seen corresponding path program 2 times [2022-12-05 20:22:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:51,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824058410] [2022-12-05 20:22:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:51,293 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-05 20:22:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:51,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824058410] [2022-12-05 20:22:51,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824058410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:51,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:51,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:22:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414452682] [2022-12-05 20:22:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:51,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:22:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:51,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:22:51,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:22:51,297 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 20:22:51,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 164 flow. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-05 20:22:51,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:51,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 20:22:51,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:51,452 INFO L130 PetriNetUnfolder]: 252/478 cut-off events. [2022-12-05 20:22:51,453 INFO L131 PetriNetUnfolder]: For 546/546 co-relation queries the response was YES. [2022-12-05 20:22:51,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1588 conditions, 478 events. 252/478 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2136 event pairs, 73 based on Foata normal form. 23/497 useless extension candidates. Maximal degree in co-relation 1573. Up to 184 conditions per place. [2022-12-05 20:22:51,455 INFO L137 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 10 changer transitions 15/77 dead transitions. [2022-12-05 20:22:51,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 498 flow [2022-12-05 20:22:51,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:22:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:22:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2022-12-05 20:22:51,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.37438423645320196 [2022-12-05 20:22:51,457 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 164 flow. Second operand 7 states and 76 transitions. [2022-12-05 20:22:51,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 498 flow [2022-12-05 20:22:51,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 77 transitions, 468 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-05 20:22:51,459 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 178 flow [2022-12-05 20:22:51,459 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2022-12-05 20:22:51,460 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-05 20:22:51,460 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 178 flow [2022-12-05 20:22:51,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-05 20:22:51,460 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:51,460 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:51,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:22:51,461 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:51,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:51,461 INFO L85 PathProgramCache]: Analyzing trace with hash -321527155, now seen corresponding path program 1 times [2022-12-05 20:22:51,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:51,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136899273] [2022-12-05 20:22:51,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:51,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:51,598 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-05 20:22:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:51,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136899273] [2022-12-05 20:22:51,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136899273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:51,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:51,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252752334] [2022-12-05 20:22:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:51,599 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-05 20:22:51,600 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 178 flow. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-05 20:22:51,600 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:51,600 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-05 20:22:51,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:51,735 INFO L130 PetriNetUnfolder]: 526/948 cut-off events. [2022-12-05 20:22:51,735 INFO L131 PetriNetUnfolder]: For 1388/1388 co-relation queries the response was YES. [2022-12-05 20:22:51,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3223 conditions, 948 events. 526/948 cut-off events. For 1388/1388 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4512 event pairs, 48 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 3203. Up to 519 conditions per place. [2022-12-05 20:22:51,740 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 67 selfloop transitions, 9 changer transitions 7/83 dead transitions. [2022-12-05 20:22:51,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 83 transitions, 592 flow [2022-12-05 20:22:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:22:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:22:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-12-05 20:22:51,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4068965517241379 [2022-12-05 20:22:51,741 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 178 flow. Second operand 5 states and 59 transitions. [2022-12-05 20:22:51,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 83 transitions, 592 flow [2022-12-05 20:22:51,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 512 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-05 20:22:51,746 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 202 flow [2022-12-05 20:22:51,746 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2022-12-05 20:22:51,747 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2022-12-05 20:22:51,747 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 202 flow [2022-12-05 20:22:51,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-05 20:22:51,747 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:51,747 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:51,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:22:51,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:51,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1929889729, now seen corresponding path program 2 times [2022-12-05 20:22:51,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:51,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851206095] [2022-12-05 20:22:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:51,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:51,916 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-05 20:22:51,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:51,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851206095] [2022-12-05 20:22:51,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851206095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:51,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:51,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:22:51,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659936119] [2022-12-05 20:22:51,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:51,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:22:51,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:51,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:22:51,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:22:51,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 29 [2022-12-05 20:22:51,918 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-05 20:22:51,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:51,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 29 [2022-12-05 20:22:51,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:52,060 INFO L130 PetriNetUnfolder]: 647/1217 cut-off events. [2022-12-05 20:22:52,061 INFO L131 PetriNetUnfolder]: For 1772/1779 co-relation queries the response was YES. [2022-12-05 20:22:52,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4430 conditions, 1217 events. 647/1217 cut-off events. For 1772/1779 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6649 event pairs, 183 based on Foata normal form. 2/1212 useless extension candidates. Maximal degree in co-relation 4410. Up to 520 conditions per place. [2022-12-05 20:22:52,065 INFO L137 encePairwiseOnDemand]: 26/29 looper letters, 45 selfloop transitions, 1 changer transitions 29/78 dead transitions. [2022-12-05 20:22:52,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 78 transitions, 555 flow [2022-12-05 20:22:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:22:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:22:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-12-05 20:22:52,066 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3793103448275862 [2022-12-05 20:22:52,067 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 202 flow. Second operand 4 states and 44 transitions. [2022-12-05 20:22:52,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 78 transitions, 555 flow [2022-12-05 20:22:52,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 78 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:22:52,074 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 206 flow [2022-12-05 20:22:52,075 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2022-12-05 20:22:52,075 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-05 20:22:52,075 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 206 flow [2022-12-05 20:22:52,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-05 20:22:52,075 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:52,076 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:52,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:22:52,076 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1678657599, now seen corresponding path program 3 times [2022-12-05 20:22:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:52,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825460554] [2022-12-05 20:22:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:22:52,688 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-05 20:22:52,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:22:52,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825460554] [2022-12-05 20:22:52,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825460554] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:22:52,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:22:52,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:22:52,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953414569] [2022-12-05 20:22:52,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:22:52,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:22:52,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:22:52,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:22:52,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:22:52,692 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-05 20:22:52,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-05 20:22:52,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:22:52,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-05 20:22:52,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:22:52,938 INFO L130 PetriNetUnfolder]: 433/896 cut-off events. [2022-12-05 20:22:52,939 INFO L131 PetriNetUnfolder]: For 1348/1371 co-relation queries the response was YES. [2022-12-05 20:22:52,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3276 conditions, 896 events. 433/896 cut-off events. For 1348/1371 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5023 event pairs, 72 based on Foata normal form. 9/900 useless extension candidates. Maximal degree in co-relation 3258. Up to 352 conditions per place. [2022-12-05 20:22:52,942 INFO L137 encePairwiseOnDemand]: 22/29 looper letters, 42 selfloop transitions, 5 changer transitions 46/98 dead transitions. [2022-12-05 20:22:52,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 98 transitions, 696 flow [2022-12-05 20:22:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-05 20:22:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-05 20:22:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 71 transitions. [2022-12-05 20:22:52,944 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3497536945812808 [2022-12-05 20:22:52,944 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 206 flow. Second operand 7 states and 71 transitions. [2022-12-05 20:22:52,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 98 transitions, 696 flow [2022-12-05 20:22:52,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 98 transitions, 691 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:22:52,950 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 242 flow [2022-12-05 20:22:52,950 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=242, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2022-12-05 20:22:52,951 INFO L294 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2022-12-05 20:22:52,951 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 242 flow [2022-12-05 20:22:52,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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-05 20:22:52,951 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:22:52,951 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:22:52,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:22:52,952 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-05 20:22:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:22:52,952 INFO L85 PathProgramCache]: Analyzing trace with hash -735285431, now seen corresponding path program 4 times [2022-12-05 20:22:52,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:22:52,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462892160] [2022-12-05 20:22:52,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:22:52,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:22:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:52,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:22:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:22:53,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:22:53,062 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:22:53,063 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-05 20:22:53,066 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-05 20:22:53,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-05 20:22:53,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-05 20:22:53,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-05 20:22:53,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-05 20:22:53,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:22:53,068 INFO L458 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2022-12-05 20:22:53,072 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:22:53,072 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:22:53,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:22:53 BasicIcfg [2022-12-05 20:22:53,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:22:53,116 INFO L158 Benchmark]: Toolchain (without parser) took 9426.52ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 164.3MB in the beginning and 158.9MB in the end (delta: 5.4MB). Peak memory consumption was 151.0MB. Max. memory is 8.0GB. [2022-12-05 20:22:53,116 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 105.4MB in the beginning and 105.4MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:22:53,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.95ms. Allocated memory is still 189.8MB. Free memory was 164.3MB in the beginning and 137.5MB in the end (delta: 26.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-12-05 20:22:53,116 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.68ms. Allocated memory is still 189.8MB. Free memory was 137.5MB in the beginning and 167.7MB in the end (delta: -30.3MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2022-12-05 20:22:53,116 INFO L158 Benchmark]: Boogie Preprocessor took 27.03ms. Allocated memory is still 189.8MB. Free memory was 167.7MB in the beginning and 166.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:22:53,117 INFO L158 Benchmark]: RCFGBuilder took 609.64ms. Allocated memory is still 189.8MB. Free memory was 165.6MB in the beginning and 131.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-12-05 20:22:53,117 INFO L158 Benchmark]: TraceAbstraction took 8234.10ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 130.5MB in the beginning and 158.9MB in the end (delta: -28.4MB). Peak memory consumption was 116.8MB. Max. memory is 8.0GB. [2022-12-05 20:22:53,118 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 105.4MB in the beginning and 105.4MB in the end (delta: 34.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 444.95ms. Allocated memory is still 189.8MB. Free memory was 164.3MB in the beginning and 137.5MB in the end (delta: 26.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 104.68ms. Allocated memory is still 189.8MB. Free memory was 137.5MB in the beginning and 167.7MB in the end (delta: -30.3MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.03ms. Allocated memory is still 189.8MB. Free memory was 167.7MB in the beginning and 166.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 609.64ms. Allocated memory is still 189.8MB. Free memory was 165.6MB in the beginning and 131.6MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8234.10ms. Allocated memory was 189.8MB in the beginning and 333.4MB in the end (delta: 143.7MB). Free memory was 130.5MB in the beginning and 158.9MB in the end (delta: -28.4MB). Peak memory consumption was 116.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 118 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 29 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 43 ConcurrentYvCompositions, 1 ChoiceCompositions, 86 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1525, independent: 1464, independent conditional: 1464, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1525, independent: 1464, independent conditional: 0, independent unconditional: 1464, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1525, independent: 1464, independent conditional: 0, independent unconditional: 1464, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1525, independent: 1464, independent conditional: 0, independent unconditional: 1464, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1241, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1241, independent: 1186, independent conditional: 0, independent unconditional: 1186, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 55, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 158, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1525, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1241, unknown conditional: 0, unknown unconditional: 1241] , Statistics on independence cache: Total cache size (in pairs): 1819, Positive cache size: 1784, Positive conditional cache size: 0, Positive unconditional cache size: 1784, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t913; [L846] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t913, ((void *)0), P0, ((void *)0))=-3, t913={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t914; [L848] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t914, ((void *)0), P1, ((void *)0))=-2, t913={5:0}, t914={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] 0 pthread_t t915; [L850] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t915, ((void *)0), P2, ((void *)0))=-1, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L798] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0] [L801] 3 z = 1 [L804] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 a$flush_delayed = weak$$choice2 [L810] 3 a$mem_tmp = a [L811] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L812] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L813] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L814] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L815] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L817] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = a [L819] 3 a = a$flush_delayed ? a$mem_tmp : a [L820] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L823] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L824] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L825] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L826] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L827] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L857] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L858] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L859] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L860] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, 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=2, weak$$choice2=1, x=1, y=1, 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: 846]: 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: 850]: 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: 848]: 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, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 932 IncrementalHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 932 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 130 ConstructedInterpolants, 0 QuantifiedInterpolants, 780 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-05 20:22:53,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...