/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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:24:45,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:24:45,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:24:45,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:24:45,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:24:45,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:24:45,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:24:45,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:24:45,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:24:45,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:24:45,438 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:24:45,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:24:45,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:24:45,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:24:45,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:24:45,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:24:45,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:24:45,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:24:45,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:24:45,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:24:45,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:24:45,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:24:45,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:24:45,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:24:45,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:24:45,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:24:45,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:24:45,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:24:45,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:24:45,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:24:45,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:24:45,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:24:45,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:24:45,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:24:45,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:24:45,454 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:24:45,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:24:45,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:24:45,455 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:24:45,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:24:45,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:24:45,457 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:24:45,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:24:45,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:24:45,474 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:24:45,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:24:45,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:24:45,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:24:45,474 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:24:45,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:24:45,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:24:45,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:24:45,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:24:45,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:24:45,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:24:45,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:24:45,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:24:45,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:24:45,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:24:45,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:24:45,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:24:45,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:24:45,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:24:45,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:24:45,477 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:24:45,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:24:45,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:24:45,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:24:45,791 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:24:45,791 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:24:45,796 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:24:46,889 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:24:47,147 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:24:47,148 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:24:47,156 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a084036/85ff472e92544683a5fe047e688712e5/FLAG1e575887c [2022-12-05 20:24:47,167 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62a084036/85ff472e92544683a5fe047e688712e5 [2022-12-05 20:24:47,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:24:47,170 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:24:47,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:24:47,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:24:47,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:24:47,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,173 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56bb4909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47, skipping insertion in model container [2022-12-05 20:24:47,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:24:47,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:24:47,322 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 20:24:47,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:24:47,477 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:24:47,488 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/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2022-12-05 20:24:47,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:24:47,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:24:47,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:24:47,576 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:24:47,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47 WrapperNode [2022-12-05 20:24:47,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:24:47,578 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:24:47,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:24:47,578 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:24:47,583 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:24:47" (1/1) ... [2022-12-05 20:24:47,606 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:24:47" (1/1) ... [2022-12-05 20:24:47,634 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2022-12-05 20:24:47,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:24:47,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:24:47,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:24:47,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:24:47,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,669 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:24:47,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:24:47,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:24:47,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:24:47,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (1/1) ... [2022-12-05 20:24:47,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:24:47,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:24:47,702 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:24:47,713 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:24:47,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:24:47,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:24:47,742 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:24:47,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:24:47,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:24:47,743 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:24:47,830 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:24:47,832 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:24:48,046 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:24:48,137 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:24:48,137 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:24:48,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:24:48 BoogieIcfgContainer [2022-12-05 20:24:48,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:24:48,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:24:48,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:24:48,142 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:24:48,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:24:47" (1/3) ... [2022-12-05 20:24:48,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2e7d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:24:48, skipping insertion in model container [2022-12-05 20:24:48,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:24:47" (2/3) ... [2022-12-05 20:24:48,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2e7d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:24:48, skipping insertion in model container [2022-12-05 20:24:48,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:24:48" (3/3) ... [2022-12-05 20:24:48,144 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2022-12-05 20:24:48,156 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:24:48,157 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:24:48,157 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:24:48,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:24:48,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-05 20:24:48,304 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-05 20:24:48,304 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:48,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 20:24:48,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-05 20:24:48,313 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-05 20:24:48,315 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:24:48,342 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-05 20:24:48,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-05 20:24:48,370 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-05 20:24:48,371 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:48,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-05 20:24:48,376 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-05 20:24:48,377 INFO L188 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-05 20:24:52,613 INFO L203 LiptonReduction]: Total number of compositions: 71 [2022-12-05 20:24:52,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:24:52,627 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;@21913175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:24:52,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 20:24:52,629 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 20:24:52,629 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:24:52,629 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:52,630 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:24:52,630 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:52,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 394395427, now seen corresponding path program 1 times [2022-12-05 20:24:52,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:52,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464940487] [2022-12-05 20:24:52,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:52,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:52,890 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:24:52,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:52,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464940487] [2022-12-05 20:24:52,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464940487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:52,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:52,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:24:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727126067] [2022-12-05 20:24:52,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:52,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:52,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:52,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:52,919 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 20:24:52,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:24:52,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:52,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 20:24:52,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:53,081 INFO L130 PetriNetUnfolder]: 173/328 cut-off events. [2022-12-05 20:24:53,082 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 20:24:53,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 328 events. 173/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1397 event pairs, 21 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 634. Up to 249 conditions per place. [2022-12-05 20:24:53,085 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 18 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-05 20:24:53,085 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 106 flow [2022-12-05 20:24:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:53,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-05 20:24:53,095 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 20:24:53,096 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 35 transitions. [2022-12-05 20:24:53,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 106 flow [2022-12-05 20:24:53,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:53,100 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-05 20:24:53,101 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-05 20:24:53,106 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-05 20:24:53,106 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2022-12-05 20:24:53,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:24:53,106 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:53,106 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:53,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:24:53,107 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:53,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1056924342, now seen corresponding path program 1 times [2022-12-05 20:24:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:53,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659787252] [2022-12-05 20:24:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:53,660 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:24:53,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:53,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659787252] [2022-12-05 20:24:53,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659787252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:53,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:53,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:24:53,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907727373] [2022-12-05 20:24:53,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:53,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:53,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:53,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:53,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:53,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 20:24:53,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:24:53,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:53,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 20:24:53,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:53,740 INFO L130 PetriNetUnfolder]: 157/278 cut-off events. [2022-12-05 20:24:53,740 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-05 20:24:53,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 278 events. 157/278 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 898 event pairs, 53 based on Foata normal form. 10/288 useless extension candidates. Maximal degree in co-relation 577. Up to 200 conditions per place. [2022-12-05 20:24:53,744 INFO L137 encePairwiseOnDemand]: 18/21 looper letters, 20 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2022-12-05 20:24:53,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 22 transitions, 96 flow [2022-12-05 20:24:53,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-05 20:24:53,746 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2022-12-05 20:24:53,746 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 3 states and 23 transitions. [2022-12-05 20:24:53,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 22 transitions, 96 flow [2022-12-05 20:24:53,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 92 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:53,747 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2022-12-05 20:24:53,747 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-12-05 20:24:53,748 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2022-12-05 20:24:53,748 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 44 flow [2022-12-05 20:24:53,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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:24:53,748 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:53,748 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:53,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:24:53,748 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:53,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2065041146, now seen corresponding path program 1 times [2022-12-05 20:24:53,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:53,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304356719] [2022-12-05 20:24:53,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:54,110 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:24:54,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:54,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304356719] [2022-12-05 20:24:54,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304356719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:54,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:54,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873659086] [2022-12-05 20:24:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:54,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:24:54,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:24:54,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:24:54,115 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 20:24:54,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 44 flow. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:24:54,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:54,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 20:24:54,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:54,224 INFO L130 PetriNetUnfolder]: 108/212 cut-off events. [2022-12-05 20:24:54,224 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 20:24:54,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 212 events. 108/212 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 719 event pairs, 29 based on Foata normal form. 7/219 useless extension candidates. Maximal degree in co-relation 460. Up to 171 conditions per place. [2022-12-05 20:24:54,225 INFO L137 encePairwiseOnDemand]: 14/21 looper letters, 24 selfloop transitions, 8 changer transitions 0/33 dead transitions. [2022-12-05 20:24:54,225 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 152 flow [2022-12-05 20:24:54,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:24:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:24:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-05 20:24:54,227 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-05 20:24:54,227 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 44 flow. Second operand 5 states and 40 transitions. [2022-12-05 20:24:54,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 152 flow [2022-12-05 20:24:54,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:54,228 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 95 flow [2022-12-05 20:24:54,228 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2022-12-05 20:24:54,229 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-05 20:24:54,229 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 95 flow [2022-12-05 20:24:54,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 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:24:54,229 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:54,229 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:54,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:24:54,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:54,230 INFO L85 PathProgramCache]: Analyzing trace with hash 2092430594, now seen corresponding path program 1 times [2022-12-05 20:24:54,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:54,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122112839] [2022-12-05 20:24:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:54,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:54,501 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:24:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:54,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122112839] [2022-12-05 20:24:54,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122112839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:54,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:54,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:24:54,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226805215] [2022-12-05 20:24:54,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:54,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:24:54,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:54,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:24:54,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:24:54,503 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 21 [2022-12-05 20:24:54,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 95 flow. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:54,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:54,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 21 [2022-12-05 20:24:54,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:54,641 INFO L130 PetriNetUnfolder]: 112/217 cut-off events. [2022-12-05 20:24:54,641 INFO L131 PetriNetUnfolder]: For 152/154 co-relation queries the response was YES. [2022-12-05 20:24:54,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 217 events. 112/217 cut-off events. For 152/154 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 745 event pairs, 23 based on Foata normal form. 5/222 useless extension candidates. Maximal degree in co-relation 612. Up to 140 conditions per place. [2022-12-05 20:24:54,642 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 26 selfloop transitions, 13 changer transitions 0/40 dead transitions. [2022-12-05 20:24:54,642 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 229 flow [2022-12-05 20:24:54,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-12-05 20:24:54,643 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3492063492063492 [2022-12-05 20:24:54,643 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 95 flow. Second operand 6 states and 44 transitions. [2022-12-05 20:24:54,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 229 flow [2022-12-05 20:24:54,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 229 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:24:54,645 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 170 flow [2022-12-05 20:24:54,645 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2022-12-05 20:24:54,646 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2022-12-05 20:24:54,646 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 170 flow [2022-12-05 20:24:54,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:24:54,646 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:54,646 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:54,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:24:54,659 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1313507189, now seen corresponding path program 1 times [2022-12-05 20:24:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:54,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237343815] [2022-12-05 20:24:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:54,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:54,793 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:24:54,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:54,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237343815] [2022-12-05 20:24:54,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237343815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:54,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:54,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:24:54,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154438557] [2022-12-05 20:24:54,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:54,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:24:54,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:24:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:24:54,795 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 20:24:54,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:24:54,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:54,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 20:24:54,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:54,834 INFO L130 PetriNetUnfolder]: 47/120 cut-off events. [2022-12-05 20:24:54,834 INFO L131 PetriNetUnfolder]: For 320/321 co-relation queries the response was YES. [2022-12-05 20:24:54,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 120 events. 47/120 cut-off events. For 320/321 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 387 event pairs, 13 based on Foata normal form. 11/129 useless extension candidates. Maximal degree in co-relation 432. Up to 76 conditions per place. [2022-12-05 20:24:54,835 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 29 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2022-12-05 20:24:54,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 272 flow [2022-12-05 20:24:54,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:24:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:24:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-05 20:24:54,836 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2022-12-05 20:24:54,836 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 170 flow. Second operand 3 states and 30 transitions. [2022-12-05 20:24:54,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 272 flow [2022-12-05 20:24:54,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 258 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:54,840 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 181 flow [2022-12-05 20:24:54,840 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-05 20:24:54,842 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-05 20:24:54,842 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 181 flow [2022-12-05 20:24:54,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:24:54,842 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:54,842 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:54,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:24:54,843 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:54,843 INFO L85 PathProgramCache]: Analyzing trace with hash -2064499866, now seen corresponding path program 1 times [2022-12-05 20:24:54,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:54,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914801474] [2022-12-05 20:24:54,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:54,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:54,980 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:24:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:54,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914801474] [2022-12-05 20:24:54,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914801474] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:54,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:54,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:24:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066509891] [2022-12-05 20:24:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:54,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:24:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:54,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:24:54,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:24:54,983 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-05 20:24:54,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 181 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:24:54,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:54,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-05 20:24:54,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:55,022 INFO L130 PetriNetUnfolder]: 24/71 cut-off events. [2022-12-05 20:24:55,022 INFO L131 PetriNetUnfolder]: For 134/135 co-relation queries the response was YES. [2022-12-05 20:24:55,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 71 events. 24/71 cut-off events. For 134/135 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 195 event pairs, 8 based on Foata normal form. 10/79 useless extension candidates. Maximal degree in co-relation 258. Up to 37 conditions per place. [2022-12-05 20:24:55,022 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 27 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2022-12-05 20:24:55,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 276 flow [2022-12-05 20:24:55,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:24:55,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:24:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-12-05 20:24:55,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2022-12-05 20:24:55,024 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 181 flow. Second operand 4 states and 32 transitions. [2022-12-05 20:24:55,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 276 flow [2022-12-05 20:24:55,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 249 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-05 20:24:55,027 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 174 flow [2022-12-05 20:24:55,028 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2022-12-05 20:24:55,029 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 11 predicate places. [2022-12-05 20:24:55,029 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 174 flow [2022-12-05 20:24:55,030 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:24:55,030 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:55,030 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:55,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:24:55,030 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:55,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1034225074, now seen corresponding path program 1 times [2022-12-05 20:24:55,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:55,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167399661] [2022-12-05 20:24:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:24:55,508 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:24:55,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:24:55,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167399661] [2022-12-05 20:24:55,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167399661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:24:55,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:24:55,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:24:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050568189] [2022-12-05 20:24:55,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:24:55,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:24:55,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:24:55,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:24:55,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:24:55,510 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 21 [2022-12-05 20:24:55,510 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 174 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:24:55,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:24:55,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 21 [2022-12-05 20:24:55,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:24:55,667 INFO L130 PetriNetUnfolder]: 39/106 cut-off events. [2022-12-05 20:24:55,667 INFO L131 PetriNetUnfolder]: For 173/173 co-relation queries the response was YES. [2022-12-05 20:24:55,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 106 events. 39/106 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 311 event pairs, 4 based on Foata normal form. 1/107 useless extension candidates. Maximal degree in co-relation 378. Up to 56 conditions per place. [2022-12-05 20:24:55,668 INFO L137 encePairwiseOnDemand]: 15/21 looper letters, 21 selfloop transitions, 3 changer transitions 30/54 dead transitions. [2022-12-05 20:24:55,668 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 54 transitions, 406 flow [2022-12-05 20:24:55,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:24:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:24:55,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-12-05 20:24:55,669 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29365079365079366 [2022-12-05 20:24:55,669 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 174 flow. Second operand 6 states and 37 transitions. [2022-12-05 20:24:55,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 54 transitions, 406 flow [2022-12-05 20:24:55,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 386 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-05 20:24:55,671 INFO L231 Difference]: Finished difference. Result has 43 places, 22 transitions, 116 flow [2022-12-05 20:24:55,671 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=43, PETRI_TRANSITIONS=22} [2022-12-05 20:24:55,671 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 16 predicate places. [2022-12-05 20:24:55,672 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 22 transitions, 116 flow [2022-12-05 20:24:55,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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:24:55,672 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:24:55,672 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:55,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:24:55,672 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:24:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:24:55,672 INFO L85 PathProgramCache]: Analyzing trace with hash -726272926, now seen corresponding path program 2 times [2022-12-05 20:24:55,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:24:55,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920670520] [2022-12-05 20:24:55,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:24:55,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:24:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:24:55,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:24:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:24:55,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:24:55,732 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:24:55,733 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 20:24:55,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 20:24:55,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 20:24:55,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 20:24:55,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 20:24:55,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:24:55,734 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2022-12-05 20:24:55,738 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:24:55,738 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:24:55,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:24:55 BasicIcfg [2022-12-05 20:24:55,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:24:55,768 INFO L158 Benchmark]: Toolchain (without parser) took 8598.43ms. Allocated memory was 181.4MB in the beginning and 346.0MB in the end (delta: 164.6MB). Free memory was 156.5MB in the beginning and 122.2MB in the end (delta: 34.3MB). Peak memory consumption was 199.4MB. Max. memory is 8.0GB. [2022-12-05 20:24:55,768 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 181.4MB. Free memory was 158.9MB in the beginning and 158.9MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:24:55,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.62ms. Allocated memory is still 181.4MB. Free memory was 156.5MB in the beginning and 130.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 20:24:55,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.14ms. Allocated memory is still 181.4MB. Free memory was 130.8MB in the beginning and 128.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:24:55,769 INFO L158 Benchmark]: Boogie Preprocessor took 42.59ms. Allocated memory is still 181.4MB. Free memory was 128.2MB in the beginning and 126.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 20:24:55,769 INFO L158 Benchmark]: RCFGBuilder took 461.03ms. Allocated memory is still 181.4MB. Free memory was 126.6MB in the beginning and 95.7MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-05 20:24:55,769 INFO L158 Benchmark]: TraceAbstraction took 7627.44ms. Allocated memory was 181.4MB in the beginning and 346.0MB in the end (delta: 164.6MB). Free memory was 94.7MB in the beginning and 122.2MB in the end (delta: -27.6MB). Peak memory consumption was 137.6MB. Max. memory is 8.0GB. [2022-12-05 20:24:55,770 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.14ms. Allocated memory is still 181.4MB. Free memory was 158.9MB in the beginning and 158.9MB in the end (delta: 66.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.62ms. Allocated memory is still 181.4MB. Free memory was 156.5MB in the beginning and 130.8MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.14ms. Allocated memory is still 181.4MB. Free memory was 130.8MB in the beginning and 128.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.59ms. Allocated memory is still 181.4MB. Free memory was 128.2MB in the beginning and 126.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 461.03ms. Allocated memory is still 181.4MB. Free memory was 126.6MB in the beginning and 95.7MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7627.44ms. Allocated memory was 181.4MB in the beginning and 346.0MB in the end (delta: 164.6MB). Free memory was 94.7MB in the beginning and 122.2MB in the end (delta: -27.6MB). Peak memory consumption was 137.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.2s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 33 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 967, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 967, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 967, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 967, independent: 916, independent conditional: 0, independent unconditional: 916, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 769, independent: 733, independent conditional: 0, independent unconditional: 733, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 769, independent: 719, independent conditional: 0, independent unconditional: 719, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 315, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 302, dependent conditional: 0, dependent unconditional: 302, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 967, independent: 183, independent conditional: 0, independent unconditional: 183, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 769, unknown conditional: 0, unknown unconditional: 769] , Statistics on independence cache: Total cache size (in pairs): 1163, Positive cache size: 1127, Positive conditional cache size: 0, Positive unconditional cache size: 1127, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1603, ((void *)0), P0, ((void *)0))=-1, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1604, ((void *)0), P1, ((void *)0))=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 805]: 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: 803]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 111 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.5s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 7 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:24:55,809 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...