/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-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:10:14,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:10:14,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:10:14,324 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:10:14,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:10:14,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:10:14,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:10:14,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:10:14,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:10:14,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:10:14,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:10:14,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:10:14,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:10:14,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:10:14,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:10:14,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:10:14,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:10:14,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:10:14,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:10:14,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:10:14,344 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:10:14,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:10:14,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:10:14,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:10:14,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:10:14,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:10:14,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:10:14,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:10:14,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:10:14,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:10:14,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:10:14,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:10:14,362 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:10:14,363 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:10:14,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:10:14,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:10:14,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:10:14,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:10:14,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:10:14,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:10:14,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:10:14,370 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-RepeatedSemanticLbe.epf [2022-12-13 03:10:14,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:10:14,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:10:14,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:10:14,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:10:14,403 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:10:14,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:10:14,404 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:10:14,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:10:14,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:10:14,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:10:14,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:10:14,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:10:14,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:10:14,405 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:10:14,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:10:14,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:10:14,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:10:14,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:10:14,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:10:14,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:10:14,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:10:14,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:10:14,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:10:14,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:10:14,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:10:14,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:10:14,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:10:14,407 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:10:14,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:10:14,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:10:14,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:10:14,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:10:14,717 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:10:14,717 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:10:14,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2022-12-13 03:10:15,758 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:10:15,970 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:10:15,970 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.i [2022-12-13 03:10:16,013 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b633c0a3/26aebe393cc14e698ca457f6f3207f9e/FLAGfe9c76459 [2022-12-13 03:10:16,028 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b633c0a3/26aebe393cc14e698ca457f6f3207f9e [2022-12-13 03:10:16,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:10:16,031 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:10:16,033 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:10:16,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:10:16,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:10:16,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6036fd9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16, skipping insertion in model container [2022-12-13 03:10:16,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,041 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:10:16,094 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:10:16,233 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/rfi000_tso.i[944,957] [2022-12-13 03:10:16,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,447 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:10:16,458 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:10:16,468 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/rfi000_tso.i[944,957] [2022-12-13 03:10:16,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:10:16,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:10:16,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:10:16,567 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:10:16,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16 WrapperNode [2022-12-13 03:10:16,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:10:16,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:10:16,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:10:16,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:10:16,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,601 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,636 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 164 [2022-12-13 03:10:16,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:10:16,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:10:16,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:10:16,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:10:16,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,673 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:10:16,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:10:16,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:10:16,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:10:16,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (1/1) ... [2022-12-13 03:10:16,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:10:16,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:10:16,720 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-13 03:10:16,736 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-13 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:10:16,746 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:10:16,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:10:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:10:16,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:10:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:10:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:10:16,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:10:16,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:10:16,748 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:10:16,834 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:10:16,836 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:10:17,100 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:10:17,259 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:10:17,260 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:10:17,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:10:17 BoogieIcfgContainer [2022-12-13 03:10:17,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:10:17,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:10:17,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:10:17,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:10:17,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:10:16" (1/3) ... [2022-12-13 03:10:17,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152e3e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:10:17, skipping insertion in model container [2022-12-13 03:10:17,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:10:16" (2/3) ... [2022-12-13 03:10:17,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@152e3e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:10:17, skipping insertion in model container [2022-12-13 03:10:17,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:10:17" (3/3) ... [2022-12-13 03:10:17,270 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.i [2022-12-13 03:10:17,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:10:17,283 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 03:10:17,283 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:10:17,321 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:10:17,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 03:10:17,397 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 03:10:17,398 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:10:17,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 03:10:17,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2022-12-13 03:10:17,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2022-12-13 03:10:17,407 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:17,423 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 03:10:17,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2022-12-13 03:10:17,462 INFO L130 PetriNetUnfolder]: 2/88 cut-off events. [2022-12-13 03:10:17,462 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:10:17,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2022-12-13 03:10:17,465 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2022-12-13 03:10:17,465 INFO L226 LiptonReduction]: Number of co-enabled transitions 1156 [2022-12-13 03:10:23,462 INFO L241 LiptonReduction]: Total number of compositions: 71 [2022-12-13 03:10:23,481 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:10:23,486 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;@a8197c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:10:23,487 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-13 03:10:23,492 INFO L130 PetriNetUnfolder]: 0/20 cut-off events. [2022-12-13 03:10:23,492 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:10:23,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:23,493 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 03:10:23,493 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-13 03:10:23,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:23,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1458424011, now seen corresponding path program 1 times [2022-12-13 03:10:23,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:23,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674024535] [2022-12-13 03:10:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:23,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:23,802 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-13 03:10:23,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:23,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674024535] [2022-12-13 03:10:23,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674024535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:23,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:23,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:10:23,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8602868] [2022-12-13 03:10:23,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:23,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:10:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:23,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:10:23,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:10:23,832 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 46 [2022-12-13 03:10:23,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:23,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:23,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 46 [2022-12-13 03:10:23,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:24,302 INFO L130 PetriNetUnfolder]: 1577/2679 cut-off events. [2022-12-13 03:10:24,303 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 03:10:24,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 2679 events. 1577/2679 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16085 event pairs, 311 based on Foata normal form. 0/1564 useless extension candidates. Maximal degree in co-relation 5233. Up to 1987 conditions per place. [2022-12-13 03:10:24,311 INFO L137 encePairwiseOnDemand]: 42/46 looper letters, 23 selfloop transitions, 2 changer transitions 40/71 dead transitions. [2022-12-13 03:10:24,311 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 278 flow [2022-12-13 03:10:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:10:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:10:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 03:10:24,319 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6231884057971014 [2022-12-13 03:10:24,321 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2022-12-13 03:10:24,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 71 transitions, 278 flow [2022-12-13 03:10:24,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 118 flow [2022-12-13 03:10:24,334 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:24,335 INFO L89 Accepts]: Start accepts. Operand has 33 places, 31 transitions, 118 flow [2022-12-13 03:10:24,337 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:24,337 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:24,337 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 31 transitions, 118 flow [2022-12-13 03:10:24,340 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 31 transitions, 118 flow [2022-12-13 03:10:24,340 INFO L226 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-13 03:10:24,351 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:10:24,353 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 03:10:24,353 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 118 flow [2022-12-13 03:10:24,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:24,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:24,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:24,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:10:24,353 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-13 03:10:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2033493015, now seen corresponding path program 1 times [2022-12-13 03:10:24,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:24,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807021286] [2022-12-13 03:10:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:24,526 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-13 03:10:24,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:24,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807021286] [2022-12-13 03:10:24,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807021286] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:24,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:24,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:10:24,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134958228] [2022-12-13 03:10:24,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:24,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:10:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:24,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:10:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:10:24,529 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2022-12-13 03:10:24,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:24,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:24,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2022-12-13 03:10:24,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:24,589 INFO L130 PetriNetUnfolder]: 210/392 cut-off events. [2022-12-13 03:10:24,590 INFO L131 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2022-12-13 03:10:24,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 392 events. 210/392 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1574 event pairs, 58 based on Foata normal form. 15/355 useless extension candidates. Maximal degree in co-relation 1128. Up to 288 conditions per place. [2022-12-13 03:10:24,592 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 28 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-13 03:10:24,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 198 flow [2022-12-13 03:10:24,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:10:24,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:10:24,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 03:10:24,593 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-13 03:10:24,593 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -18 predicate places. [2022-12-13 03:10:24,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 36 transitions, 198 flow [2022-12-13 03:10:24,595 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 36 transitions, 198 flow [2022-12-13 03:10:24,596 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:24,597 INFO L89 Accepts]: Start accepts. Operand has 35 places, 36 transitions, 198 flow [2022-12-13 03:10:24,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:24,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:24,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 36 transitions, 198 flow [2022-12-13 03:10:24,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 36 transitions, 198 flow [2022-12-13 03:10:24,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 182 [2022-12-13 03:10:26,059 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:10:26,060 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1464 [2022-12-13 03:10:26,060 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 36 transitions, 200 flow [2022-12-13 03:10:26,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:26,060 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:26,060 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:26,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:10:26,060 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-13 03:10:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 752484593, now seen corresponding path program 1 times [2022-12-13 03:10:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:26,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437464860] [2022-12-13 03:10:26,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:26,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:26,195 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-13 03:10:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:26,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437464860] [2022-12-13 03:10:26,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437464860] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:26,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:26,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:10:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793183542] [2022-12-13 03:10:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:26,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:10:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:26,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:10:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:10:26,197 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 03:10:26,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-13 03:10:26,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:26,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 03:10:26,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:26,279 INFO L130 PetriNetUnfolder]: 191/368 cut-off events. [2022-12-13 03:10:26,279 INFO L131 PetriNetUnfolder]: For 13/17 co-relation queries the response was YES. [2022-12-13 03:10:26,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 368 events. 191/368 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1505 event pairs, 53 based on Foata normal form. 10/327 useless extension candidates. Maximal degree in co-relation 1396. Up to 264 conditions per place. [2022-12-13 03:10:26,282 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 32 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-13 03:10:26,282 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 290 flow [2022-12-13 03:10:26,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:10:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:10:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 03:10:26,283 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5641025641025641 [2022-12-13 03:10:26,283 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -16 predicate places. [2022-12-13 03:10:26,283 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 40 transitions, 290 flow [2022-12-13 03:10:26,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 40 transitions, 290 flow [2022-12-13 03:10:26,287 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:26,287 INFO L89 Accepts]: Start accepts. Operand has 37 places, 40 transitions, 290 flow [2022-12-13 03:10:26,288 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:26,288 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:26,288 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 40 transitions, 290 flow [2022-12-13 03:10:26,289 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 40 transitions, 290 flow [2022-12-13 03:10:26,289 INFO L226 LiptonReduction]: Number of co-enabled transitions 190 [2022-12-13 03:10:26,294 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:10:26,295 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:10:26,296 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 290 flow [2022-12-13 03:10:26,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-13 03:10:26,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:26,296 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:26,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:10:26,297 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-13 03:10:26,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:26,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1852183254, now seen corresponding path program 1 times [2022-12-13 03:10:26,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:26,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66501644] [2022-12-13 03:10:26,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:26,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:27,073 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-13 03:10:27,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:27,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66501644] [2022-12-13 03:10:27,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66501644] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:27,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:27,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:10:27,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077985349] [2022-12-13 03:10:27,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:27,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:10:27,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:27,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:10:27,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:10:27,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 25 [2022-12-13 03:10:27,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-13 03:10:27,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:27,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 25 [2022-12-13 03:10:27,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:27,294 INFO L130 PetriNetUnfolder]: 188/372 cut-off events. [2022-12-13 03:10:27,294 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2022-12-13 03:10:27,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1743 conditions, 372 events. 188/372 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1543 event pairs, 16 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 1724. Up to 296 conditions per place. [2022-12-13 03:10:27,296 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 43 selfloop transitions, 9 changer transitions 0/58 dead transitions. [2022-12-13 03:10:27,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 541 flow [2022-12-13 03:10:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:10:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:10:27,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-12-13 03:10:27,298 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2022-12-13 03:10:27,298 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2022-12-13 03:10:27,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 58 transitions, 541 flow [2022-12-13 03:10:27,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 58 transitions, 541 flow [2022-12-13 03:10:27,302 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:27,302 INFO L89 Accepts]: Start accepts. Operand has 42 places, 58 transitions, 541 flow [2022-12-13 03:10:27,303 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:27,303 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:27,303 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 58 transitions, 541 flow [2022-12-13 03:10:27,305 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 58 transitions, 541 flow [2022-12-13 03:10:27,305 INFO L226 LiptonReduction]: Number of co-enabled transitions 218 [2022-12-13 03:10:27,306 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:10:27,307 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:10:27,307 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 58 transitions, 541 flow [2022-12-13 03:10:27,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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-13 03:10:27,307 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:27,307 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:27,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:10:27,307 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-13 03:10:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1785476900, now seen corresponding path program 1 times [2022-12-13 03:10:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:27,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376161045] [2022-12-13 03:10:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:27,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:27,431 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-13 03:10:27,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:27,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376161045] [2022-12-13 03:10:27,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376161045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:27,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:27,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:10:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265004429] [2022-12-13 03:10:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:27,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:10:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:10:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:10:27,433 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 25 [2022-12-13 03:10:27,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 58 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:27,433 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:27,433 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 25 [2022-12-13 03:10:27,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:27,505 INFO L130 PetriNetUnfolder]: 134/295 cut-off events. [2022-12-13 03:10:27,506 INFO L131 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-12-13 03:10:27,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 295 events. 134/295 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1244 event pairs, 14 based on Foata normal form. 18/281 useless extension candidates. Maximal degree in co-relation 1607. Up to 250 conditions per place. [2022-12-13 03:10:27,508 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 48 selfloop transitions, 15 changer transitions 1/67 dead transitions. [2022-12-13 03:10:27,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 67 transitions, 744 flow [2022-12-13 03:10:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:10:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:10:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-12-13 03:10:27,509 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2022-12-13 03:10:27,509 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -9 predicate places. [2022-12-13 03:10:27,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 67 transitions, 744 flow [2022-12-13 03:10:27,511 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 66 transitions, 742 flow [2022-12-13 03:10:27,513 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:27,513 INFO L89 Accepts]: Start accepts. Operand has 43 places, 66 transitions, 742 flow [2022-12-13 03:10:27,514 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:27,514 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:27,514 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 66 transitions, 742 flow [2022-12-13 03:10:27,515 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 66 transitions, 742 flow [2022-12-13 03:10:27,515 INFO L226 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-13 03:10:27,766 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L759-->L770: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [426] $Ultimate##0-->L739: Formula: (and (= v_~y~0_238 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_238, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 03:10:27,864 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:10:27,865 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 352 [2022-12-13 03:10:27,865 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 65 transitions, 732 flow [2022-12-13 03:10:27,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:27,865 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:27,865 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:27,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:10:27,865 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-13 03:10:27,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2083404120, now seen corresponding path program 1 times [2022-12-13 03:10:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:27,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150793830] [2022-12-13 03:10:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:28,444 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-13 03:10:28,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:28,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150793830] [2022-12-13 03:10:28,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150793830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:28,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:28,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:10:28,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363805587] [2022-12-13 03:10:28,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:28,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:10:28,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:28,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:10:28,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:10:28,448 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 26 [2022-12-13 03:10:28,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 65 transitions, 732 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-13 03:10:28,449 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:28,449 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 26 [2022-12-13 03:10:28,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:28,562 INFO L130 PetriNetUnfolder]: 131/290 cut-off events. [2022-12-13 03:10:28,562 INFO L131 PetriNetUnfolder]: For 490/490 co-relation queries the response was YES. [2022-12-13 03:10:28,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1840 conditions, 290 events. 131/290 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1196 event pairs, 19 based on Foata normal form. 3/261 useless extension candidates. Maximal degree in co-relation 1815. Up to 244 conditions per place. [2022-12-13 03:10:28,565 INFO L137 encePairwiseOnDemand]: 19/26 looper letters, 47 selfloop transitions, 10 changer transitions 1/64 dead transitions. [2022-12-13 03:10:28,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 834 flow [2022-12-13 03:10:28,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:10:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:10:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-12-13 03:10:28,567 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40384615384615385 [2022-12-13 03:10:28,569 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2022-12-13 03:10:28,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 64 transitions, 834 flow [2022-12-13 03:10:28,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 63 transitions, 832 flow [2022-12-13 03:10:28,573 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:28,573 INFO L89 Accepts]: Start accepts. Operand has 46 places, 63 transitions, 832 flow [2022-12-13 03:10:28,575 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:28,575 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:28,575 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 63 transitions, 832 flow [2022-12-13 03:10:28,576 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 63 transitions, 832 flow [2022-12-13 03:10:28,576 INFO L226 LiptonReduction]: Number of co-enabled transitions 116 [2022-12-13 03:10:28,962 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [474] L759-->L786: Formula: (let ((.cse2 (= (mod v_~y$w_buff0_used~0_631 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_270 256) 0)))) (and (= v_~weak$$choice2~0_270 |v_P1Thread1of1ForFork1_#t~nondet4#1_30|) (= (ite .cse0 v_~y$r_buff0_thd2~0_300 (ite (let ((.cse1 (= (mod v_~y$r_buff0_thd2~0_298 256) 0))) (or (and .cse1 (= (mod v_~y$w_buff1_used~0_616 256) 0)) .cse2 (and (= (mod v_~y$r_buff0_thd2~0_300 256) 0) .cse1))) v_~y$r_buff0_thd2~0_300 0)) v_~y$r_buff1_thd2~0_273) (= v_~y$r_buff0_thd1~0_77 v_~y$r_buff1_thd1~0_77) (= v_~y$w_buff0~0_470 1) (= v_~y~0_580 v_~y$mem_tmp~0_238) (= (ite .cse0 1 0) v_~y$w_buff0_used~0_631) (= v_~y$flush_delayed~0_253 0) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_31| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_31|) (= (ite .cse0 1 (ite .cse2 1 (ite (not .cse2) 0 1))) v_~y$r_buff0_thd2~0_298) (= v_~y$r_buff0_thd0~0_377 v_~y$r_buff1_thd0~0_379) (= (ite .cse0 v_~y$w_buff0_used~0_633 (ite .cse2 v_~y$w_buff0_used~0_633 0)) v_~y$w_buff1_used~0_616) (= v_~__unbuffered_p1_EAX~0_154 v_~y$w_buff0~0_470) (= (ite (= (mod v_~y$w_buff0_used~0_633 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_31|) (= v_~y~0_579 (ite .cse0 v_~y$mem_tmp~0_238 v_~y$w_buff0~0_470)) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_31| 0)) (= v_~y$w_buff1~0_437 v_~y$w_buff0~0_472) (= v_~weak$$choice0~0_205 |v_P1Thread1of1ForFork1_#t~nondet3#1_30|))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_30|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_633, ~y$w_buff0~0=v_~y$w_buff0~0_472, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_377, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_300, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_77, ~y~0=v_~y~0_580} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_631, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_273, ~weak$$choice0~0=v_~weak$$choice0~0_205, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_77, ~y$mem_tmp~0=v_~y$mem_tmp~0_238, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_437, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_31|, ~y$w_buff0~0=v_~y$w_buff0~0_470, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_377, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_298, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_77, ~y$flush_delayed~0=v_~y$flush_delayed~0_253, ~y~0=v_~y~0_579, ~weak$$choice2~0=v_~weak$$choice2~0_270, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_379, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_616} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [426] $Ultimate##0-->L739: Formula: (and (= v_~y~0_238 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_238, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 03:10:29,148 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L759-->L802: Formula: (let ((.cse9 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_34| 256) 0)))) (let ((.cse1 (ite .cse9 1 0))) (let ((.cse17 (= (mod .cse1 256) 0))) (let ((.cse16 (not .cse17))) (let ((.cse13 (ite .cse9 1 (ite .cse17 1 (ite .cse16 0 1))))) (let ((.cse14 (= (mod .cse13 256) 0)) (.cse10 (ite .cse9 v_~y$w_buff0_used~0_643 (ite .cse17 v_~y$w_buff0_used~0_643 0)))) (let ((.cse12 (and .cse14 (= (mod .cse10 256) 0)))) (let ((.cse4 (ite .cse9 v_~y$r_buff0_thd2~0_310 (ite (or (and .cse14 (= (mod v_~y$r_buff0_thd2~0_310 256) 0)) .cse12 .cse17) v_~y$r_buff0_thd2~0_310 0)))) (let ((.cse7 (= (mod .cse4 256) 0))) (let ((.cse15 (not .cse14)) (.cse11 (and .cse7 .cse14))) (let ((.cse2 (or .cse11 .cse12 .cse17)) (.cse3 (and .cse15 .cse16)) (.cse0 (not (= (mod v_~weak$$choice2~0_272 256) 0))) (.cse6 (= (mod v_~y$w_buff1_used~0_622 256) 0)) (.cse8 (= (mod v_~y$w_buff0_used~0_641 256) 0))) (and (= v_~y$r_buff0_thd1~0_81 v_~y$r_buff1_thd1~0_81) (= v_~__unbuffered_p1_EAX~0_156 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= (ite .cse0 .cse1 (ite .cse2 .cse1 (ite .cse3 0 .cse1))) v_~y$w_buff0_used~0_641) (= (ite .cse2 v_~y$mem_tmp~0_240 (ite .cse3 v_~__unbuffered_p1_EAX~0_156 v_~y$w_buff0~0_482)) v_~__unbuffered_p1_EBX~0_150) (= v_~weak$$choice0~0_207 |v_P1Thread1of1ForFork1_#t~nondet5#1_30|) (= (ite (= (mod v_~y$w_buff0_used~0_643 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= v_~weak$$choice2~0_272 |v_P1Thread1of1ForFork1_#t~nondet6#1_30|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| 0)) (= v_~y$flush_delayed~0_255 0) (= v_~y$r_buff1_thd2~0_279 (ite .cse0 .cse4 (ite (let ((.cse5 (= (mod v_~y$r_buff0_thd2~0_308 256) 0))) (or (and .cse5 .cse6) (and .cse5 .cse7) .cse8)) .cse4 0))) (= v_~y~0_585 (ite .cse0 v_~y$mem_tmp~0_240 v_~__unbuffered_p1_EBX~0_150)) (= v_~y$r_buff0_thd0~0_381 v_~y$r_buff1_thd0~0_383) (= v_~y$w_buff1~0_443 v_~y$w_buff0~0_482) (= (ite .cse9 v_~y~0_587 v_~__unbuffered_p1_EAX~0_156) v_~y$mem_tmp~0_240) (= v_~__unbuffered_p1_EAX~0_156 v_~y$w_buff0~0_480) (= v_~y$w_buff1_used~0_622 (ite .cse0 .cse10 (ite (or .cse11 .cse12 .cse8) .cse10 0))) (= v_~y$r_buff0_thd2~0_308 (ite .cse0 .cse13 (ite (or (and .cse14 .cse6) .cse11 .cse8) .cse13 (ite (and (not .cse8) .cse15) 0 .cse13)))))))))))))))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_34|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_643, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_30|, ~y$w_buff0~0=v_~y$w_buff0~0_482, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_381, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_81, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_30|, ~y~0=v_~y~0_587} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_150, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_641, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_33|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_279, ~weak$$choice0~0=v_~weak$$choice0~0_207, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_81, ~y$mem_tmp~0=v_~y$mem_tmp~0_240, ~y$w_buff1~0=v_~y$w_buff1~0_443, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_156, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|, ~y$w_buff0~0=v_~y$w_buff0~0_480, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_381, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_308, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_81, ~y$flush_delayed~0=v_~y$flush_delayed~0_255, ~y~0=v_~y~0_585, ~weak$$choice2~0=v_~weak$$choice2~0_272, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_383, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_622} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [426] $Ultimate##0-->L739: Formula: (and (= v_~y~0_238 2) (= v_P0Thread1of1ForFork0_~arg.offset_5 |v_P0Thread1of1ForFork0_#in~arg.offset_5|) (= v_P0Thread1of1ForFork0_~arg.base_5 |v_P0Thread1of1ForFork0_#in~arg.base_5|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_5|, ~y~0=v_~y~0_238, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_5, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_5} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] [2022-12-13 03:10:29,850 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:10:29,850 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1277 [2022-12-13 03:10:29,850 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 61 transitions, 808 flow [2022-12-13 03:10:29,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-13 03:10:29,851 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:29,851 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:10:29,851 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-13 03:10:29,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:29,851 INFO L85 PathProgramCache]: Analyzing trace with hash 767804443, now seen corresponding path program 1 times [2022-12-13 03:10:29,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:29,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613330481] [2022-12-13 03:10:29,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:29,954 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-13 03:10:29,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:29,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613330481] [2022-12-13 03:10:29,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613330481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:29,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:29,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:10:29,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074882585] [2022-12-13 03:10:29,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:29,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:10:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:29,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:10:29,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:10:29,955 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2022-12-13 03:10:29,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 61 transitions, 808 flow. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:29,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:29,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2022-12-13 03:10:29,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:30,019 INFO L130 PetriNetUnfolder]: 50/140 cut-off events. [2022-12-13 03:10:30,019 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2022-12-13 03:10:30,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 140 events. 50/140 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 540 event pairs, 1 based on Foata normal form. 27/148 useless extension candidates. Maximal degree in co-relation 978. Up to 108 conditions per place. [2022-12-13 03:10:30,021 INFO L137 encePairwiseOnDemand]: 19/27 looper letters, 32 selfloop transitions, 21 changer transitions 0/55 dead transitions. [2022-12-13 03:10:30,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 830 flow [2022-12-13 03:10:30,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:10:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:10:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 03:10:30,022 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2022-12-13 03:10:30,023 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2022-12-13 03:10:30,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 55 transitions, 830 flow [2022-12-13 03:10:30,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 55 transitions, 830 flow [2022-12-13 03:10:30,025 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:30,025 INFO L89 Accepts]: Start accepts. Operand has 45 places, 55 transitions, 830 flow [2022-12-13 03:10:30,025 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:30,026 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:30,026 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 55 transitions, 830 flow [2022-12-13 03:10:30,027 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 55 transitions, 830 flow [2022-12-13 03:10:30,027 INFO L226 LiptonReduction]: Number of co-enabled transitions 108 [2022-12-13 03:10:31,500 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:10:31,501 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1476 [2022-12-13 03:10:31,501 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 54 transitions, 814 flow [2022-12-13 03:10:31,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:31,501 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:31,501 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:10:31,501 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-13 03:10:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1202715516, now seen corresponding path program 1 times [2022-12-13 03:10:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:31,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857653859] [2022-12-13 03:10:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:31,614 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-13 03:10:31,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:31,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857653859] [2022-12-13 03:10:31,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857653859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:31,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:31,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:10:31,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746876503] [2022-12-13 03:10:31,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:31,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:10:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:31,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:10:31,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:10:31,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2022-12-13 03:10:31,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 54 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:31,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:31,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2022-12-13 03:10:31,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:31,692 INFO L130 PetriNetUnfolder]: 86/210 cut-off events. [2022-12-13 03:10:31,692 INFO L131 PetriNetUnfolder]: For 930/931 co-relation queries the response was YES. [2022-12-13 03:10:31,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 210 events. 86/210 cut-off events. For 930/931 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 838 event pairs, 0 based on Foata normal form. 10/187 useless extension candidates. Maximal degree in co-relation 1631. Up to 162 conditions per place. [2022-12-13 03:10:31,694 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 42 selfloop transitions, 3 changer transitions 34/84 dead transitions. [2022-12-13 03:10:31,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 84 transitions, 1455 flow [2022-12-13 03:10:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:10:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:10:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-13 03:10:31,695 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-13 03:10:31,696 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2022-12-13 03:10:31,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 84 transitions, 1455 flow [2022-12-13 03:10:31,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 50 transitions, 837 flow [2022-12-13 03:10:31,699 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:31,699 INFO L89 Accepts]: Start accepts. Operand has 44 places, 50 transitions, 837 flow [2022-12-13 03:10:31,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:31,699 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:31,700 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 50 transitions, 837 flow [2022-12-13 03:10:31,701 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 50 transitions, 837 flow [2022-12-13 03:10:31,701 INFO L226 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-13 03:10:31,701 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:10:31,701 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 03:10:31,702 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 50 transitions, 837 flow [2022-12-13 03:10:31,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:31,702 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:31,702 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:31,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:10:31,702 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:10:31,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash 907078074, now seen corresponding path program 1 times [2022-12-13 03:10:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:31,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943674899] [2022-12-13 03:10:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:31,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:32,490 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-13 03:10:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:32,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943674899] [2022-12-13 03:10:32,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943674899] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:32,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:32,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:10:32,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523927842] [2022-12-13 03:10:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:32,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:10:32,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:32,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:10:32,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:10:32,492 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 20 [2022-12-13 03:10:32,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 50 transitions, 837 flow. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:32,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:32,492 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 20 [2022-12-13 03:10:32,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:32,620 INFO L130 PetriNetUnfolder]: 61/161 cut-off events. [2022-12-13 03:10:32,620 INFO L131 PetriNetUnfolder]: For 801/801 co-relation queries the response was YES. [2022-12-13 03:10:32,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 161 events. 61/161 cut-off events. For 801/801 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 589 event pairs, 0 based on Foata normal form. 9/143 useless extension candidates. Maximal degree in co-relation 1382. Up to 127 conditions per place. [2022-12-13 03:10:32,621 INFO L137 encePairwiseOnDemand]: 13/20 looper letters, 28 selfloop transitions, 7 changer transitions 30/71 dead transitions. [2022-12-13 03:10:32,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 1345 flow [2022-12-13 03:10:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:10:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:10:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-12-13 03:10:32,622 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2022-12-13 03:10:32,623 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2022-12-13 03:10:32,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 71 transitions, 1345 flow [2022-12-13 03:10:32,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 41 transitions, 742 flow [2022-12-13 03:10:32,625 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:32,626 INFO L89 Accepts]: Start accepts. Operand has 49 places, 41 transitions, 742 flow [2022-12-13 03:10:32,626 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:32,626 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:32,626 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 742 flow [2022-12-13 03:10:32,627 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 742 flow [2022-12-13 03:10:32,627 INFO L226 LiptonReduction]: Number of co-enabled transitions 62 [2022-12-13 03:10:32,642 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [351] L786-->L802: Formula: (let ((.cse10 (= (mod v_~y$r_buff1_thd2~0_100 256) 0)) (.cse4 (= (mod v_~y$r_buff0_thd2~0_107 256) 0))) (let ((.cse5 (not .cse4)) (.cse11 (= (mod v_~y$w_buff0_used~0_182 256) 0)) (.cse2 (and .cse4 .cse10)) (.cse6 (and (= (mod v_~y$w_buff1_used~0_181 256) 0) .cse4))) (let ((.cse3 (= (mod v_~y$w_buff1_used~0_180 256) 0)) (.cse1 (= (mod v_~y$w_buff0_used~0_181 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_88 256) 0))) (.cse7 (or .cse11 .cse2 .cse6)) (.cse8 (and (not .cse11) .cse5))) (and (= (ite .cse0 v_~y$r_buff0_thd2~0_107 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd2~0_107 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd2~0_107))) v_~y$r_buff0_thd2~0_106) (= v_~y$w_buff1_used~0_180 (ite .cse0 v_~y$w_buff1_used~0_181 (ite (or .cse1 .cse2 .cse6) v_~y$w_buff1_used~0_181 0))) (= v_~y$w_buff0_used~0_181 (ite .cse0 v_~y$w_buff0_used~0_182 (ite .cse7 v_~y$w_buff0_used~0_182 (ite .cse8 0 v_~y$w_buff0_used~0_182)))) (= (ite .cse0 v_~y$r_buff1_thd2~0_100 (ite (let ((.cse9 (= (mod v_~y$r_buff0_thd2~0_106 256) 0))) (or (and .cse9 .cse3) .cse1 (and .cse9 .cse10))) v_~y$r_buff1_thd2~0_100 0)) v_~y$r_buff1_thd2~0_99) (= v_~y$w_buff0~0_99 v_~y$w_buff0~0_98) (= v_~y$w_buff1~0_90 v_~y$w_buff1~0_89) (= |v_P1Thread1of1ForFork1_#t~nondet6#1_1| v_~weak$$choice2~0_88) (= v_~y~0_163 (ite .cse0 v_~y$mem_tmp~0_62 v_~__unbuffered_p1_EBX~0_18)) (= 0 v_~y$flush_delayed~0_75) (= v_~__unbuffered_p1_EBX~0_18 (ite .cse7 v_~y~0_165 (ite .cse8 v_~y$w_buff0~0_99 v_~y$w_buff1~0_90))) (= v_~y~0_165 v_~y$mem_tmp~0_62) (= |v_P1Thread1of1ForFork1_#t~nondet5#1_1| v_~weak$$choice0~0_21))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_100, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~y$w_buff1~0=v_~y$w_buff1~0_90, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_1|, ~y$w_buff0~0=v_~y$w_buff0~0_99, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_1|, ~y~0=v_~y~0_165, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_181} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_18, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_181, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_99, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~y$mem_tmp~0=v_~y$mem_tmp~0_62, ~y$w_buff1~0=v_~y$w_buff1~0_89, ~y$w_buff0~0=v_~y$w_buff0~0_98, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~y$flush_delayed~0=v_~y$flush_delayed~0_75, ~y~0=v_~y~0_163, ~weak$$choice2~0=v_~weak$$choice2~0_88, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_180} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$mem_tmp~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] and [342] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_153 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd1~0_25 (ite .cse0 0 v_~y$r_buff0_thd1~0_26)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse2)) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff1_used~0_156 (ite (or .cse3 .cse0) 0 v_~y$w_buff1_used~0_157)) (= v_~y$w_buff0_used~0_153 (ite .cse4 0 v_~y$w_buff0_used~0_154)) (= v_~y~0_141 (ite .cse4 v_~y$w_buff0~0_82 (ite .cse3 v_~y$w_buff1~0_77 v_~y~0_142)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y~0=v_~y~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 03:10:34,105 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [482] L759-->L786: Formula: (let ((.cse0 (not (= (mod v_~weak$$choice2~0_286 256) 0))) (.cse1 (= (mod v_~y$w_buff0_used~0_671 256) 0))) (and (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_43| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|) (= v_~weak$$choice0~0_221 |v_P1Thread1of1ForFork1_#t~nondet3#1_46|) (= v_~y$flush_delayed~0_269 0) (= v_~y~0_620 v_~y$mem_tmp~0_254) (= v_~y~0_619 (ite .cse0 v_~y$mem_tmp~0_254 1)) (= v_~y$w_buff0~0_506 1) (= v_~y$w_buff0_used~0_671 (ite .cse0 1 0)) (= v_~y$w_buff1~0_461 v_~y$w_buff0~0_508) (= (ite .cse0 1 (ite .cse1 1 (ite (not .cse1) 0 1))) v_~y$r_buff0_thd2~0_332) (= v_~weak$$choice2~0_286 |v_P1Thread1of1ForFork1_#t~nondet4#1_50|) (= v_~y$r_buff0_thd0~0_393 v_~y$r_buff1_thd0~0_395) (= (ite (= (mod v_~y$w_buff0_used~0_673 256) 0) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_43| 0)) (= v_~y$r_buff1_thd2~0_295 (ite .cse0 v_~y$r_buff0_thd2~0_334 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_332 256) 0))) (or .cse1 (and .cse2 (= (mod v_~y$w_buff1_used~0_644 256) 0)) (and .cse2 (= 0 (mod v_~y$r_buff0_thd2~0_334 256))))) v_~y$r_buff0_thd2~0_334 0))) (= (ite .cse0 v_~y$w_buff0_used~0_673 (ite .cse1 v_~y$w_buff0_used~0_673 0)) v_~y$w_buff1_used~0_644) (= v_~y$r_buff0_thd1~0_93 v_~y$r_buff1_thd1~0_93) (= v_~__unbuffered_p1_EAX~0_166 1))) InVars {P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_50|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_673, ~y$w_buff0~0=v_~y$w_buff0~0_508, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_46|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_334, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_93, ~y~0=v_~y~0_620} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_671, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_43|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_295, ~weak$$choice0~0=v_~weak$$choice0~0_221, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_93, ~y$mem_tmp~0=v_~y$mem_tmp~0_254, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_166, ~y$w_buff1~0=v_~y$w_buff1~0_461, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_43|, ~y$w_buff0~0=v_~y$w_buff0~0_506, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_332, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_93, ~y$flush_delayed~0=v_~y$flush_delayed~0_269, ~y~0=v_~y~0_619, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_395, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_644} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [342] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_153 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd1~0_25 (ite .cse0 0 v_~y$r_buff0_thd1~0_26)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse2)) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff1_used~0_156 (ite (or .cse3 .cse0) 0 v_~y$w_buff1_used~0_157)) (= v_~y$w_buff0_used~0_153 (ite .cse4 0 v_~y$w_buff0_used~0_154)) (= v_~y~0_141 (ite .cse4 v_~y$w_buff0~0_82 (ite .cse3 v_~y$w_buff1~0_77 v_~y~0_142)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y~0=v_~y~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 03:10:34,864 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [349] L759-->L770: Formula: (and (= v_~y$r_buff0_thd0~0_In_1 v_~y$r_buff1_thd0~0_Out_2) (= v_~y$w_buff0_used~0_Out_2 1) (= v_~y$r_buff0_thd2~0_In_1 v_~y$r_buff1_thd2~0_Out_2) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3| (ite (not (and (not (= (mod v_~y$w_buff0_used~0_Out_2 256) 0)) (not (= (mod v_~y$w_buff1_used~0_Out_2 256) 0)))) 1 0)) (= v_~y$w_buff0_used~0_In_1 v_~y$w_buff1_used~0_Out_2) (= 1 v_~y$r_buff0_thd2~0_Out_2) (= v_~y$w_buff1~0_Out_2 v_~y$w_buff0~0_In_1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3| 0)) (= v_~y$w_buff0~0_Out_2 1) (= v_~y$r_buff1_thd1~0_Out_2 v_~y$r_buff0_thd1~0_In_1)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_In_1, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_In_1, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_In_1, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_Out_2, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_Out_2, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_3|, ~y$w_buff1~0=v_~y$w_buff1~0_Out_2, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_In_1, ~y$w_buff0~0=v_~y$w_buff0~0_Out_2, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_Out_2, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_In_1, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_Out_2, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_Out_2} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [342] L742-->L749: Formula: (let ((.cse2 (not (= (mod v_~y$r_buff1_thd1~0_24 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd1~0_26 256) 0))) (.cse1 (not (= (mod v_~y$w_buff0_used~0_153 256) 0)))) (let ((.cse0 (and .cse5 .cse1)) (.cse4 (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) .cse5)) (.cse3 (and (not (= (mod v_~y$w_buff1_used~0_157 256) 0)) .cse2))) (and (= v_~y$r_buff0_thd1~0_25 (ite .cse0 0 v_~y$r_buff0_thd1~0_26)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_25 256) 0)) .cse1) (and (not (= (mod v_~y$w_buff1_used~0_156 256) 0)) .cse2)) 0 v_~y$r_buff1_thd1~0_24) v_~y$r_buff1_thd1~0_23) (= v_~y$w_buff1_used~0_156 (ite (or .cse3 .cse0) 0 v_~y$w_buff1_used~0_157)) (= v_~y$w_buff0_used~0_153 (ite .cse4 0 v_~y$w_buff0_used~0_154)) (= v_~y~0_141 (ite .cse4 v_~y$w_buff0~0_82 (ite .cse3 v_~y$w_buff1~0_77 v_~y~0_142)))))) InVars {~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_26, ~y~0=v_~y~0_142, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_157} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_153, ~y$w_buff1~0=v_~y$w_buff1~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_82, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y~0=v_~y~0_141, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_156} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$r_buff0_thd1~0, ~y~0, ~y$w_buff1_used~0] [2022-12-13 03:10:35,035 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [485] L759-->L749: Formula: (let ((.cse4 (= (mod v_~y$w_buff0_used~0_691 256) 0)) (.cse3 (not (= (mod v_~y$w_buff0_used~0_689 256) 0))) (.cse2 (not (= (mod v_~y$r_buff0_thd1~0_104 256) 0)))) (let ((.cse0 (and .cse3 .cse2)) (.cse1 (and (not .cse4) .cse2))) (and (= v_~y$r_buff0_thd2~0_348 1) (= v_~y$r_buff0_thd1~0_103 (ite .cse0 0 v_~y$r_buff0_thd1~0_104)) (= v_~y$w_buff1_used~0_656 (ite (or .cse0 .cse1) 0 v_~y$w_buff0_used~0_691)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_49| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_49|) (= v_~y~0_635 (ite .cse2 v_~y$w_buff0~0_522 (ite .cse1 v_~y$w_buff1~0_471 v_~y~0_636))) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_49| 0)) (= v_~y$w_buff0~0_522 1) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_103 256) 0)) .cse3) (and (not (= (mod v_~y$w_buff1_used~0_656 256) 0)) .cse2)) 0 v_~y$r_buff0_thd1~0_104) v_~y$r_buff1_thd1~0_103) (= v_~y$w_buff1~0_471 v_~y$w_buff0~0_523) (= (ite .cse2 0 1) v_~y$w_buff0_used~0_689) (= v_~y$r_buff0_thd2~0_349 v_~y$r_buff1_thd2~0_305) (= v_~y$r_buff0_thd0~0_399 v_~y$r_buff1_thd0~0_401) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_49| (ite .cse4 1 0))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_691, ~y$w_buff0~0=v_~y$w_buff0~0_523, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_399, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_104, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_349, ~y~0=v_~y~0_636} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_689, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_49|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_305, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_103, ~y$w_buff1~0=v_~y$w_buff1~0_471, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_49|, ~y$w_buff0~0=v_~y$w_buff0~0_522, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_399, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_103, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_348, ~y~0=v_~y~0_635, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_401, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_656} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~y~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$w_buff1_used~0] and [350] L770-->L786: Formula: (let ((.cse4 (= (mod v_~y$r_buff1_thd2~0_92 256) 0)) (.cse7 (= (mod v_~y$r_buff0_thd2~0_99 256) 0))) (let ((.cse9 (not .cse7)) (.cse10 (and .cse7 (= (mod v_~y$w_buff1_used~0_173 256) 0))) (.cse8 (and .cse4 .cse7)) (.cse12 (= 0 (mod v_~y$w_buff0_used~0_174 256)))) (let ((.cse5 (or .cse10 .cse8 .cse12)) (.cse6 (and (not .cse12) .cse9))) (let ((.cse1 (= (mod v_~y$w_buff1_used~0_172 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_173 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_86 256) 0))) (.cse11 (ite .cse5 v_~y~0_156 (ite .cse6 v_~y$w_buff0~0_93 v_~y$w_buff1~0_84)))) (and (= |v_P1Thread1of1ForFork1_#t~nondet4#1_1| v_~weak$$choice2~0_86) (= (ite .cse0 v_~y$r_buff1_thd2~0_92 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_98 256) 0))) (or (and .cse1 .cse2) .cse3 (and .cse4 .cse2))) v_~y$r_buff1_thd2~0_92 0)) v_~y$r_buff1_thd2~0_91) (= (ite .cse0 v_~y$w_buff0_used~0_174 (ite .cse5 v_~y$w_buff0_used~0_174 (ite .cse6 0 v_~y$w_buff0_used~0_174))) v_~y$w_buff0_used~0_173) (= v_~y$r_buff0_thd2~0_98 (ite .cse0 v_~y$r_buff0_thd2~0_99 (ite (or .cse3 (and .cse1 .cse7) .cse8) v_~y$r_buff0_thd2~0_99 (ite (and (not .cse3) .cse9) 0 v_~y$r_buff0_thd2~0_99)))) (= |v_P1Thread1of1ForFork1_#t~nondet3#1_1| v_~weak$$choice0~0_19) (= (ite .cse0 v_~y$w_buff1_used~0_173 (ite (or .cse10 .cse3 .cse8) v_~y$w_buff1_used~0_173 0)) v_~y$w_buff1_used~0_172) (= v_~y$w_buff0~0_93 v_~y$w_buff0~0_92) (= v_~y~0_156 v_~y$mem_tmp~0_60) (= v_~y$w_buff1~0_84 v_~y$w_buff1~0_83) (= .cse11 v_~__unbuffered_p1_EAX~0_24) (= v_~y~0_155 (ite .cse0 v_~y$mem_tmp~0_60 .cse11)) (= 0 v_~y$flush_delayed~0_73)))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_92, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_174, ~y$w_buff1~0=v_~y$w_buff1~0_84, ~y$w_buff0~0=v_~y$w_buff0~0_93, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_1|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_99, ~y~0=v_~y~0_156, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_173} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_173, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_91, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~y$w_buff1~0=v_~y$w_buff1~0_83, ~y$w_buff0~0=v_~y$w_buff0~0_92, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_98, ~y$flush_delayed~0=v_~y$flush_delayed~0_73, ~y~0=v_~y~0_155, ~weak$$choice2~0=v_~weak$$choice2~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_172} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet3#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff1~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 03:10:35,295 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 03:10:35,296 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2671 [2022-12-13 03:10:35,296 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 710 flow [2022-12-13 03:10:35,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:35,296 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:10:35,297 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:10:35,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:10:35,297 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:10:35,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:10:35,297 INFO L85 PathProgramCache]: Analyzing trace with hash -267541032, now seen corresponding path program 1 times [2022-12-13 03:10:35,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:10:35,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453569696] [2022-12-13 03:10:35,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:10:35,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:10:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:10:35,866 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-13 03:10:35,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:10:35,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453569696] [2022-12-13 03:10:35,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453569696] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:10:35,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:10:35,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:10:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515447982] [2022-12-13 03:10:35,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:10:35,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:10:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:10:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:10:35,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:10:35,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2022-12-13 03:10:35,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:10:35,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:10:35,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2022-12-13 03:10:35,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:10:35,997 INFO L130 PetriNetUnfolder]: 24/96 cut-off events. [2022-12-13 03:10:35,997 INFO L131 PetriNetUnfolder]: For 578/578 co-relation queries the response was YES. [2022-12-13 03:10:35,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 96 events. 24/96 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 338 event pairs, 0 based on Foata normal form. 9/87 useless extension candidates. Maximal degree in co-relation 887. Up to 76 conditions per place. [2022-12-13 03:10:35,998 INFO L137 encePairwiseOnDemand]: 13/23 looper letters, 16 selfloop transitions, 3 changer transitions 27/49 dead transitions. [2022-12-13 03:10:35,998 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 996 flow [2022-12-13 03:10:35,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:10:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:10:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-12-13 03:10:35,999 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38405797101449274 [2022-12-13 03:10:36,000 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2022-12-13 03:10:36,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 49 transitions, 996 flow [2022-12-13 03:10:36,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 22 transitions, 448 flow [2022-12-13 03:10:36,001 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:10:36,001 INFO L89 Accepts]: Start accepts. Operand has 48 places, 22 transitions, 448 flow [2022-12-13 03:10:36,002 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:10:36,002 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:10:36,002 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 22 transitions, 448 flow [2022-12-13 03:10:36,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 22 transitions, 448 flow [2022-12-13 03:10:36,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:10:59,357 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [488] L759-->L752: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_707 256) 0))) (.cse0 (not (= (mod v_~y$r_buff0_thd1~0_112 256) 0))) (.cse2 (= (mod v_~y$w_buff0_used~0_708 256) 0))) (let ((.cse1 (and .cse0 (not .cse2))) (.cse3 (and .cse4 .cse0))) (and (= v_~__unbuffered_cnt~0_137 (+ v_~__unbuffered_cnt~0_138 1)) (= v_~y$w_buff1~0_483 v_~y$w_buff0~0_539) (= v_~y~0_651 (ite .cse0 v_~y$w_buff0~0_538 (ite .cse1 v_~y$w_buff1~0_483 v_~y~0_652))) (= v_~y$w_buff0~0_538 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_53| (ite .cse2 1 0)) (= v_~y$r_buff0_thd2~0_364 1) (= v_~y$r_buff0_thd2~0_365 v_~y$r_buff1_thd2~0_317) (= (ite .cse3 0 v_~y$r_buff0_thd1~0_112) v_~y$r_buff0_thd1~0_111) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_53| 0)) (= v_~y$r_buff0_thd0~0_403 v_~y$r_buff1_thd0~0_405) (= v_~y$w_buff0_used~0_707 (ite .cse0 0 1)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_53| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_53|) (= v_~y$w_buff1_used~0_670 (ite (or .cse1 .cse3) 0 v_~y$w_buff0_used~0_708)) (= v_~y$r_buff1_thd1~0_109 (ite (or (and .cse4 (not (= (mod v_~y$r_buff0_thd1~0_111 256) 0))) (and .cse0 (not (= (mod v_~y$w_buff1_used~0_670 256) 0)))) 0 v_~y$r_buff0_thd1~0_112))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_708, ~y$w_buff0~0=v_~y$w_buff0~0_539, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_403, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_112, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_365, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~y~0=v_~y~0_652} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_707, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_53|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_317, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ~y$w_buff1~0=v_~y$w_buff1~0_483, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_53|, ~y$w_buff0~0=v_~y$w_buff0~0_538, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_403, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_111, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_364, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~y~0=v_~y~0_651, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_405, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_670} AuxVars[] AssignedVars[~y$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [487] L770-->L802: Formula: (let ((.cse21 (= (mod v_~y$r_buff1_thd2~0_313 256) 0)) (.cse23 (= (mod v_~y$r_buff0_thd2~0_360 256) 0))) (let ((.cse25 (not .cse23)) (.cse24 (and .cse21 .cse23)) (.cse26 (and .cse23 (= (mod v_~y$w_buff1_used~0_666 256) 0))) (.cse27 (= (mod v_~y$w_buff0_used~0_703 256) 0))) (let ((.cse13 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_66| 256) 0))) (.cse17 (or .cse24 .cse26 .cse27)) (.cse18 (and .cse25 (not .cse27)))) (let ((.cse12 (ite .cse13 v_~y$w_buff0_used~0_703 (ite .cse17 v_~y$w_buff0_used~0_703 (ite .cse18 0 v_~y$w_buff0_used~0_703))))) (let ((.cse20 (= (mod .cse12 256) 0))) (let ((.cse7 (ite .cse13 v_~y$w_buff1_used~0_666 (ite (or .cse24 .cse26 .cse20) v_~y$w_buff1_used~0_666 0)))) (let ((.cse22 (= (mod .cse7 256) 0)) (.cse19 (not .cse20))) (let ((.cse14 (ite .cse13 v_~y$r_buff0_thd2~0_360 (ite (or (and .cse22 .cse23) .cse24 .cse20) v_~y$r_buff0_thd2~0_360 (ite (and .cse25 .cse19) 0 v_~y$r_buff0_thd2~0_360))))) (let ((.cse15 (= (mod .cse14 256) 0))) (let ((.cse8 (and .cse22 .cse15))) (let ((.cse1 (ite .cse13 v_~y$r_buff1_thd2~0_313 (ite (or .cse8 .cse20 (and .cse21 .cse15)) v_~y$r_buff1_thd2~0_313 0)))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse16 (not .cse15)) (.cse9 (and .cse15 .cse3))) (let ((.cse10 (or .cse8 .cse20 .cse9)) (.cse11 (and .cse16 .cse19)) (.cse6 (ite .cse17 v_~y~0_647 (ite .cse18 v_~y$w_buff0~0_534 v_~y$w_buff1~0_479))) (.cse0 (not (= (mod v_~weak$$choice2~0_296 256) 0))) (.cse5 (= (mod v_~y$w_buff1_used~0_664 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_701 256) 0))) (and (= v_~y~0_645 (ite .cse0 v_~y$mem_tmp~0_264 v_~__unbuffered_p1_EBX~0_162)) (= v_~y$w_buff0~0_534 v_~y$w_buff0~0_532) (= (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_358 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) .cse1 0)) v_~y$r_buff1_thd2~0_311) (= v_~__unbuffered_p1_EAX~0_174 .cse6) (= v_~y$w_buff1_used~0_664 (ite .cse0 .cse7 (ite (or .cse8 .cse4 .cse9) .cse7 0))) (= v_~y$flush_delayed~0_279 0) (= v_~__unbuffered_p1_EBX~0_162 (ite .cse10 v_~y$mem_tmp~0_264 (ite .cse11 v_~y$w_buff0~0_534 v_~y$w_buff1~0_479))) (= v_~y$w_buff1~0_479 v_~y$w_buff1~0_477) (= (ite .cse0 .cse12 (ite .cse10 .cse12 (ite .cse11 0 .cse12))) v_~y$w_buff0_used~0_701) (= v_~weak$$choice0~0_231 |v_P1Thread1of1ForFork1_#t~nondet5#1_50|) (= v_~weak$$choice2~0_296 |v_P1Thread1of1ForFork1_#t~nondet6#1_50|) (= v_~y$mem_tmp~0_264 (ite .cse13 v_~y~0_647 .cse6)) (= v_~y$r_buff0_thd2~0_358 (ite .cse0 .cse14 (ite (or .cse4 .cse9 (and .cse5 .cse15)) .cse14 (ite (and .cse16 (not .cse4)) 0 .cse14))))))))))))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_313, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_66|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_703, ~y$w_buff1~0=v_~y$w_buff1~0_479, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_50|, ~y$w_buff0~0=v_~y$w_buff0~0_534, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_360, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_50|, ~y~0=v_~y~0_647, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_666} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_162, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_701, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_311, ~weak$$choice0~0=v_~weak$$choice0~0_231, ~y$mem_tmp~0=v_~y$mem_tmp~0_264, ~y$w_buff1~0=v_~y$w_buff1~0_477, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_532, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_358, ~y$flush_delayed~0=v_~y$flush_delayed~0_279, ~y~0=v_~y~0_645, ~weak$$choice2~0=v_~weak$$choice2~0_296, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_664} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 03:10:59,956 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [489] L759-->P0EXIT: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_711 256) 0))) (.cse1 (not (= (mod v_~y$r_buff0_thd1~0_116 256) 0))) (.cse3 (= (mod v_~y$w_buff0_used~0_712 256) 0))) (let ((.cse2 (and .cse1 (not .cse3))) (.cse0 (and .cse1 .cse4))) (and (= v_~y$w_buff1~0_485 v_~y$w_buff0~0_543) (= (ite .cse0 0 v_~y$r_buff0_thd1~0_116) v_~y$r_buff0_thd1~0_115) (= v_~y$r_buff0_thd2~0_368 1) (= v_~y~0_655 (ite .cse1 v_~y$w_buff0~0_542 (ite .cse2 v_~y$w_buff1~0_485 v_~y~0_656))) (= v_~y$w_buff1_used~0_672 (ite (or .cse2 .cse0) 0 v_~y$w_buff0_used~0_712)) (= v_~y$r_buff0_thd0~0_405 v_~y$r_buff1_thd0~0_407) (= |v_P0Thread1of1ForFork0_#res.base_17| 0) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| 0)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_17|) (= (ite .cse3 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= v_~y$r_buff1_thd1~0_111 (ite (or (and .cse1 (not (= 0 (mod v_~y$w_buff1_used~0_672 256)))) (and (not (= (mod v_~y$r_buff0_thd1~0_115 256) 0)) .cse4)) 0 v_~y$r_buff0_thd1~0_116)) (= v_~y$r_buff0_thd2~0_369 v_~y$r_buff1_thd2~0_319) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|) (= (ite .cse1 0 1) v_~y$w_buff0_used~0_711) (= v_~y$w_buff0~0_542 1) (= v_~__unbuffered_cnt~0_141 (+ v_~__unbuffered_cnt~0_142 1))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_712, ~y$w_buff0~0=v_~y$w_buff0~0_543, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_405, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_116, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_369, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~y~0=v_~y~0_656} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_711, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_17|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_55|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_319, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_111, ~y$w_buff1~0=v_~y$w_buff1~0_485, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_55|, ~y$w_buff0~0=v_~y$w_buff0~0_542, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_405, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_115, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_368, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ~y~0=v_~y~0_655, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_407, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_672} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_#res.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [487] L770-->L802: Formula: (let ((.cse21 (= (mod v_~y$r_buff1_thd2~0_313 256) 0)) (.cse23 (= (mod v_~y$r_buff0_thd2~0_360 256) 0))) (let ((.cse25 (not .cse23)) (.cse24 (and .cse21 .cse23)) (.cse26 (and .cse23 (= (mod v_~y$w_buff1_used~0_666 256) 0))) (.cse27 (= (mod v_~y$w_buff0_used~0_703 256) 0))) (let ((.cse13 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_66| 256) 0))) (.cse17 (or .cse24 .cse26 .cse27)) (.cse18 (and .cse25 (not .cse27)))) (let ((.cse12 (ite .cse13 v_~y$w_buff0_used~0_703 (ite .cse17 v_~y$w_buff0_used~0_703 (ite .cse18 0 v_~y$w_buff0_used~0_703))))) (let ((.cse20 (= (mod .cse12 256) 0))) (let ((.cse7 (ite .cse13 v_~y$w_buff1_used~0_666 (ite (or .cse24 .cse26 .cse20) v_~y$w_buff1_used~0_666 0)))) (let ((.cse22 (= (mod .cse7 256) 0)) (.cse19 (not .cse20))) (let ((.cse14 (ite .cse13 v_~y$r_buff0_thd2~0_360 (ite (or (and .cse22 .cse23) .cse24 .cse20) v_~y$r_buff0_thd2~0_360 (ite (and .cse25 .cse19) 0 v_~y$r_buff0_thd2~0_360))))) (let ((.cse15 (= (mod .cse14 256) 0))) (let ((.cse8 (and .cse22 .cse15))) (let ((.cse1 (ite .cse13 v_~y$r_buff1_thd2~0_313 (ite (or .cse8 .cse20 (and .cse21 .cse15)) v_~y$r_buff1_thd2~0_313 0)))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse16 (not .cse15)) (.cse9 (and .cse15 .cse3))) (let ((.cse10 (or .cse8 .cse20 .cse9)) (.cse11 (and .cse16 .cse19)) (.cse6 (ite .cse17 v_~y~0_647 (ite .cse18 v_~y$w_buff0~0_534 v_~y$w_buff1~0_479))) (.cse0 (not (= (mod v_~weak$$choice2~0_296 256) 0))) (.cse5 (= (mod v_~y$w_buff1_used~0_664 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_701 256) 0))) (and (= v_~y~0_645 (ite .cse0 v_~y$mem_tmp~0_264 v_~__unbuffered_p1_EBX~0_162)) (= v_~y$w_buff0~0_534 v_~y$w_buff0~0_532) (= (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_358 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) .cse1 0)) v_~y$r_buff1_thd2~0_311) (= v_~__unbuffered_p1_EAX~0_174 .cse6) (= v_~y$w_buff1_used~0_664 (ite .cse0 .cse7 (ite (or .cse8 .cse4 .cse9) .cse7 0))) (= v_~y$flush_delayed~0_279 0) (= v_~__unbuffered_p1_EBX~0_162 (ite .cse10 v_~y$mem_tmp~0_264 (ite .cse11 v_~y$w_buff0~0_534 v_~y$w_buff1~0_479))) (= v_~y$w_buff1~0_479 v_~y$w_buff1~0_477) (= (ite .cse0 .cse12 (ite .cse10 .cse12 (ite .cse11 0 .cse12))) v_~y$w_buff0_used~0_701) (= v_~weak$$choice0~0_231 |v_P1Thread1of1ForFork1_#t~nondet5#1_50|) (= v_~weak$$choice2~0_296 |v_P1Thread1of1ForFork1_#t~nondet6#1_50|) (= v_~y$mem_tmp~0_264 (ite .cse13 v_~y~0_647 .cse6)) (= v_~y$r_buff0_thd2~0_358 (ite .cse0 .cse14 (ite (or .cse4 .cse9 (and .cse5 .cse15)) .cse14 (ite (and .cse16 (not .cse4)) 0 .cse14))))))))))))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_313, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_66|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_703, ~y$w_buff1~0=v_~y$w_buff1~0_479, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_50|, ~y$w_buff0~0=v_~y$w_buff0~0_534, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_360, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_50|, ~y~0=v_~y~0_647, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_666} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_162, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_701, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_311, ~weak$$choice0~0=v_~weak$$choice0~0_231, ~y$mem_tmp~0=v_~y$mem_tmp~0_264, ~y$w_buff1~0=v_~y$w_buff1~0_477, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_532, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_358, ~y$flush_delayed~0=v_~y$flush_delayed~0_279, ~y~0=v_~y~0_645, ~weak$$choice2~0=v_~weak$$choice2~0_296, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_664} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 03:11:00,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [490] L759-->P0FINAL: Formula: (let ((.cse0 (not (= (mod v_~y$w_buff0_used~0_715 256) 0))) (.cse4 (= 0 (mod v_~y$w_buff0_used~0_716 256))) (.cse1 (not (= (mod v_~y$r_buff0_thd1~0_120 256) 0)))) (let ((.cse2 (and (not .cse4) .cse1)) (.cse3 (and .cse1 .cse0))) (and (= 0 |v_P0Thread1of1ForFork0_#res.offset_19|) (= v_~y$r_buff0_thd2~0_373 v_~y$r_buff1_thd2~0_321) (= v_~y$r_buff1_thd1~0_113 (ite (or (and (not (= (mod v_~y$r_buff0_thd1~0_119 256) 0)) .cse0) (and (not (= (mod v_~y$w_buff1_used~0_674 256) 0)) .cse1)) 0 v_~y$r_buff0_thd1~0_120)) (= v_~y$w_buff0_used~0_715 (ite .cse1 0 1)) (= v_~__unbuffered_cnt~0_145 (+ v_~__unbuffered_cnt~0_146 1)) (= |v_P0Thread1of1ForFork0_#res.base_19| 0) (= v_~y~0_659 (ite .cse1 v_~y$w_buff0~0_546 (ite .cse2 v_~y$w_buff1~0_487 v_~y~0_660))) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| 0)) (= v_~y$r_buff0_thd2~0_372 1) (= v_~y$w_buff0~0_546 1) (= v_~y$w_buff1~0_487 v_~y$w_buff0~0_547) (= v_~y$w_buff1_used~0_674 (ite (or .cse2 .cse3) 0 v_~y$w_buff0_used~0_716)) (= v_~y$r_buff0_thd1~0_119 (ite .cse3 0 v_~y$r_buff0_thd1~0_120)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57| (ite .cse4 1 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|) (= v_~y$r_buff0_thd0~0_407 v_~y$r_buff1_thd0~0_409)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_716, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_407, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_120, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_373, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146, ~y~0=v_~y~0_660} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_19|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_715, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_19|, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_57|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_321, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_487, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_57|, ~y$w_buff0~0=v_~y$w_buff0~0_546, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_407, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_119, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_372, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_145, ~y~0=v_~y~0_659, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_409, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_674} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, ~y$w_buff0_used~0, P0Thread1of1ForFork0_#res.base, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] and [487] L770-->L802: Formula: (let ((.cse21 (= (mod v_~y$r_buff1_thd2~0_313 256) 0)) (.cse23 (= (mod v_~y$r_buff0_thd2~0_360 256) 0))) (let ((.cse25 (not .cse23)) (.cse24 (and .cse21 .cse23)) (.cse26 (and .cse23 (= (mod v_~y$w_buff1_used~0_666 256) 0))) (.cse27 (= (mod v_~y$w_buff0_used~0_703 256) 0))) (let ((.cse13 (not (= (mod |v_P1Thread1of1ForFork1_#t~nondet4#1_66| 256) 0))) (.cse17 (or .cse24 .cse26 .cse27)) (.cse18 (and .cse25 (not .cse27)))) (let ((.cse12 (ite .cse13 v_~y$w_buff0_used~0_703 (ite .cse17 v_~y$w_buff0_used~0_703 (ite .cse18 0 v_~y$w_buff0_used~0_703))))) (let ((.cse20 (= (mod .cse12 256) 0))) (let ((.cse7 (ite .cse13 v_~y$w_buff1_used~0_666 (ite (or .cse24 .cse26 .cse20) v_~y$w_buff1_used~0_666 0)))) (let ((.cse22 (= (mod .cse7 256) 0)) (.cse19 (not .cse20))) (let ((.cse14 (ite .cse13 v_~y$r_buff0_thd2~0_360 (ite (or (and .cse22 .cse23) .cse24 .cse20) v_~y$r_buff0_thd2~0_360 (ite (and .cse25 .cse19) 0 v_~y$r_buff0_thd2~0_360))))) (let ((.cse15 (= (mod .cse14 256) 0))) (let ((.cse8 (and .cse22 .cse15))) (let ((.cse1 (ite .cse13 v_~y$r_buff1_thd2~0_313 (ite (or .cse8 .cse20 (and .cse21 .cse15)) v_~y$r_buff1_thd2~0_313 0)))) (let ((.cse3 (= (mod .cse1 256) 0))) (let ((.cse16 (not .cse15)) (.cse9 (and .cse15 .cse3))) (let ((.cse10 (or .cse8 .cse20 .cse9)) (.cse11 (and .cse16 .cse19)) (.cse6 (ite .cse17 v_~y~0_647 (ite .cse18 v_~y$w_buff0~0_534 v_~y$w_buff1~0_479))) (.cse0 (not (= (mod v_~weak$$choice2~0_296 256) 0))) (.cse5 (= (mod v_~y$w_buff1_used~0_664 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_701 256) 0))) (and (= v_~y~0_645 (ite .cse0 v_~y$mem_tmp~0_264 v_~__unbuffered_p1_EBX~0_162)) (= v_~y$w_buff0~0_534 v_~y$w_buff0~0_532) (= (ite .cse0 .cse1 (ite (let ((.cse2 (= (mod v_~y$r_buff0_thd2~0_358 256) 0))) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))) .cse1 0)) v_~y$r_buff1_thd2~0_311) (= v_~__unbuffered_p1_EAX~0_174 .cse6) (= v_~y$w_buff1_used~0_664 (ite .cse0 .cse7 (ite (or .cse8 .cse4 .cse9) .cse7 0))) (= v_~y$flush_delayed~0_279 0) (= v_~__unbuffered_p1_EBX~0_162 (ite .cse10 v_~y$mem_tmp~0_264 (ite .cse11 v_~y$w_buff0~0_534 v_~y$w_buff1~0_479))) (= v_~y$w_buff1~0_479 v_~y$w_buff1~0_477) (= (ite .cse0 .cse12 (ite .cse10 .cse12 (ite .cse11 0 .cse12))) v_~y$w_buff0_used~0_701) (= v_~weak$$choice0~0_231 |v_P1Thread1of1ForFork1_#t~nondet5#1_50|) (= v_~weak$$choice2~0_296 |v_P1Thread1of1ForFork1_#t~nondet6#1_50|) (= v_~y$mem_tmp~0_264 (ite .cse13 v_~y~0_647 .cse6)) (= v_~y$r_buff0_thd2~0_358 (ite .cse0 .cse14 (ite (or .cse4 .cse9 (and .cse5 .cse15)) .cse14 (ite (and .cse16 (not .cse4)) 0 .cse14))))))))))))))))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_313, P1Thread1of1ForFork1_#t~nondet4#1=|v_P1Thread1of1ForFork1_#t~nondet4#1_66|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_703, ~y$w_buff1~0=v_~y$w_buff1~0_479, P1Thread1of1ForFork1_#t~nondet5#1=|v_P1Thread1of1ForFork1_#t~nondet5#1_50|, ~y$w_buff0~0=v_~y$w_buff0~0_534, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_360, P1Thread1of1ForFork1_#t~nondet6#1=|v_P1Thread1of1ForFork1_#t~nondet6#1_50|, ~y~0=v_~y~0_647, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_666} OutVars{~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_162, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_701, P1Thread1of1ForFork1_#t~nondet3#1=|v_P1Thread1of1ForFork1_#t~nondet3#1_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_311, ~weak$$choice0~0=v_~weak$$choice0~0_231, ~y$mem_tmp~0=v_~y$mem_tmp~0_264, ~y$w_buff1~0=v_~y$w_buff1~0_477, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_174, ~y$w_buff0~0=v_~y$w_buff0~0_532, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_358, ~y$flush_delayed~0=v_~y$flush_delayed~0_279, ~y~0=v_~y~0_645, ~weak$$choice2~0=v_~weak$$choice2~0_296, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_664} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~y$w_buff0_used~0, P1Thread1of1ForFork1_#t~nondet5#1, P1Thread1of1ForFork1_#t~nondet3#1, P1Thread1of1ForFork1_#t~nondet6#1, ~y$r_buff1_thd2~0, ~weak$$choice0~0, P1Thread1of1ForFork1_#t~nondet4#1, ~y$mem_tmp~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$w_buff1_used~0] [2022-12-13 03:11:03,482 INFO L241 LiptonReduction]: Total number of compositions: 5 [2022-12-13 03:11:03,483 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27482 [2022-12-13 03:11:03,483 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 17 transitions, 374 flow [2022-12-13 03:11:03,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:11:03,483 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:03,483 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:03,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:11:03,483 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-13 03:11:03,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:03,484 INFO L85 PathProgramCache]: Analyzing trace with hash -9648713, now seen corresponding path program 1 times [2022-12-13 03:11:03,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:03,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481674623] [2022-12-13 03:11:03,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:03,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:04,347 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-13 03:11:04,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:04,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481674623] [2022-12-13 03:11:04,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481674623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:04,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:04,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:11:04,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366893585] [2022-12-13 03:11:04,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:04,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:11:04,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:04,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:11:04,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:11:04,349 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 13 [2022-12-13 03:11:04,349 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 17 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-13 03:11:04,349 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:04,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 13 [2022-12-13 03:11:04,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:04,422 INFO L130 PetriNetUnfolder]: 4/26 cut-off events. [2022-12-13 03:11:04,422 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2022-12-13 03:11:04,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 26 events. 4/26 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 56 event pairs, 0 based on Foata normal form. 9/27 useless extension candidates. Maximal degree in co-relation 267. Up to 23 conditions per place. [2022-12-13 03:11:04,422 INFO L137 encePairwiseOnDemand]: 4/13 looper letters, 0 selfloop transitions, 0 changer transitions 16/16 dead transitions. [2022-12-13 03:11:04,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 16 transitions, 382 flow [2022-12-13 03:11:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:11:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:11:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-12-13 03:11:04,423 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2923076923076923 [2022-12-13 03:11:04,424 INFO L295 CegarLoopForPetriNet]: 53 programPoint places, -8 predicate places. [2022-12-13 03:11:04,424 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 16 transitions, 382 flow [2022-12-13 03:11:04,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 0 places, 0 transitions, 0 flow [2022-12-13 03:11:04,424 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:04,424 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:11:04,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 03:11:04,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 03:11:04,425 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:04,425 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-13 03:11:04,425 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 03:11:04,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-13 03:11:04,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-13 03:11:04,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-12-13 03:11:04,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-13 03:11:04,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-13 03:11:04,427 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-12-13 03:11:04,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:11:04,428 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:04,431 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:11:04,431 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:11:04,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:11:04 BasicIcfg [2022-12-13 03:11:04,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:11:04,433 INFO L158 Benchmark]: Toolchain (without parser) took 48401.43ms. Allocated memory was 226.5MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 201.5MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-13 03:11:04,433 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 226.5MB. Free memory is still 202.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:11:04,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.14ms. Allocated memory is still 226.5MB. Free memory was 201.3MB in the beginning and 173.5MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-13 03:11:04,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.10ms. Allocated memory is still 226.5MB. Free memory was 173.5MB in the beginning and 170.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 03:11:04,433 INFO L158 Benchmark]: Boogie Preprocessor took 44.36ms. Allocated memory is still 226.5MB. Free memory was 170.3MB in the beginning and 167.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:11:04,433 INFO L158 Benchmark]: RCFGBuilder took 580.07ms. Allocated memory is still 226.5MB. Free memory was 167.7MB in the beginning and 122.1MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-12-13 03:11:04,434 INFO L158 Benchmark]: TraceAbstraction took 47168.29ms. Allocated memory was 226.5MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 121.0MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-12-13 03:11:04,434 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 226.5MB. Free memory is still 202.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 534.14ms. Allocated memory is still 226.5MB. Free memory was 201.3MB in the beginning and 173.5MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.10ms. Allocated memory is still 226.5MB. Free memory was 173.5MB in the beginning and 170.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.36ms. Allocated memory is still 226.5MB. Free memory was 170.3MB in the beginning and 167.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 580.07ms. Allocated memory is still 226.5MB. Free memory was 167.7MB in the beginning and 122.1MB in the end (delta: 45.6MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 47168.29ms. Allocated memory was 226.5MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 121.0MB in the beginning and 5.8GB in the end (delta: -5.6GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 93 PlacesBefore, 53 PlacesAfterwards, 88 TransitionsBefore, 46 TransitionsAfterwards, 1156 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 35 TrivialYvCompositions, 32 ConcurrentYvCompositions, 2 ChoiceCompositions, 71 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2038, independent: 1886, independent conditional: 1886, independent unconditional: 0, dependent: 152, dependent conditional: 152, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2038, independent: 1886, independent conditional: 0, independent unconditional: 1886, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2038, independent: 1886, independent conditional: 0, independent unconditional: 1886, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2038, independent: 1886, independent conditional: 0, independent unconditional: 1886, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1107, independent: 1052, independent conditional: 0, independent unconditional: 1052, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1107, independent: 1032, independent conditional: 0, independent unconditional: 1032, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 503, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 485, dependent conditional: 0, dependent unconditional: 485, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2038, independent: 834, independent conditional: 0, independent unconditional: 834, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 1107, unknown conditional: 0, unknown unconditional: 1107] , Statistics on independence cache: Total cache size (in pairs): 2011, Positive cache size: 1956, Positive conditional cache size: 0, Positive unconditional cache size: 1956, Negative cache size: 55, Negative conditional cache size: 0, Negative unconditional cache size: 55, 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.0s, 33 PlacesBefore, 33 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 170 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 6, independent unconditional: 15, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 16, independent: 14, independent conditional: 0, independent unconditional: 14, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 16, Positive cache size: 14, Positive conditional cache size: 0, Positive unconditional cache size: 14, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 35 PlacesBefore, 35 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 62, independent conditional: 62, 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: 72, independent: 62, independent conditional: 28, independent unconditional: 34, dependent: 10, dependent conditional: 8, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 80, independent: 62, independent conditional: 8, independent unconditional: 54, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 80, independent: 62, independent conditional: 8, independent unconditional: 54, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 11, independent conditional: 2, independent unconditional: 9, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18, independent: 14, independent conditional: 7, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, independent: 51, independent conditional: 6, independent unconditional: 45, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 12, unknown conditional: 2, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 25, Positive conditional cache size: 2, Positive unconditional cache size: 23, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 36, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 37 PlacesBefore, 37 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 39, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 46, independent: 39, independent conditional: 14, independent unconditional: 25, dependent: 7, dependent conditional: 4, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 54, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 25, Positive conditional cache size: 2, Positive unconditional cache size: 23, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 88, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 88, independent: 80, independent conditional: 40, independent unconditional: 40, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 104, independent: 80, independent conditional: 0, independent unconditional: 80, 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: 104, independent: 80, independent conditional: 0, independent unconditional: 80, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 104, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 31, Positive conditional cache size: 2, Positive unconditional cache size: 29, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 64, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 43 PlacesBefore, 42 PlacesAfterwards, 66 TransitionsBefore, 65 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 104, independent conditional: 104, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 104, independent conditional: 84, independent unconditional: 20, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 184, independent: 104, independent conditional: 20, independent unconditional: 84, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 184, independent: 104, independent conditional: 20, independent unconditional: 84, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 184, independent: 102, independent conditional: 20, independent unconditional: 82, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 33, Positive conditional cache size: 2, Positive unconditional cache size: 31, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 144, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 46 PlacesBefore, 43 PlacesAfterwards, 63 TransitionsBefore, 61 TransitionsAfterwards, 116 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 100, independent: 84, independent conditional: 84, 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: 100, independent: 84, independent conditional: 68, independent unconditional: 16, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 148, independent: 84, independent conditional: 16, independent unconditional: 68, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 148, independent: 84, independent conditional: 16, independent unconditional: 68, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 148, independent: 82, independent conditional: 16, independent unconditional: 66, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 39, Positive cache size: 35, Positive conditional cache size: 2, Positive unconditional cache size: 33, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 116, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 45 PlacesBefore, 44 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 108 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 144, independent conditional: 144, 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: 160, independent: 144, independent conditional: 128, independent unconditional: 16, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 224, independent: 144, independent conditional: 32, independent unconditional: 112, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 224, independent: 144, independent conditional: 32, independent unconditional: 112, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 224, independent: 140, independent conditional: 32, independent unconditional: 108, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 40, Positive conditional cache size: 2, Positive unconditional cache size: 38, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 176, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 44 PlacesBefore, 44 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 40, Positive conditional cache size: 2, Positive unconditional cache size: 38, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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: 2.7s, 49 PlacesBefore, 47 PlacesAfterwards, 41 TransitionsBefore, 39 TransitionsAfterwards, 62 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 45, Positive conditional cache size: 2, Positive unconditional cache size: 43, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.5s, 48 PlacesBefore, 42 PlacesAfterwards, 22 TransitionsBefore, 17 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 53, Positive conditional cache size: 2, Positive unconditional cache size: 51, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, 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.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , 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: 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] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 53, Positive conditional cache size: 2, Positive unconditional cache size: 51, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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: 47.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 676 IncrementalHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 1 mSDtfsCounter, 676 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=837occurred in iteration=8, InterpolantAutomatonStates: 49, 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.3s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 1164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 03:11:04,470 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...