/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/rfi010.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:25:20,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:25:20,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:25:20,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:25:20,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:25:20,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:25:20,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:25:20,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:25:20,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:25:20,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:25:20,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:25:20,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:25:20,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:25:20,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:25:20,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:25:20,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:25:20,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:25:20,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:25:20,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:25:20,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:25:20,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:25:20,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:25:20,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:25:20,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:25:20,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:25:20,543 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:25:20,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:25:20,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:25:20,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:25:20,545 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:25:20,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:25:20,546 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:25:20,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:25:20,548 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:25:20,549 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:25:20,549 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:25:20,549 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:25:20,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:25:20,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:25:20,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:25:20,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:25:20,551 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:25:20,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:25:20,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:25:20,577 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:25:20,577 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:25:20,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:25:20,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:25:20,578 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:25:20,579 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:25:20,579 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:25:20,579 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:25:20,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:25:20,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:25:20,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:25:20,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:25:20,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:25:20,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:25:20,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:25:20,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:25:20,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:25:20,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:25:20,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:25:20,581 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:25:20,581 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:25:20,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:25:20,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:25:20,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:25:20,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:25:20,831 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:25:20,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi010.i [2022-12-05 20:25:21,747 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:25:21,956 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:25:21,957 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi010.i [2022-12-05 20:25:21,976 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c458f42/eb0a684b480940a79386097acba32d76/FLAG1853148ac [2022-12-05 20:25:21,987 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c458f42/eb0a684b480940a79386097acba32d76 [2022-12-05 20:25:21,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:25:21,993 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:25:21,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:25:21,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:25:21,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:25:21,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:25:21" (1/1) ... [2022-12-05 20:25:21,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2146d360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:21, skipping insertion in model container [2022-12-05 20:25:21,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:25:21" (1/1) ... [2022-12-05 20:25:22,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:25:22,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:25:22,150 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/rfi010.i[983,996] [2022-12-05 20:25:22,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,268 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,291 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,292 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,293 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:25:22,305 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:25:22,317 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/rfi010.i[983,996] [2022-12-05 20:25:22,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,338 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,352 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,353 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-05 20:25:22,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-05 20:25:22,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:25:22,384 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:25:22,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22 WrapperNode [2022-12-05 20:25:22,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:25:22,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:25:22,386 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:25:22,386 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:25:22,390 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:25:22" (1/1) ... [2022-12-05 20:25:22,400 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:25:22" (1/1) ... [2022-12-05 20:25:22,421 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-12-05 20:25:22,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:25:22,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:25:22,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:25:22,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:25:22,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,446 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:25:22,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:25:22,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:25:22,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:25:22,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (1/1) ... [2022-12-05 20:25:22,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:25:22,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:25:22,484 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:25:22,500 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:25:22,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:25:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-05 20:25:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:25:22,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:25:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:25:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-05 20:25:22,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-05 20:25:22,522 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-05 20:25:22,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-05 20:25:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:25:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-05 20:25:22,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:25:22,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:25:22,525 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:25:22,654 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:25:22,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:25:22,877 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:25:23,021 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:25:23,022 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 20:25:23,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:25:23 BoogieIcfgContainer [2022-12-05 20:25:23,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:25:23,025 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:25:23,025 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:25:23,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:25:23,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:25:21" (1/3) ... [2022-12-05 20:25:23,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd1ac08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:25:23, skipping insertion in model container [2022-12-05 20:25:23,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:25:22" (2/3) ... [2022-12-05 20:25:23,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd1ac08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:25:23, skipping insertion in model container [2022-12-05 20:25:23,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:25:23" (3/3) ... [2022-12-05 20:25:23,029 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2022-12-05 20:25:23,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:25:23,041 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-05 20:25:23,041 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:25:23,073 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-05 20:25:23,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 188 flow [2022-12-05 20:25:23,154 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-05 20:25:23,154 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:25:23,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 20:25:23,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 89 transitions, 188 flow [2022-12-05 20:25:23,164 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 87 transitions, 180 flow [2022-12-05 20:25:23,165 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:25:23,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-05 20:25:23,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 180 flow [2022-12-05 20:25:23,224 INFO L130 PetriNetUnfolder]: 2/87 cut-off events. [2022-12-05 20:25:23,225 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:25:23,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 87 events. 2/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2022-12-05 20:25:23,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 87 transitions, 180 flow [2022-12-05 20:25:23,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 1002 [2022-12-05 20:25:26,185 INFO L203 LiptonReduction]: Total number of compositions: 70 [2022-12-05 20:25:26,195 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:25:26,199 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;@23fc2520, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:25:26,200 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 20:25:26,202 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 20:25:26,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 20:25:26,202 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:26,202 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 20:25:26,203 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:25:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:26,206 INFO L85 PathProgramCache]: Analyzing trace with hash 406900366, now seen corresponding path program 1 times [2022-12-05 20:25:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:26,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250774180] [2022-12-05 20:25:26,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:26,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:26,451 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:25:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:26,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250774180] [2022-12-05 20:25:26,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250774180] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:26,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:26,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:25:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097704009] [2022-12-05 20:25:26,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:26,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:25:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:26,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:25:26,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:25:26,472 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:25:26,473 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:25:26,473 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:26,473 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:25:26,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:26,575 INFO L130 PetriNetUnfolder]: 173/326 cut-off events. [2022-12-05 20:25:26,575 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 20:25:26,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 326 events. 173/326 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1295 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 632. Up to 249 conditions per place. [2022-12-05 20:25:26,578 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 18 selfloop transitions, 2 changer transitions 4/25 dead transitions. [2022-12-05 20:25:26,578 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 104 flow [2022-12-05 20:25:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:25:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:25:26,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-12-05 20:25:26,586 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-05 20:25:26,587 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 32 transitions. [2022-12-05 20:25:26,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 104 flow [2022-12-05 20:25:26,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:25:26,590 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2022-12-05 20:25:26,591 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2022-12-05 20:25:26,593 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2022-12-05 20:25:26,593 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2022-12-05 20:25:26,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:25:26,593 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:26,594 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:26,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:25:26,594 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:25:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash 189276638, now seen corresponding path program 1 times [2022-12-05 20:25:26,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149162313] [2022-12-05 20:25:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:26,700 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:25:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:26,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149162313] [2022-12-05 20:25:26,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149162313] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:26,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:26,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:25:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096098319] [2022-12-05 20:25:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:26,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:25:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:25:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:25:26,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 20:25:26,703 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:25:26,703 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:26,703 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 20:25:26,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:26,748 INFO L130 PetriNetUnfolder]: 127/228 cut-off events. [2022-12-05 20:25:26,748 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-05 20:25:26,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 228 events. 127/228 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 716 event pairs, 43 based on Foata normal form. 4/232 useless extension candidates. Maximal degree in co-relation 474. Up to 201 conditions per place. [2022-12-05 20:25:26,750 INFO L137 encePairwiseOnDemand]: 16/20 looper letters, 20 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2022-12-05 20:25:26,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 104 flow [2022-12-05 20:25:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:25:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:25:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-05 20:25:26,751 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-05 20:25:26,751 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 3 states and 24 transitions. [2022-12-05 20:25:26,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 104 flow [2022-12-05 20:25:26,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:25:26,752 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2022-12-05 20:25:26,752 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2022-12-05 20:25:26,753 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2022-12-05 20:25:26,753 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2022-12-05 20:25:26,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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:25:26,753 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:26,753 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:26,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:25:26,754 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:25:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1968598295, now seen corresponding path program 1 times [2022-12-05 20:25:26,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:26,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822887201] [2022-12-05 20:25:26,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:26,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:26,903 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:25:26,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:26,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822887201] [2022-12-05 20:25:26,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822887201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:26,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:26,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 20:25:26,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841663062] [2022-12-05 20:25:26,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:26,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:25:26,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:26,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:25:26,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:25:26,905 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 20:25:26,905 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:25:26,905 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:26,905 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 20:25:26,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:26,984 INFO L130 PetriNetUnfolder]: 121/218 cut-off events. [2022-12-05 20:25:26,984 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-12-05 20:25:26,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 218 events. 121/218 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 657 event pairs, 41 based on Foata normal form. 4/222 useless extension candidates. Maximal degree in co-relation 506. Up to 157 conditions per place. [2022-12-05 20:25:26,989 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 18 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2022-12-05 20:25:26,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 103 flow [2022-12-05 20:25:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:25:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:25:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-05 20:25:26,991 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35 [2022-12-05 20:25:26,991 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 3 states and 21 transitions. [2022-12-05 20:25:26,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 103 flow [2022-12-05 20:25:26,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:25:26,993 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 61 flow [2022-12-05 20:25:26,993 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2022-12-05 20:25:26,994 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-12-05 20:25:26,994 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 61 flow [2022-12-05 20:25:26,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:25:26,995 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:26,995 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:26,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:25:26,995 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:25:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1472112293, now seen corresponding path program 1 times [2022-12-05 20:25:26,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:26,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177264023] [2022-12-05 20:25:26,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:27,111 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:25:27,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:27,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177264023] [2022-12-05 20:25:27,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177264023] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:27,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:27,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:25:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905776538] [2022-12-05 20:25:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:27,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:25:27,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:25:27,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:25:27,113 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:25:27,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:25:27,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:27,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:25:27,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:27,182 INFO L130 PetriNetUnfolder]: 60/134 cut-off events. [2022-12-05 20:25:27,183 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-05 20:25:27,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 134 events. 60/134 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 428 event pairs, 11 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 326. Up to 60 conditions per place. [2022-12-05 20:25:27,183 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 22 selfloop transitions, 3 changer transitions 17/43 dead transitions. [2022-12-05 20:25:27,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 227 flow [2022-12-05 20:25:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:25:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:25:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-05 20:25:27,185 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-05 20:25:27,185 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 61 flow. Second operand 5 states and 45 transitions. [2022-12-05 20:25:27,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 43 transitions, 227 flow [2022-12-05 20:25:27,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 43 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:25:27,186 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 82 flow [2022-12-05 20:25:27,186 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-05 20:25:27,187 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-05 20:25:27,187 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 82 flow [2022-12-05 20:25:27,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:25:27,187 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:27,187 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:27,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 20:25:27,187 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:25:27,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash 368189170, now seen corresponding path program 1 times [2022-12-05 20:25:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:27,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74855895] [2022-12-05 20:25:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:27,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:27,342 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:25:27,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:27,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74855895] [2022-12-05 20:25:27,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74855895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:27,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:27,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:25:27,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545421004] [2022-12-05 20:25:27,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:27,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:25:27,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:27,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:25:27,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:25:27,344 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:25:27,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:25:27,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:27,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:25:27,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:27,414 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2022-12-05 20:25:27,415 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-05 20:25:27,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 67 events. 24/67 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 8 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 191. Up to 29 conditions per place. [2022-12-05 20:25:27,415 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 20 selfloop transitions, 5 changer transitions 8/34 dead transitions. [2022-12-05 20:25:27,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 200 flow [2022-12-05 20:25:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:25:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:25:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-05 20:25:27,416 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.325 [2022-12-05 20:25:27,416 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 82 flow. Second operand 6 states and 39 transitions. [2022-12-05 20:25:27,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 200 flow [2022-12-05 20:25:27,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 178 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-05 20:25:27,418 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 86 flow [2022-12-05 20:25:27,418 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=86, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2022-12-05 20:25:27,418 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2022-12-05 20:25:27,418 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 86 flow [2022-12-05 20:25:27,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:25:27,419 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:27,419 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:27,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:25:27,419 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:25:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:27,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1406247134, now seen corresponding path program 1 times [2022-12-05 20:25:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:27,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749257994] [2022-12-05 20:25:27,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:27,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:27,580 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:25:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:27,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749257994] [2022-12-05 20:25:27,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749257994] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:27,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:27,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:25:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750296799] [2022-12-05 20:25:27,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:27,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:25:27,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:27,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:25:27,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:25:27,582 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 20:25:27,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 86 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:25:27,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:27,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 20:25:27,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:27,643 INFO L130 PetriNetUnfolder]: 24/71 cut-off events. [2022-12-05 20:25:27,643 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2022-12-05 20:25:27,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 71 events. 24/71 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 179 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 211. Up to 41 conditions per place. [2022-12-05 20:25:27,644 INFO L137 encePairwiseOnDemand]: 14/20 looper letters, 21 selfloop transitions, 7 changer transitions 10/38 dead transitions. [2022-12-05 20:25:27,644 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 243 flow [2022-12-05 20:25:27,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:25:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:25:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-12-05 20:25:27,645 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34 [2022-12-05 20:25:27,645 INFO L175 Difference]: Start difference. First operand has 33 places, 19 transitions, 86 flow. Second operand 5 states and 34 transitions. [2022-12-05 20:25:27,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 243 flow [2022-12-05 20:25:27,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 212 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-12-05 20:25:27,647 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 102 flow [2022-12-05 20:25:27,647 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-05 20:25:27,647 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2022-12-05 20:25:27,647 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 102 flow [2022-12-05 20:25:27,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:25:27,648 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:27,648 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:27,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:25:27,648 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:25:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash -330447534, now seen corresponding path program 2 times [2022-12-05 20:25:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:27,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430855269] [2022-12-05 20:25:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:27,780 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:25:27,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:27,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430855269] [2022-12-05 20:25:27,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430855269] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:27,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:27,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-05 20:25:27,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359044927] [2022-12-05 20:25:27,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:27,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 20:25:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 20:25:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 20:25:27,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-05 20:25:27,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 102 flow. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:25:27,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:27,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-05 20:25:27,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:27,836 INFO L130 PetriNetUnfolder]: 17/64 cut-off events. [2022-12-05 20:25:27,836 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-05 20:25:27,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 64 events. 17/64 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 3 based on Foata normal form. 1/65 useless extension candidates. Maximal degree in co-relation 204. Up to 26 conditions per place. [2022-12-05 20:25:27,837 INFO L137 encePairwiseOnDemand]: 15/20 looper letters, 16 selfloop transitions, 3 changer transitions 14/33 dead transitions. [2022-12-05 20:25:27,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 214 flow [2022-12-05 20:25:27,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:25:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:25:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-12-05 20:25:27,837 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25 [2022-12-05 20:25:27,838 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 102 flow. Second operand 6 states and 30 transitions. [2022-12-05 20:25:27,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 214 flow [2022-12-05 20:25:27,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:25:27,839 INFO L231 Difference]: Finished difference. Result has 37 places, 17 transitions, 81 flow [2022-12-05 20:25:27,839 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=17} [2022-12-05 20:25:27,839 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-05 20:25:27,839 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 17 transitions, 81 flow [2022-12-05 20:25:27,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:25:27,840 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:27,840 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:27,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:25:27,840 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:25:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:27,840 INFO L85 PathProgramCache]: Analyzing trace with hash 367848380, now seen corresponding path program 3 times [2022-12-05 20:25:27,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:27,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627887204] [2022-12-05 20:25:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:25:28,535 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:25:28,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:25:28,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627887204] [2022-12-05 20:25:28,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627887204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:25:28,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:25:28,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-05 20:25:28,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492653980] [2022-12-05 20:25:28,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:25:28,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:25:28,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:25:28,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:25:28,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:25:28,537 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 20 [2022-12-05 20:25:28,537 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 17 transitions, 81 flow. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:25:28,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:25:28,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 20 [2022-12-05 20:25:28,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:25:28,622 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-05 20:25:28,622 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-05 20:25:28,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 36 events. 6/36 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 61 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 120. Up to 13 conditions per place. [2022-12-05 20:25:28,622 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 12 selfloop transitions, 5 changer transitions 8/26 dead transitions. [2022-12-05 20:25:28,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 178 flow [2022-12-05 20:25:28,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:25:28,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:25:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-12-05 20:25:28,623 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1875 [2022-12-05 20:25:28,623 INFO L175 Difference]: Start difference. First operand has 37 places, 17 transitions, 81 flow. Second operand 8 states and 30 transitions. [2022-12-05 20:25:28,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 178 flow [2022-12-05 20:25:28,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 26 transitions, 156 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-12-05 20:25:28,625 INFO L231 Difference]: Finished difference. Result has 37 places, 17 transitions, 80 flow [2022-12-05 20:25:28,625 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=80, PETRI_PLACES=37, PETRI_TRANSITIONS=17} [2022-12-05 20:25:28,625 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-05 20:25:28,625 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 17 transitions, 80 flow [2022-12-05 20:25:28,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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:25:28,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:25:28,626 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:25:28,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 20:25:28,626 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:25:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:25:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 180425708, now seen corresponding path program 4 times [2022-12-05 20:25:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:25:28,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977492190] [2022-12-05 20:25:28,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:25:28,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:25:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:25:28,654 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-05 20:25:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-05 20:25:28,700 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-05 20:25:28,700 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-05 20:25:28,701 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 20:25:28,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-05 20:25:28,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 20:25:28,702 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 20:25:28,703 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-05 20:25:28,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:25:28,703 INFO L458 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-12-05 20:25:28,706 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 20:25:28,706 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 20:25:28,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 08:25:28 BasicIcfg [2022-12-05 20:25:28,759 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 20:25:28,760 INFO L158 Benchmark]: Toolchain (without parser) took 6766.29ms. Allocated memory was 205.5MB in the beginning and 346.0MB in the end (delta: 140.5MB). Free memory was 180.1MB in the beginning and 249.4MB in the end (delta: -69.3MB). Peak memory consumption was 72.7MB. Max. memory is 8.0GB. [2022-12-05 20:25:28,760 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 205.5MB. Free memory was 181.6MB in the beginning and 181.5MB in the end (delta: 88.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 20:25:28,760 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.59ms. Allocated memory is still 205.5MB. Free memory was 179.6MB in the beginning and 153.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-05 20:25:28,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.65ms. Allocated memory is still 205.5MB. Free memory was 153.9MB in the beginning and 151.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-05 20:25:28,760 INFO L158 Benchmark]: Boogie Preprocessor took 27.55ms. Allocated memory is still 205.5MB. Free memory was 151.3MB in the beginning and 149.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 20:25:28,761 INFO L158 Benchmark]: RCFGBuilder took 562.18ms. Allocated memory is still 205.5MB. Free memory was 149.2MB in the beginning and 113.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2022-12-05 20:25:28,762 INFO L158 Benchmark]: TraceAbstraction took 5733.63ms. Allocated memory was 205.5MB in the beginning and 346.0MB in the end (delta: 140.5MB). Free memory was 113.0MB in the beginning and 249.4MB in the end (delta: -136.4MB). Peak memory consumption was 5.6MB. Max. memory is 8.0GB. [2022-12-05 20:25:28,763 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.10ms. Allocated memory is still 205.5MB. Free memory was 181.6MB in the beginning and 181.5MB in the end (delta: 88.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 391.59ms. Allocated memory is still 205.5MB. Free memory was 179.6MB in the beginning and 153.9MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.65ms. Allocated memory is still 205.5MB. Free memory was 153.9MB in the beginning and 151.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.55ms. Allocated memory is still 205.5MB. Free memory was 151.3MB in the beginning and 149.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 562.18ms. Allocated memory is still 205.5MB. Free memory was 149.2MB in the beginning and 113.5MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5733.63ms. Allocated memory was 205.5MB in the beginning and 346.0MB in the end (delta: 140.5MB). Free memory was 113.0MB in the beginning and 249.4MB in the end (delta: -136.4MB). Peak memory consumption was 5.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 92 PlacesBefore, 26 PlacesAfterwards, 87 TransitionsBefore, 20 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 36 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763, independent: 720, independent conditional: 720, independent unconditional: 0, dependent: 43, dependent conditional: 43, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 763, independent: 720, independent conditional: 0, independent unconditional: 720, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 763, independent: 720, independent conditional: 0, independent unconditional: 720, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 763, independent: 720, independent conditional: 0, independent unconditional: 720, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 640, independent: 614, independent conditional: 0, independent unconditional: 614, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 640, independent: 605, independent conditional: 0, independent unconditional: 605, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 130, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 763, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 640, unknown conditional: 0, unknown unconditional: 640] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 899, Positive conditional cache size: 0, Positive unconditional cache size: 899, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1761, ((void *)0), P0, ((void *)0))=-1, t1761={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] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1762, ((void *)0), P1, ((void *)0))=0, t1761={5:0}, t1762={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] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L798] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L801] 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) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=255, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 2 return 0; [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 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) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 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 [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=3, weak$$choice2=255, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=3, weak$$choice2=255, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 19]: 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: 826]: 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: 824]: 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, 107 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: 5.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 390 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 4 mSDtfsCounter, 390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 713 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:25:28,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...