/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:16:19,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:16:19,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:16:19,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:16:19,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:16:19,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:16:19,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:16:19,411 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:16:19,417 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:16:19,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:16:19,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:16:19,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:16:19,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:16:19,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:16:19,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:16:19,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:16:19,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:16:19,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:16:19,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:16:19,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:16:19,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:16:19,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:16:19,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:16:19,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:16:19,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:16:19,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:16:19,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:16:19,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:16:19,442 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:16:19,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:16:19,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:16:19,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:16:19,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:16:19,444 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:16:19,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:16:19,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:16:19,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:16:19,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:16:19,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:16:19,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:16:19,457 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:16:19,458 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:16:19,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:16:19,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:16:19,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:16:19,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:16:19,480 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:16:19,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:16:19,480 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:16:19,480 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:16:19,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:16:19,481 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:16:19,481 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:16:19,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:16:19,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:16:19,481 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:16:19,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:16:19,482 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:16:19,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:16:19,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:16:19,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:16:19,482 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:16:19,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:16:19,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:19,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:16:19,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:16:19,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:16:19,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:16:19,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:16:19,483 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:16:19,483 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-06 06:16:19,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:16:19,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:16:19,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:16:19,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:16:19,744 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:16:19,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2022-12-06 06:16:20,684 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:16:20,876 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:16:20,876 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2022-12-06 06:16:20,913 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018ff3dd6/b7ba992098bd46fa83759a9afb0b5db3/FLAG2cabde756 [2022-12-06 06:16:20,932 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018ff3dd6/b7ba992098bd46fa83759a9afb0b5db3 [2022-12-06 06:16:20,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:16:20,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:16:20,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:20,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:16:20,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:16:20,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:20" (1/1) ... [2022-12-06 06:16:20,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48f04f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:20, skipping insertion in model container [2022-12-06 06:16:20,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:16:20" (1/1) ... [2022-12-06 06:16:20,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:16:20,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:16:21,130 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/mix000.opt.i[987,1000] [2022-12-06 06:16:21,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,280 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,288 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,301 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,307 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,308 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:21,318 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:16:21,327 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/mix000.opt.i[987,1000] [2022-12-06 06:16:21,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,350 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,354 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,355 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,359 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,360 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,362 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:16:21,364 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:16:21,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:16:21,390 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:16:21,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21 WrapperNode [2022-12-06 06:16:21,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:16:21,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:21,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:16:21,392 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:16:21,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,428 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2022-12-06 06:16:21,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:16:21,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:16:21,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:16:21,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:16:21,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,444 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:16:21,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:16:21,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:16:21,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:16:21,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (1/1) ... [2022-12-06 06:16:21,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:16:21,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:16:21,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:16:21,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:16:21,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:16:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:16:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:16:21,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:16:21,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:16:21,517 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:16:21,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:16:21,517 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:16:21,517 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:16:21,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:16:21,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:16:21,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:16:21,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:16:21,519 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:16:21,645 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:16:21,646 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:16:21,885 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:16:21,976 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:16:21,976 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:16:21,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:21 BoogieIcfgContainer [2022-12-06 06:16:21,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:16:21,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:16:21,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:16:21,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:16:21,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:16:20" (1/3) ... [2022-12-06 06:16:21,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209514ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:21, skipping insertion in model container [2022-12-06 06:16:21,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:16:21" (2/3) ... [2022-12-06 06:16:21,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@209514ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:16:21, skipping insertion in model container [2022-12-06 06:16:21,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:16:21" (3/3) ... [2022-12-06 06:16:21,986 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2022-12-06 06:16:21,999 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:16:21,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:16:21,999 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:16:22,045 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:16:22,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 06:16:22,123 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 06:16:22,124 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:22,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 06:16:22,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 91 transitions, 192 flow [2022-12-06 06:16:22,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 89 transitions, 184 flow [2022-12-06 06:16:22,132 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:22,148 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 06:16:22,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 89 transitions, 184 flow [2022-12-06 06:16:22,182 INFO L130 PetriNetUnfolder]: 2/89 cut-off events. [2022-12-06 06:16:22,182 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:22,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-12-06 06:16:22,185 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 89 transitions, 184 flow [2022-12-06 06:16:22,185 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 06:16:25,492 INFO L203 LiptonReduction]: Total number of compositions: 71 [2022-12-06 06:16:25,502 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:16:25,507 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=REPEATED_LIPTON_PN, 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;@2674c11c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:16:25,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 06:16:25,510 INFO L130 PetriNetUnfolder]: 1/11 cut-off events. [2022-12-06 06:16:25,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:25,510 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:25,511 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:16:25,511 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-06 06:16:25,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:25,514 INFO L85 PathProgramCache]: Analyzing trace with hash 410757054, now seen corresponding path program 1 times [2022-12-06 06:16:25,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:25,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72507887] [2022-12-06 06:16:25,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:25,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:25,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:25,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:25,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72507887] [2022-12-06 06:16:25,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72507887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:25,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:25,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:25,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458030968] [2022-12-06 06:16:25,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:25,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:25,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:25,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:25,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:25,867 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2022-12-06 06:16:25,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:25,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:25,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2022-12-06 06:16:25,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:25,964 INFO L130 PetriNetUnfolder]: 173/328 cut-off events. [2022-12-06 06:16:25,964 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 06:16:25,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 328 events. 173/328 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1400 event pairs, 21 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 634. Up to 249 conditions per place. [2022-12-06 06:16:25,968 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 18 selfloop transitions, 2 changer transitions 4/26 dead transitions. [2022-12-06 06:16:25,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 106 flow [2022-12-06 06:16:25,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 06:16:25,977 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 06:16:25,978 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 35 transitions. [2022-12-06 06:16:25,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 106 flow [2022-12-06 06:16:25,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:25,982 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2022-12-06 06:16:25,984 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2022-12-06 06:16:25,988 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2022-12-06 06:16:25,988 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:25,988 INFO L89 Accepts]: Start accepts. Operand has 25 places, 16 transitions, 40 flow [2022-12-06 06:16:25,990 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:25,990 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:25,991 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 16 transitions, 40 flow [2022-12-06 06:16:25,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 16 transitions, 40 flow [2022-12-06 06:16:26,001 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:16:26,002 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:26,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:16:26,002 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 16 transitions, 40 flow [2022-12-06 06:16:26,002 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 06:16:26,071 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:26,072 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 84 [2022-12-06 06:16:26,073 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 16 transitions, 40 flow [2022-12-06 06:16:26,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:26,073 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:26,073 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:26,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:16:26,073 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-06 06:16:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:26,074 INFO L85 PathProgramCache]: Analyzing trace with hash -399480483, now seen corresponding path program 1 times [2022-12-06 06:16:26,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:26,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854493157] [2022-12-06 06:16:26,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:26,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:26,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:26,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:26,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854493157] [2022-12-06 06:16:26,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854493157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:26,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:26,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:16:26,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991122578] [2022-12-06 06:16:26,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:26,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:16:26,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:26,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:16:26,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:16:26,238 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 16 [2022-12-06 06:16:26,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 16 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:26,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:26,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 16 [2022-12-06 06:16:26,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:26,320 INFO L130 PetriNetUnfolder]: 126/231 cut-off events. [2022-12-06 06:16:26,321 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-06 06:16:26,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 231 events. 126/231 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 829 event pairs, 42 based on Foata normal form. 10/239 useless extension candidates. Maximal degree in co-relation 482. Up to 161 conditions per place. [2022-12-06 06:16:26,322 INFO L137 encePairwiseOnDemand]: 13/16 looper letters, 21 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2022-12-06 06:16:26,322 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 24 transitions, 106 flow [2022-12-06 06:16:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2022-12-06 06:16:26,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5625 [2022-12-06 06:16:26,323 INFO L175 Difference]: Start difference. First operand has 23 places, 16 transitions, 40 flow. Second operand 3 states and 27 transitions. [2022-12-06 06:16:26,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 24 transitions, 106 flow [2022-12-06 06:16:26,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:26,324 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 44 flow [2022-12-06 06:16:26,325 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-12-06 06:16:26,325 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2022-12-06 06:16:26,325 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:26,325 INFO L89 Accepts]: Start accepts. Operand has 24 places, 16 transitions, 44 flow [2022-12-06 06:16:26,326 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:26,326 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:26,326 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 16 transitions, 44 flow [2022-12-06 06:16:26,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 44 flow [2022-12-06 06:16:26,329 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 06:16:26,329 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:16:26,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 0/16 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:16:26,330 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 44 flow [2022-12-06 06:16:26,330 INFO L188 LiptonReduction]: Number of co-enabled transitions 106 [2022-12-06 06:16:26,373 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:26,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 49 [2022-12-06 06:16:26,374 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 42 flow [2022-12-06 06:16:26,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:26,375 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:26,375 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:26,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:16:26,375 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-06 06:16:26,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:26,375 INFO L85 PathProgramCache]: Analyzing trace with hash 579262530, now seen corresponding path program 1 times [2022-12-06 06:16:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:26,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906556221] [2022-12-06 06:16:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:26,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:26,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906556221] [2022-12-06 06:16:26,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906556221] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:26,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:26,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:16:26,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784769551] [2022-12-06 06:16:26,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:26,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:26,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:26,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:26,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:26,459 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 06:16:26,460 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 42 flow. Second operand has 4 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-06 06:16:26,460 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:26,460 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 06:16:26,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:26,526 INFO L130 PetriNetUnfolder]: 114/207 cut-off events. [2022-12-06 06:16:26,526 INFO L131 PetriNetUnfolder]: For 31/31 co-relation queries the response was YES. [2022-12-06 06:16:26,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 207 events. 114/207 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 621 event pairs, 38 based on Foata normal form. 6/213 useless extension candidates. Maximal degree in co-relation 470. Up to 146 conditions per place. [2022-12-06 06:16:26,530 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 18 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2022-12-06 06:16:26,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 95 flow [2022-12-06 06:16:26,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:16:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:16:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2022-12-06 06:16:26,533 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 06:16:26,536 INFO L175 Difference]: Start difference. First operand has 23 places, 15 transitions, 42 flow. Second operand 3 states and 21 transitions. [2022-12-06 06:16:26,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 95 flow [2022-12-06 06:16:26,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 89 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:26,537 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 46 flow [2022-12-06 06:16:26,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2022-12-06 06:16:26,538 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2022-12-06 06:16:26,538 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:26,538 INFO L89 Accepts]: Start accepts. Operand has 24 places, 15 transitions, 46 flow [2022-12-06 06:16:26,538 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:26,538 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:26,539 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 15 transitions, 46 flow [2022-12-06 06:16:26,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 15 transitions, 46 flow [2022-12-06 06:16:26,543 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 06:16:26,543 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:16:26,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29 conditions, 15 events. 0/15 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 06:16:26,544 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 15 transitions, 46 flow [2022-12-06 06:16:26,544 INFO L188 LiptonReduction]: Number of co-enabled transitions 84 [2022-12-06 06:16:26,561 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:26,563 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 06:16:26,563 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 46 flow [2022-12-06 06:16:26,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-06 06:16:26,563 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:26,563 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:26,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:16:26,563 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-06 06:16:26,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1645072198, now seen corresponding path program 1 times [2022-12-06 06:16:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:26,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697935471] [2022-12-06 06:16:26,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:26,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:26,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:26,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697935471] [2022-12-06 06:16:26,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697935471] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:26,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:26,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:16:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743225586] [2022-12-06 06:16:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:26,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:26,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:26,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:16:26,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:26,683 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:26,683 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:16:26,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:26,769 INFO L130 PetriNetUnfolder]: 59/132 cut-off events. [2022-12-06 06:16:26,769 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 06:16:26,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 132 events. 59/132 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 415 event pairs, 13 based on Foata normal form. 20/152 useless extension candidates. Maximal degree in co-relation 309. Up to 58 conditions per place. [2022-12-06 06:16:26,770 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 20 selfloop transitions, 3 changer transitions 15/39 dead transitions. [2022-12-06 06:16:26,770 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 39 transitions, 184 flow [2022-12-06 06:16:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:16:26,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:16:26,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-12-06 06:16:26,773 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-06 06:16:26,773 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 46 flow. Second operand 5 states and 45 transitions. [2022-12-06 06:16:26,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 39 transitions, 184 flow [2022-12-06 06:16:26,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 39 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:26,774 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 69 flow [2022-12-06 06:16:26,774 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=22, 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=5, PETRI_FLOW=69, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2022-12-06 06:16:26,776 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2022-12-06 06:16:26,776 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:26,776 INFO L89 Accepts]: Start accepts. Operand has 29 places, 17 transitions, 69 flow [2022-12-06 06:16:26,776 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:26,777 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:26,777 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 17 transitions, 69 flow [2022-12-06 06:16:26,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 17 transitions, 69 flow [2022-12-06 06:16:26,780 INFO L130 PetriNetUnfolder]: 5/27 cut-off events. [2022-12-06 06:16:26,780 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 06:16:26,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 27 events. 5/27 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 60. Up to 12 conditions per place. [2022-12-06 06:16:26,781 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 17 transitions, 69 flow [2022-12-06 06:16:26,781 INFO L188 LiptonReduction]: Number of co-enabled transitions 74 [2022-12-06 06:16:26,794 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:16:26,799 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 23 [2022-12-06 06:16:26,799 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 17 transitions, 69 flow [2022-12-06 06:16:26,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:26,799 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:26,799 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:26,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:16:26,800 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-06 06:16:26,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1918540606, now seen corresponding path program 1 times [2022-12-06 06:16:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:26,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815881623] [2022-12-06 06:16:26,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:26,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:26,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:26,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:26,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815881623] [2022-12-06 06:16:26,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815881623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:26,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:26,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:16:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569787738] [2022-12-06 06:16:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:26,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:16:26,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:26,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:16:26,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:16:26,990 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 15 [2022-12-06 06:16:26,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 17 transitions, 69 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-06 06:16:26,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:26,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 15 [2022-12-06 06:16:26,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:27,052 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2022-12-06 06:16:27,053 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-06 06:16:27,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 67 events. 24/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 147 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 186. Up to 29 conditions per place. [2022-12-06 06:16:27,053 INFO L137 encePairwiseOnDemand]: 10/15 looper letters, 18 selfloop transitions, 5 changer transitions 8/32 dead transitions. [2022-12-06 06:16:27,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 177 flow [2022-12-06 06:16:27,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:16:27,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:16:27,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-12-06 06:16:27,054 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2022-12-06 06:16:27,054 INFO L175 Difference]: Start difference. First operand has 27 places, 17 transitions, 69 flow. Second operand 6 states and 39 transitions. [2022-12-06 06:16:27,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 177 flow [2022-12-06 06:16:27,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 152 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-12-06 06:16:27,055 INFO L231 Difference]: Finished difference. Result has 31 places, 17 transitions, 72 flow [2022-12-06 06:16:27,056 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, 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=6, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=17} [2022-12-06 06:16:27,056 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2022-12-06 06:16:27,056 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:27,056 INFO L89 Accepts]: Start accepts. Operand has 31 places, 17 transitions, 72 flow [2022-12-06 06:16:27,057 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:27,057 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:27,057 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 17 transitions, 72 flow [2022-12-06 06:16:27,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 17 transitions, 72 flow [2022-12-06 06:16:27,060 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-12-06 06:16:27,060 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-06 06:16:27,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 17 events. 1/17 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-06 06:16:27,060 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 17 transitions, 72 flow [2022-12-06 06:16:27,060 INFO L188 LiptonReduction]: Number of co-enabled transitions 40 [2022-12-06 06:16:27,372 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 06:16:27,373 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 317 [2022-12-06 06:16:27,373 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 15 transitions, 68 flow [2022-12-06 06:16:27,373 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-06 06:16:27,373 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:27,373 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:27,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:16:27,373 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-06 06:16:27,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:27,374 INFO L85 PathProgramCache]: Analyzing trace with hash 585155564, now seen corresponding path program 1 times [2022-12-06 06:16:27,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:27,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472679020] [2022-12-06 06:16:27,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:27,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:16:27,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:27,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472679020] [2022-12-06 06:16:27,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472679020] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:27,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:27,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:16:27,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629734480] [2022-12-06 06:16:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:27,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:16:27,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:16:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:16:27,522 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 06:16:27,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 15 transitions, 68 flow. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-06 06:16:27,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:27,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 06:16:27,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:27,571 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2022-12-06 06:16:27,571 INFO L131 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-12-06 06:16:27,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 67 events. 24/67 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 186 event pairs, 0 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 184. Up to 43 conditions per place. [2022-12-06 06:16:27,572 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 16 selfloop transitions, 1 changer transitions 11/28 dead transitions. [2022-12-06 06:16:27,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 177 flow [2022-12-06 06:16:27,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:16:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:16:27,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-12-06 06:16:27,573 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2022-12-06 06:16:27,573 INFO L175 Difference]: Start difference. First operand has 27 places, 15 transitions, 68 flow. Second operand 4 states and 25 transitions. [2022-12-06 06:16:27,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 177 flow [2022-12-06 06:16:27,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 152 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-06 06:16:27,574 INFO L231 Difference]: Finished difference. Result has 27 places, 15 transitions, 59 flow [2022-12-06 06:16:27,574 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=27, PETRI_TRANSITIONS=15} [2022-12-06 06:16:27,575 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2022-12-06 06:16:27,575 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:27,575 INFO L89 Accepts]: Start accepts. Operand has 27 places, 15 transitions, 59 flow [2022-12-06 06:16:27,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:27,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:27,576 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 15 transitions, 59 flow [2022-12-06 06:16:27,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 15 transitions, 59 flow [2022-12-06 06:16:27,578 INFO L130 PetriNetUnfolder]: 1/18 cut-off events. [2022-12-06 06:16:27,579 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:16:27,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 18 events. 1/18 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 12 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 33. Up to 5 conditions per place. [2022-12-06 06:16:27,579 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 15 transitions, 59 flow [2022-12-06 06:16:27,579 INFO L188 LiptonReduction]: Number of co-enabled transitions 34 [2022-12-06 06:16:27,908 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:16:27,909 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 334 [2022-12-06 06:16:27,909 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 14 transitions, 57 flow [2022-12-06 06:16:27,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-06 06:16:27,910 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:27,910 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:27,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:16:27,910 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-06 06:16:27,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2099785456, now seen corresponding path program 1 times [2022-12-06 06:16:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:27,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715586832] [2022-12-06 06:16:27,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:27,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:16:28,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-06 06:16:28,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:16:28,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715586832] [2022-12-06 06:16:28,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715586832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:16:28,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:16:28,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:16:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090958978] [2022-12-06 06:16:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:16:28,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:16:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:16:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:16:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:16:28,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 12 [2022-12-06 06:16:28,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 14 transitions, 57 flow. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:28,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:16:28,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 12 [2022-12-06 06:16:28,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:16:28,823 INFO L130 PetriNetUnfolder]: 12/46 cut-off events. [2022-12-06 06:16:28,823 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 06:16:28,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 46 events. 12/46 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 1 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 138. Up to 16 conditions per place. [2022-12-06 06:16:28,824 INFO L137 encePairwiseOnDemand]: 6/12 looper letters, 10 selfloop transitions, 4 changer transitions 17/31 dead transitions. [2022-12-06 06:16:28,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 192 flow [2022-12-06 06:16:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 06:16:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 06:16:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2022-12-06 06:16:28,826 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.25925925925925924 [2022-12-06 06:16:28,826 INFO L175 Difference]: Start difference. First operand has 25 places, 14 transitions, 57 flow. Second operand 9 states and 28 transitions. [2022-12-06 06:16:28,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 192 flow [2022-12-06 06:16:28,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 06:16:28,827 INFO L231 Difference]: Finished difference. Result has 33 places, 14 transitions, 68 flow [2022-12-06 06:16:28,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=68, PETRI_PLACES=33, PETRI_TRANSITIONS=14} [2022-12-06 06:16:28,828 INFO L294 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2022-12-06 06:16:28,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:16:28,828 INFO L89 Accepts]: Start accepts. Operand has 33 places, 14 transitions, 68 flow [2022-12-06 06:16:28,828 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:16:28,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:16:28,828 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 14 transitions, 68 flow [2022-12-06 06:16:28,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 14 transitions, 68 flow [2022-12-06 06:16:28,831 INFO L130 PetriNetUnfolder]: 1/16 cut-off events. [2022-12-06 06:16:28,831 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 06:16:28,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 16 events. 1/16 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 39. Up to 5 conditions per place. [2022-12-06 06:16:28,832 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 14 transitions, 68 flow [2022-12-06 06:16:28,832 INFO L188 LiptonReduction]: Number of co-enabled transitions 2 [2022-12-06 06:16:29,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L802: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_428 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_148 256) 0)))) (and (= (ite .cse0 1 0) v_~x$w_buff0_used~0_428) (= v_~weak$$choice2~0_148 |v_P1Thread1of1ForFork0_#t~nondet6#1_38|) (= v_~__unbuffered_p1_EBX~0_90 v_~y~0_88) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~x$r_buff0_thd2~0_228) (= v_~x$r_buff1_thd2~0_189 (ite .cse0 v_~x$r_buff0_thd2~0_230 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd2~0_228 256) 0))) (or .cse1 (and .cse2 (= (mod v_~x$w_buff1_used~0_379 256) 0)) (and .cse2 (= (mod v_~x$r_buff0_thd2~0_230 256) 0)))) v_~x$r_buff0_thd2~0_230 0))) (= v_~x$w_buff0~0_306 1) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~x$w_buff1_used~0_379 (ite .cse0 v_~x$w_buff0_used~0_430 (ite .cse1 v_~x$w_buff0_used~0_430 0))) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= v_~x$r_buff0_thd1~0_177 v_~x$r_buff1_thd1~0_179) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43| (ite (= 0 (mod v_~x$w_buff0_used~0_430 256)) 1 0)) (= (ite .cse0 v_~x$mem_tmp~0_116 v_~__unbuffered_p1_EAX~0_96) v_~x~0_341) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| 0)) (= v_~x$flush_delayed~0_132 0) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_38| v_~weak$$choice0~0_102) (= v_~x$w_buff0~0_308 v_~x$w_buff1~0_279) (= v_~x~0_342 v_~x$mem_tmp~0_116) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|) (= v_~x$r_buff0_thd0~0_128 v_~x$r_buff1_thd0~0_137))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_308, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_177, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_38|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_38|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_230, ~y~0=v_~y~0_88, ~x~0=v_~x~0_342, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_430} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_306, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_177, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, ~x$flush_delayed~0=v_~x$flush_delayed~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ~x$mem_tmp~0=v_~x$mem_tmp~0_116, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y~0=v_~y~0_88, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_279, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_189, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_379, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_228, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_137, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_428, ~weak$$choice0~0=v_~weak$$choice0~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~x~0=v_~x~0_341} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~nondet6#1, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] and [413] $Ultimate##0-->P0EXIT: Formula: (let ((.cse10 (= (mod v_~x$r_buff1_thd1~0_182 256) 0)) (.cse6 (= (mod v_~x$r_buff0_thd1~0_180 256) 0))) (let ((.cse8 (not .cse6)) (.cse1 (and .cse6 (= (mod v_~x$w_buff1_used~0_384 256) 0))) (.cse2 (and .cse6 .cse10)) (.cse11 (= (mod v_~x$w_buff0_used~0_435 256) 0))) (let ((.cse4 (or .cse1 .cse2 .cse11)) (.cse5 (and (not .cse11) .cse8)) (.cse0 (not (= (mod v_~weak$$choice2~0_150 256) 0))) (.cse3 (= (mod v_~x$w_buff0_used~0_434 256) 0)) (.cse7 (= (mod v_~x$w_buff1_used~0_383 256) 0))) (and (= v_~weak$$choice2~0_150 |v_P0Thread1of1ForFork1_#t~nondet4_110|) (= (ite .cse0 v_~x$mem_tmp~0_118 v_~__unbuffered_p0_EBX~0_122) v_~x~0_345) (= |v_P0Thread1of1ForFork1_#in~arg.base_33| v_P0Thread1of1ForFork1_~arg.base_33) (= v_~__unbuffered_cnt~0_121 (+ v_~__unbuffered_cnt~0_122 1)) (= v_P0Thread1of1ForFork1_~arg.offset_33 |v_P0Thread1of1ForFork1_#in~arg.offset_33|) (= (ite .cse0 v_~x$w_buff1_used~0_384 (ite (or .cse1 .cse2 .cse3) v_~x$w_buff1_used~0_384 0)) v_~x$w_buff1_used~0_383) (= v_~weak$$choice0~0_104 |v_P0Thread1of1ForFork1_#t~nondet3_110|) (= v_~__unbuffered_p0_EBX~0_122 (ite .cse4 v_~x~0_346 (ite .cse5 v_~x$w_buff0~0_313 v_~x$w_buff1~0_284))) (= v_~x$w_buff0_used~0_434 (ite .cse0 v_~x$w_buff0_used~0_435 (ite .cse4 v_~x$w_buff0_used~0_435 (ite .cse5 0 v_~x$w_buff0_used~0_435)))) (= v_~y~0_90 v_~__unbuffered_p0_EAX~0_96) (= |v_P0Thread1of1ForFork1_#res.offset_19| 0) (= v_~x$w_buff1~0_284 v_~x$w_buff1~0_283) (= v_~y~0_90 1) (= |v_P0Thread1of1ForFork1_#res.base_19| 0) (= v_~x~0_346 v_~x$mem_tmp~0_118) (= v_~x$flush_delayed~0_134 0) (= (ite .cse0 v_~x$r_buff0_thd1~0_180 (ite (or .cse2 (and .cse6 .cse7) .cse3) v_~x$r_buff0_thd1~0_180 (ite (and .cse8 (not .cse3)) 0 v_~x$r_buff0_thd1~0_180))) v_~x$r_buff0_thd1~0_179) (= v_~x$r_buff1_thd1~0_181 (ite .cse0 v_~x$r_buff1_thd1~0_182 (ite (let ((.cse9 (= (mod v_~x$r_buff0_thd1~0_179 256) 0))) (or .cse3 (and .cse9 .cse7) (and .cse9 .cse10))) v_~x$r_buff1_thd1~0_182 0))) (= v_~x$w_buff0~0_313 v_~x$w_buff0~0_312))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_180, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_33|, ~x$w_buff1~0=v_~x$w_buff1~0_284, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_122, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_182, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_110|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_33|, ~x~0=v_~x~0_346, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_110|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_435} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_312, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_179, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_122, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_134, ~x$w_buff1~0=v_~x$w_buff1~0_283, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_19|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_383, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_181, ~x$mem_tmp~0=v_~x$mem_tmp~0_118, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_33|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_434, ~weak$$choice0~0=v_~weak$$choice0~0_104, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_96, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_33|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_33, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_121, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y~0=v_~y~0_90, ~x~0=v_~x~0_345} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, ~x$flush_delayed~0, ~x$w_buff1~0, P0Thread1of1ForFork1_#res.base, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~y~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 06:16:30,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [412] $Ultimate##0-->L802: Formula: (let ((.cse1 (= (mod v_~x$w_buff0_used~0_428 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_148 256) 0)))) (and (= (ite .cse0 1 0) v_~x$w_buff0_used~0_428) (= v_~weak$$choice2~0_148 |v_P1Thread1of1ForFork0_#t~nondet6#1_38|) (= v_~__unbuffered_p1_EBX~0_90 v_~y~0_88) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~x$r_buff0_thd2~0_228) (= v_~x$r_buff1_thd2~0_189 (ite .cse0 v_~x$r_buff0_thd2~0_230 (ite (let ((.cse2 (= (mod v_~x$r_buff0_thd2~0_228 256) 0))) (or .cse1 (and .cse2 (= (mod v_~x$w_buff1_used~0_379 256) 0)) (and .cse2 (= (mod v_~x$r_buff0_thd2~0_230 256) 0)))) v_~x$r_buff0_thd2~0_230 0))) (= v_~x$w_buff0~0_306 1) (= v_~__unbuffered_p1_EAX~0_96 1) (= v_~x$w_buff1_used~0_379 (ite .cse0 v_~x$w_buff0_used~0_430 (ite .cse1 v_~x$w_buff0_used~0_430 0))) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|) (= v_~x$r_buff0_thd1~0_177 v_~x$r_buff1_thd1~0_179) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43| (ite (= 0 (mod v_~x$w_buff0_used~0_430 256)) 1 0)) (= (ite .cse0 v_~x$mem_tmp~0_116 v_~__unbuffered_p1_EAX~0_96) v_~x~0_341) (not (= |v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43| 0)) (= v_~x$flush_delayed~0_132 0) (= |v_P1Thread1of1ForFork0_~arg#1.base_35| |v_P1Thread1of1ForFork0_#in~arg#1.base_35|) (= |v_P1Thread1of1ForFork0_#t~nondet5#1_38| v_~weak$$choice0~0_102) (= v_~x$w_buff0~0_308 v_~x$w_buff1~0_279) (= v_~x~0_342 v_~x$mem_tmp~0_116) (= |v_P1Thread1of1ForFork0_#in~arg#1.offset_35| |v_P1Thread1of1ForFork0_~arg#1.offset_35|) (= v_~x$r_buff0_thd0~0_128 v_~x$r_buff1_thd0~0_137))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_308, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_177, P1Thread1of1ForFork0_#t~nondet5#1=|v_P1Thread1of1ForFork0_#t~nondet5#1_38|, P1Thread1of1ForFork0_#t~nondet6#1=|v_P1Thread1of1ForFork0_#t~nondet6#1_38|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_230, ~y~0=v_~y~0_88, ~x~0=v_~x~0_342, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_430} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_306, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_177, P1Thread1of1ForFork0_~arg#1.base=|v_P1Thread1of1ForFork0_~arg#1.base_35|, ~x$flush_delayed~0=v_~x$flush_delayed~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ~x$mem_tmp~0=v_~x$mem_tmp~0_116, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1_43|, P1Thread1of1ForFork0_#in~arg#1.base=|v_P1Thread1of1ForFork0_#in~arg#1.base_35|, P1Thread1of1ForFork0_#in~arg#1.offset=|v_P1Thread1of1ForFork0_#in~arg#1.offset_35|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y~0=v_~y~0_88, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_128, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork0___VERIFIER_assert_~expression#1_43|, P1Thread1of1ForFork0_~arg#1.offset=|v_P1Thread1of1ForFork0_~arg#1.offset_35|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, ~x$w_buff1~0=v_~x$w_buff1~0_279, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_189, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_379, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_228, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_137, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_428, ~weak$$choice0~0=v_~weak$$choice0~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~x~0=v_~x~0_341} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression#1, P1Thread1of1ForFork0_~arg#1.base, P1Thread1of1ForFork0_~arg#1.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork0_#t~nondet5#1, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, P1Thread1of1ForFork0_#t~nondet6#1, ~x$mem_tmp~0, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression#1, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p1_EAX~0, ~weak$$choice2~0, ~x~0] and [408] $Ultimate##0-->L763: Formula: (let ((.cse6 (= (mod v_~x$r_buff1_thd1~0_150 256) 0)) (.cse3 (= (mod v_~x$r_buff0_thd1~0_150 256) 0))) (let ((.cse5 (not .cse3)) (.cse11 (= (mod v_~x$w_buff0_used~0_377 256) 0)) (.cse1 (and .cse6 .cse3)) (.cse10 (and (= (mod v_~x$w_buff1_used~0_330 256) 0) .cse3))) (let ((.cse4 (= (mod v_~x$w_buff1_used~0_329 256) 0)) (.cse8 (or .cse11 .cse1 .cse10)) (.cse9 (and (not .cse11) .cse5)) (.cse0 (not (= (mod v_~weak$$choice2~0_128 256) 0))) (.cse2 (= (mod v_~x$w_buff0_used~0_376 256) 0))) (and (= |v_P0Thread1of1ForFork1_#t~nondet3_82| v_~weak$$choice0~0_82) (= v_~y~0_72 1) (= v_~weak$$choice2~0_128 |v_P0Thread1of1ForFork1_#t~nondet4_82|) (= (ite .cse0 v_~x$r_buff0_thd1~0_150 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~x$r_buff0_thd1~0_150 (ite (and .cse5 (not .cse2)) 0 v_~x$r_buff0_thd1~0_150))) v_~x$r_buff0_thd1~0_149) (= (ite .cse0 v_~x$r_buff1_thd1~0_150 (ite (let ((.cse7 (= (mod v_~x$r_buff0_thd1~0_149 256) 0))) (or (and .cse6 .cse7) .cse2 (and .cse4 .cse7))) v_~x$r_buff1_thd1~0_150 0)) v_~x$r_buff1_thd1~0_149) (= v_~x$flush_delayed~0_112 0) (= v_~x$w_buff0_used~0_376 (ite .cse0 v_~x$w_buff0_used~0_377 (ite .cse8 v_~x$w_buff0_used~0_377 (ite .cse9 0 v_~x$w_buff0_used~0_377)))) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~x$w_buff0~0_263 v_~x$w_buff0~0_262) (= (ite .cse0 v_~x$mem_tmp~0_96 v_~__unbuffered_p0_EBX~0_108) v_~x~0_293) (= v_~x$w_buff1~0_238 v_~x$w_buff1~0_237) (= v_~y~0_72 v_~__unbuffered_p0_EAX~0_82) (= v_~x$mem_tmp~0_96 v_~x~0_294) (= v_~__unbuffered_p0_EBX~0_108 (ite .cse8 v_~x~0_294 (ite .cse9 v_~x$w_buff0~0_263 v_~x$w_buff1~0_238))) (= (ite .cse0 v_~x$w_buff1_used~0_330 (ite (or .cse1 .cse2 .cse10) v_~x$w_buff1_used~0_330 0)) v_~x$w_buff1_used~0_329) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_263, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_150, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~x$w_buff1~0=v_~x$w_buff1~0_238, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_330, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_150, P0Thread1of1ForFork1_#t~nondet3=|v_P0Thread1of1ForFork1_#t~nondet3_82|, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_294, P0Thread1of1ForFork1_#t~nondet4=|v_P0Thread1of1ForFork1_#t~nondet4_82|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_377} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_262, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_149, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_108, ~x$flush_delayed~0=v_~x$flush_delayed~0_112, ~x$w_buff1~0=v_~x$w_buff1~0_237, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_329, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_96, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_376, ~weak$$choice0~0=v_~weak$$choice0~0_82, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~weak$$choice2~0=v_~weak$$choice2~0_128, ~y~0=v_~y~0_72, ~x~0=v_~x~0_293} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~__unbuffered_p0_EBX~0, ~x$flush_delayed~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$mem_tmp~0, P0Thread1of1ForFork1_~arg.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_~arg.offset, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, ~y~0, ~x~0, P0Thread1of1ForFork1_#t~nondet4] [2022-12-06 06:16:30,639 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 06:16:30,640 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1812 [2022-12-06 06:16:30,640 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 10 transitions, 66 flow [2022-12-06 06:16:30,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:16:30,640 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:16:30,640 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:30,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:16:30,641 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-06 06:16:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:16:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash -399425165, now seen corresponding path program 1 times [2022-12-06 06:16:30,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:16:30,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697151463] [2022-12-06 06:16:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:16:30,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:16:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:16:30,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:16:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:16:30,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:16:30,710 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:16:30,711 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 06:16:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-06 06:16:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 06:16:30,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 06:16:30,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-06 06:16:30,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:16:30,714 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:16:30,718 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:16:30,718 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:16:30,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:16:30 BasicIcfg [2022-12-06 06:16:30,757 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:16:30,757 INFO L158 Benchmark]: Toolchain (without parser) took 9822.41ms. Allocated memory was 168.8MB in the beginning and 320.9MB in the end (delta: 152.0MB). Free memory was 144.5MB in the beginning and 225.6MB in the end (delta: -81.1MB). Peak memory consumption was 72.5MB. Max. memory is 8.0GB. [2022-12-06 06:16:30,758 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 168.8MB. Free memory was 146.3MB in the beginning and 146.3MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:16:30,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.60ms. Allocated memory is still 168.8MB. Free memory was 143.9MB in the beginning and 118.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 06:16:30,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.48ms. Allocated memory is still 168.8MB. Free memory was 118.2MB in the beginning and 115.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:30,758 INFO L158 Benchmark]: Boogie Preprocessor took 25.46ms. Allocated memory is still 168.8MB. Free memory was 115.6MB in the beginning and 113.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 06:16:30,758 INFO L158 Benchmark]: RCFGBuilder took 523.68ms. Allocated memory is still 168.8MB. Free memory was 113.5MB in the beginning and 78.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2022-12-06 06:16:30,758 INFO L158 Benchmark]: TraceAbstraction took 8776.30ms. Allocated memory was 168.8MB in the beginning and 320.9MB in the end (delta: 152.0MB). Free memory was 78.4MB in the beginning and 225.6MB in the end (delta: -147.2MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2022-12-06 06:16:30,760 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.11ms. Allocated memory is still 168.8MB. Free memory was 146.3MB in the beginning and 146.3MB in the end (delta: 67.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 452.60ms. Allocated memory is still 168.8MB. Free memory was 143.9MB in the beginning and 118.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.48ms. Allocated memory is still 168.8MB. Free memory was 118.2MB in the beginning and 115.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.46ms. Allocated memory is still 168.8MB. Free memory was 115.6MB in the beginning and 113.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 523.68ms. Allocated memory is still 168.8MB. Free memory was 113.5MB in the beginning and 78.9MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * TraceAbstraction took 8776.30ms. Allocated memory was 168.8MB in the beginning and 320.9MB in the end (delta: 152.0MB). Free memory was 78.4MB in the beginning and 225.6MB in the end (delta: -147.2MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 94 PlacesBefore, 27 PlacesAfterwards, 89 TransitionsBefore, 21 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 37 TrivialYvCompositions, 32 ConcurrentYvCompositions, 1 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 885, independent: 836, independent conditional: 836, independent unconditional: 0, dependent: 49, dependent conditional: 49, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 885, independent: 836, independent conditional: 0, independent unconditional: 836, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 885, independent: 836, independent conditional: 0, independent unconditional: 836, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 885, independent: 836, independent conditional: 0, independent unconditional: 836, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 702, independent: 670, independent conditional: 0, independent unconditional: 670, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 702, independent: 663, independent conditional: 0, independent unconditional: 663, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 39, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 173, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 885, independent: 166, independent conditional: 0, independent unconditional: 166, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 702, unknown conditional: 0, unknown unconditional: 702] , Statistics on independence cache: Total cache size (in pairs): 1001, Positive cache size: 969, Positive conditional cache size: 0, Positive unconditional cache size: 969, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 23 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 54, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 8, independent unconditional: 46, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 54, independent conditional: 8, independent unconditional: 46, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 54, independent conditional: 8, independent unconditional: 46, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 7, independent unconditional: 38, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 4, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 67, dependent conditional: 21, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, independent: 9, independent conditional: 1, independent unconditional: 8, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 59, unknown conditional: 11, unknown unconditional: 48] , Statistics on independence cache: Total cache size (in pairs): 59, Positive cache size: 45, Positive conditional cache size: 7, Positive unconditional cache size: 38, Negative cache size: 14, Negative conditional cache size: 4, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 23 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 106 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 70, independent conditional: 70, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 70, independent conditional: 27, independent unconditional: 43, dependent: 29, dependent conditional: 2, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 66, Positive conditional cache size: 9, Positive unconditional cache size: 57, Negative cache size: 20, Negative conditional cache size: 4, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 29, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 84 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 1, independent unconditional: 17, dependent: 13, dependent conditional: 1, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 67, Positive conditional cache size: 9, Positive unconditional cache size: 58, Negative cache size: 22, Negative conditional cache size: 4, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 27 PlacesBefore, 27 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 69, Positive conditional cache size: 9, Positive unconditional cache size: 60, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 29 PlacesBefore, 27 PlacesAfterwards, 17 TransitionsBefore, 15 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 32, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 72, Positive conditional cache size: 9, Positive unconditional cache size: 63, Negative cache size: 26, Negative conditional cache size: 4, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 26 PlacesBefore, 25 PlacesAfterwards, 15 TransitionsBefore, 14 TransitionsAfterwards, 34 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, independent: 26, independent conditional: 26, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, independent: 26, independent conditional: 7, independent unconditional: 19, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, independent: 22, independent conditional: 3, independent unconditional: 19, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 10, unknown conditional: 4, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 80, Positive conditional cache size: 13, Positive unconditional cache size: 67, Negative cache size: 32, Negative conditional cache size: 4, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 29 PlacesBefore, 24 PlacesAfterwards, 14 TransitionsBefore, 10 TransitionsAfterwards, 2 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 123, Positive cache size: 91, Positive conditional cache size: 13, Positive unconditional cache size: 78, Negative cache size: 32, Negative conditional cache size: 4, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - 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_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-2, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=-1, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 [L801] 2 __unbuffered_p1_EBX = y [L743] 2 y = 1 [L746] 2 __unbuffered_p0_EAX = y [L749] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 2 x$flush_delayed = weak$$choice2 [L752] 2 x$mem_tmp = x [L753] 2 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 2 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 2 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 2 __unbuffered_p0_EBX = x [L761] 2 x = x$flush_delayed ? x$mem_tmp : x [L762] 2 x$flush_delayed = (_Bool)0 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - 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: 829]: 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: 827]: 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, 110 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: 8.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 324 IncrementalHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 4 mSDtfsCounter, 324 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=5, InterpolantAutomatonStates: 33, 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, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 414 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:16:30,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...