/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/rfi006_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:11:19,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:11:19,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:11:19,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:11:19,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:11:19,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:11:19,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:11:19,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:11:19,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:11:19,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:11:19,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:11:19,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:11:19,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:11:19,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:11:19,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:11:19,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:11:19,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:11:19,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:11:19,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:11:19,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:11:19,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:11:19,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:11:19,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:11:19,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:11:19,451 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:11:19,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:11:19,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:11:19,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:11:19,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:11:19,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:11:19,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:11:19,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:11:19,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:11:19,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:11:19,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:11:19,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:11:19,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:11:19,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:11:19,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:11:19,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:11:19,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:11:19,468 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:11:19,522 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:11:19,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:11:19,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:11:19,524 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:11:19,524 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:11:19,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:11:19,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:11:19,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:11:19,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:11:19,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:11:19,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:11:19,525 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:11:19,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:11:19,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:11:19,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:11:19,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:11:19,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:11:19,526 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:11:19,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:11:19,526 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:11:19,526 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:11:19,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:11:19,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:11:19,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:11:19,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:11:19,935 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:11:19,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i [2022-12-13 03:11:21,035 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:11:21,320 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:11:21,321 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi006_rmo.i [2022-12-13 03:11:21,330 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d70a5f9f7/75e0fdf390394e7a929165cf579de504/FLAGeb278cd48 [2022-12-13 03:11:21,340 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d70a5f9f7/75e0fdf390394e7a929165cf579de504 [2022-12-13 03:11:21,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:11:21,343 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:11:21,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:11:21,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:11:21,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:11:21,347 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32329fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21, skipping insertion in model container [2022-12-13 03:11:21,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:11:21,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:11:21,493 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/rfi006_rmo.i[987,1000] [2022-12-13 03:11:21,626 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,644 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,648 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,673 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:11:21,687 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:11:21,695 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/rfi006_rmo.i[987,1000] [2022-12-13 03:11:21,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,741 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,742 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,743 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,744 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,746 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:11:21,747 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:11:21,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:11:21,781 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:11:21,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21 WrapperNode [2022-12-13 03:11:21,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:11:21,782 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:11:21,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:11:21,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:11:21,787 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:11:21" (1/1) ... [2022-12-13 03:11:21,809 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:11:21" (1/1) ... [2022-12-13 03:11:21,828 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-13 03:11:21,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:11:21,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:11:21,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:11:21,829 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:11:21,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,849 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,856 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,859 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:11:21,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:11:21,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:11:21,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:11:21,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (1/1) ... [2022-12-13 03:11:21,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:11:21,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:11:21,917 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:11:21,925 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:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 03:11:21,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 03:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 03:11:21,947 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 03:11:21,947 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 03:11:21,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 03:11:21,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:11:21,948 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:11:21,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:11:21,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:11:21,949 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:11:22,106 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:11:22,107 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:11:22,516 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:11:22,755 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:11:22,755 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:11:22,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:11:22 BoogieIcfgContainer [2022-12-13 03:11:22,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:11:22,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:11:22,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:11:22,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:11:22,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:11:21" (1/3) ... [2022-12-13 03:11:22,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6574587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:11:22, skipping insertion in model container [2022-12-13 03:11:22,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:11:21" (2/3) ... [2022-12-13 03:11:22,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6574587a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:11:22, skipping insertion in model container [2022-12-13 03:11:22,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:11:22" (3/3) ... [2022-12-13 03:11:22,770 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi006_rmo.i [2022-12-13 03:11:22,787 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:11:22,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 03:11:22,788 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:11:22,859 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 03:11:22,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 03:11:22,970 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-12-13 03:11:22,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:11:22,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2022-12-13 03:11:22,977 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-12-13 03:11:22,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2022-12-13 03:11:22,983 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:23,008 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 03:11:23,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2022-12-13 03:11:23,058 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2022-12-13 03:11:23,059 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:11:23,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 41 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2022-12-13 03:11:23,063 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2022-12-13 03:11:23,063 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 03:11:29,126 INFO L241 LiptonReduction]: Total number of compositions: 91 [2022-12-13 03:11:29,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:11:29,140 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;@b8d3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:11:29,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 03:11:29,144 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-13 03:11:29,144 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:11:29,144 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:29,145 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:29,145 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:29,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -758409905, now seen corresponding path program 1 times [2022-12-13 03:11:29,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:29,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16700963] [2022-12-13 03:11:29,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:29,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:29,320 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:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:29,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16700963] [2022-12-13 03:11:29,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16700963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:29,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:29,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:11:29,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151265076] [2022-12-13 03:11:29,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:29,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 03:11:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:29,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 03:11:29,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 03:11:29,341 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 03:11:29,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:29,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:29,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 03:11:29,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:29,611 INFO L130 PetriNetUnfolder]: 909/1429 cut-off events. [2022-12-13 03:11:29,612 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 03:11:29,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 1429 events. 909/1429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7079 event pairs, 909 based on Foata normal form. 0/1144 useless extension candidates. Maximal degree in co-relation 2831. Up to 1359 conditions per place. [2022-12-13 03:11:29,624 INFO L137 encePairwiseOnDemand]: 28/29 looper letters, 20 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2022-12-13 03:11:29,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 03:11:29,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 03:11:29,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 37 transitions. [2022-12-13 03:11:29,632 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6379310344827587 [2022-12-13 03:11:29,635 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 1 predicate places. [2022-12-13 03:11:29,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:29,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:29,647 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:29,647 INFO L89 Accepts]: Start accepts. Operand has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:29,649 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:29,649 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:29,650 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:29,658 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:29,658 INFO L226 LiptonReduction]: Number of co-enabled transitions 244 [2022-12-13 03:11:29,673 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:29,676 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 03:11:29,676 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 105 flow [2022-12-13 03:11:29,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:29,676 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:29,676 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:29,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:11:29,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:29,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:29,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1312521108, now seen corresponding path program 1 times [2022-12-13 03:11:29,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:29,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351193606] [2022-12-13 03:11:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:29,956 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:29,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:29,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351193606] [2022-12-13 03:11:29,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351193606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:29,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:29,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:11:29,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685491922] [2022-12-13 03:11:29,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:29,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:11:29,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:11:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:11:29,958 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 28 [2022-12-13 03:11:29,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 105 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:29,959 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:29,959 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 28 [2022-12-13 03:11:29,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:30,213 INFO L130 PetriNetUnfolder]: 1389/2165 cut-off events. [2022-12-13 03:11:30,214 INFO L131 PetriNetUnfolder]: For 247/247 co-relation queries the response was YES. [2022-12-13 03:11:30,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 2165 events. 1389/2165 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10865 event pairs, 379 based on Foata normal form. 10/1813 useless extension candidates. Maximal degree in co-relation 6090. Up to 1978 conditions per place. [2022-12-13 03:11:30,226 INFO L137 encePairwiseOnDemand]: 24/28 looper letters, 32 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2022-12-13 03:11:30,226 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 231 flow [2022-12-13 03:11:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:11:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:11:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-13 03:11:30,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2022-12-13 03:11:30,228 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2022-12-13 03:11:30,228 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 231 flow [2022-12-13 03:11:30,235 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 41 transitions, 231 flow [2022-12-13 03:11:30,243 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:30,243 INFO L89 Accepts]: Start accepts. Operand has 41 places, 41 transitions, 231 flow [2022-12-13 03:11:30,244 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:30,244 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:30,244 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 41 transitions, 231 flow [2022-12-13 03:11:30,246 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 41 transitions, 231 flow [2022-12-13 03:11:30,246 INFO L226 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-13 03:11:30,937 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:11:30,938 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 695 [2022-12-13 03:11:30,938 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 231 flow [2022-12-13 03:11:30,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:30,939 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:30,939 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:30,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:11:30,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:30,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:30,939 INFO L85 PathProgramCache]: Analyzing trace with hash 2033446968, now seen corresponding path program 1 times [2022-12-13 03:11:30,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:30,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434198739] [2022-12-13 03:11:30,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:30,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:31,113 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:31,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:31,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434198739] [2022-12-13 03:11:31,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434198739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:31,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:31,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:11:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752924711] [2022-12-13 03:11:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:31,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:11:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:11:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:11:31,118 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2022-12-13 03:11:31,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 41 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:31,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:31,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2022-12-13 03:11:31,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:31,387 INFO L130 PetriNetUnfolder]: 1247/1983 cut-off events. [2022-12-13 03:11:31,387 INFO L131 PetriNetUnfolder]: For 358/358 co-relation queries the response was YES. [2022-12-13 03:11:31,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7333 conditions, 1983 events. 1247/1983 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 10029 event pairs, 143 based on Foata normal form. 80/1719 useless extension candidates. Maximal degree in co-relation 7316. Up to 1796 conditions per place. [2022-12-13 03:11:31,399 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 41 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2022-12-13 03:11:31,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 380 flow [2022-12-13 03:11:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:11:31,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:11:31,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-13 03:11:31,401 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2022-12-13 03:11:31,402 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2022-12-13 03:11:31,404 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 51 transitions, 380 flow [2022-12-13 03:11:31,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 51 transitions, 380 flow [2022-12-13 03:11:31,428 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:31,428 INFO L89 Accepts]: Start accepts. Operand has 43 places, 51 transitions, 380 flow [2022-12-13 03:11:31,429 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:31,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:31,429 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 51 transitions, 380 flow [2022-12-13 03:11:31,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 51 transitions, 380 flow [2022-12-13 03:11:31,431 INFO L226 LiptonReduction]: Number of co-enabled transitions 280 [2022-12-13 03:11:31,433 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:31,434 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 03:11:31,434 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 51 transitions, 380 flow [2022-12-13 03:11:31,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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:31,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:31,434 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:31,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:11:31,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1387656140, now seen corresponding path program 1 times [2022-12-13 03:11:31,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:31,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048588597] [2022-12-13 03:11:31,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:31,617 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:31,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:31,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048588597] [2022-12-13 03:11:31,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048588597] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:31,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:31,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:11:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018579876] [2022-12-13 03:11:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:31,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:11:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:31,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:11:31,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:11:31,619 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 03:11:31,619 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 51 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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:31,619 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:31,619 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 03:11:31,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:31,844 INFO L130 PetriNetUnfolder]: 1176/1886 cut-off events. [2022-12-13 03:11:31,845 INFO L131 PetriNetUnfolder]: For 893/893 co-relation queries the response was YES. [2022-12-13 03:11:31,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8532 conditions, 1886 events. 1176/1886 cut-off events. For 893/893 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9671 event pairs, 102 based on Foata normal form. 40/1591 useless extension candidates. Maximal degree in co-relation 8512. Up to 1705 conditions per place. [2022-12-13 03:11:31,858 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 66 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2022-12-13 03:11:31,858 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 79 transitions, 756 flow [2022-12-13 03:11:31,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:11:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:11:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-13 03:11:31,860 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7011494252873564 [2022-12-13 03:11:31,861 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2022-12-13 03:11:31,861 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 79 transitions, 756 flow [2022-12-13 03:11:31,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 79 transitions, 756 flow [2022-12-13 03:11:31,881 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:31,881 INFO L89 Accepts]: Start accepts. Operand has 45 places, 79 transitions, 756 flow [2022-12-13 03:11:31,883 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:31,883 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:31,883 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 79 transitions, 756 flow [2022-12-13 03:11:31,885 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 79 transitions, 756 flow [2022-12-13 03:11:31,886 INFO L226 LiptonReduction]: Number of co-enabled transitions 338 [2022-12-13 03:11:31,889 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:31,892 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:11:31,892 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 79 transitions, 756 flow [2022-12-13 03:11:31,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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:31,892 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:31,892 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:31,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:11:31,893 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:31,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash -67222262, now seen corresponding path program 1 times [2022-12-13 03:11:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:31,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243967496] [2022-12-13 03:11:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:32,820 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:32,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:32,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243967496] [2022-12-13 03:11:32,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243967496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:32,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:32,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:11:32,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989549237] [2022-12-13 03:11:32,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:32,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:11:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:32,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:11:32,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:11:32,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2022-12-13 03:11:32,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 79 transitions, 756 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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:32,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:32,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2022-12-13 03:11:32,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:33,250 INFO L130 PetriNetUnfolder]: 1297/2094 cut-off events. [2022-12-13 03:11:33,250 INFO L131 PetriNetUnfolder]: For 2166/2166 co-relation queries the response was YES. [2022-12-13 03:11:33,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11142 conditions, 2094 events. 1297/2094 cut-off events. For 2166/2166 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 10516 event pairs, 222 based on Foata normal form. 8/1751 useless extension candidates. Maximal degree in co-relation 11119. Up to 1882 conditions per place. [2022-12-13 03:11:33,267 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 99 selfloop transitions, 21 changer transitions 0/129 dead transitions. [2022-12-13 03:11:33,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 129 transitions, 1517 flow [2022-12-13 03:11:33,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 03:11:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 03:11:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-12-13 03:11:33,271 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2022-12-13 03:11:33,274 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2022-12-13 03:11:33,274 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 129 transitions, 1517 flow [2022-12-13 03:11:33,288 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 129 transitions, 1517 flow [2022-12-13 03:11:33,306 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:33,306 INFO L89 Accepts]: Start accepts. Operand has 48 places, 129 transitions, 1517 flow [2022-12-13 03:11:33,307 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:33,307 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:33,308 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 129 transitions, 1517 flow [2022-12-13 03:11:33,313 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 129 transitions, 1517 flow [2022-12-13 03:11:33,313 INFO L226 LiptonReduction]: Number of co-enabled transitions 470 [2022-12-13 03:11:33,385 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:11:33,387 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 81 [2022-12-13 03:11:33,388 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 129 transitions, 1517 flow [2022-12-13 03:11:33,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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:33,388 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:33,388 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:33,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:11:33,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1253894326, now seen corresponding path program 1 times [2022-12-13 03:11:33,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:33,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596553570] [2022-12-13 03:11:33,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:33,568 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:33,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:33,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596553570] [2022-12-13 03:11:33,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596553570] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:33,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:33,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:11:33,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200004409] [2022-12-13 03:11:33,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:33,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 03:11:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:33,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 03:11:33,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 03:11:33,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2022-12-13 03:11:33,571 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 129 transitions, 1517 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:33,571 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:33,571 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2022-12-13 03:11:33,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:33,993 INFO L130 PetriNetUnfolder]: 1962/3103 cut-off events. [2022-12-13 03:11:33,993 INFO L131 PetriNetUnfolder]: For 7287/7300 co-relation queries the response was YES. [2022-12-13 03:11:33,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18244 conditions, 3103 events. 1962/3103 cut-off events. For 7287/7300 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 16734 event pairs, 256 based on Foata normal form. 169/2799 useless extension candidates. Maximal degree in co-relation 18218. Up to 2558 conditions per place. [2022-12-13 03:11:34,008 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 135 selfloop transitions, 32 changer transitions 120/293 dead transitions. [2022-12-13 03:11:34,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 293 transitions, 3993 flow [2022-12-13 03:11:34,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:11:34,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:11:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-13 03:11:34,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7 [2022-12-13 03:11:34,010 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2022-12-13 03:11:34,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 293 transitions, 3993 flow [2022-12-13 03:11:34,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 173 transitions, 2373 flow [2022-12-13 03:11:34,039 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:34,040 INFO L89 Accepts]: Start accepts. Operand has 50 places, 173 transitions, 2373 flow [2022-12-13 03:11:34,041 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:34,041 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:34,041 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 173 transitions, 2373 flow [2022-12-13 03:11:34,046 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 173 transitions, 2373 flow [2022-12-13 03:11:34,046 INFO L226 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-13 03:11:34,085 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:11:34,086 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-13 03:11:34,086 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 173 transitions, 2373 flow [2022-12-13 03:11:34,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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:34,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:34,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:34,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:11:34,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:34,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash -320576181, now seen corresponding path program 1 times [2022-12-13 03:11:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:34,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926831681] [2022-12-13 03:11:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:34,211 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:34,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:34,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926831681] [2022-12-13 03:11:34,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926831681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:34,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:34,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:11:34,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136773001] [2022-12-13 03:11:34,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:34,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:11:34,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:34,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:11:34,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:11:34,215 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2022-12-13 03:11:34,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 173 transitions, 2373 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:34,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:34,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2022-12-13 03:11:34,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:34,542 INFO L130 PetriNetUnfolder]: 1222/2062 cut-off events. [2022-12-13 03:11:34,542 INFO L131 PetriNetUnfolder]: For 5011/5043 co-relation queries the response was YES. [2022-12-13 03:11:34,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14088 conditions, 2062 events. 1222/2062 cut-off events. For 5011/5043 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 11109 event pairs, 54 based on Foata normal form. 176/1939 useless extension candidates. Maximal degree in co-relation 14059. Up to 1727 conditions per place. [2022-12-13 03:11:34,552 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 123 selfloop transitions, 49 changer transitions 62/240 dead transitions. [2022-12-13 03:11:34,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 240 transitions, 3692 flow [2022-12-13 03:11:34,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 03:11:34,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 03:11:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2022-12-13 03:11:34,553 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6323529411764706 [2022-12-13 03:11:34,554 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2022-12-13 03:11:34,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 240 transitions, 3692 flow [2022-12-13 03:11:34,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 178 transitions, 2760 flow [2022-12-13 03:11:34,571 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:34,571 INFO L89 Accepts]: Start accepts. Operand has 52 places, 178 transitions, 2760 flow [2022-12-13 03:11:34,572 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:34,572 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:34,572 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 178 transitions, 2760 flow [2022-12-13 03:11:34,577 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 178 transitions, 2760 flow [2022-12-13 03:11:34,577 INFO L226 LiptonReduction]: Number of co-enabled transitions 302 [2022-12-13 03:11:34,578 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:34,579 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 03:11:34,579 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 178 transitions, 2760 flow [2022-12-13 03:11:34,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:34,579 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:34,579 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:34,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 03:11:34,579 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:34,579 INFO L85 PathProgramCache]: Analyzing trace with hash -101519337, now seen corresponding path program 1 times [2022-12-13 03:11:34,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:34,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144250678] [2022-12-13 03:11:34,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:34,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:35,369 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:35,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:35,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144250678] [2022-12-13 03:11:35,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144250678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:35,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:35,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 03:11:35,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121881433] [2022-12-13 03:11:35,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:35,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 03:11:35,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:35,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 03:11:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 03:11:35,370 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 03:11:35,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 178 transitions, 2760 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:35,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:35,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 03:11:35,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:35,847 INFO L130 PetriNetUnfolder]: 1770/3089 cut-off events. [2022-12-13 03:11:35,847 INFO L131 PetriNetUnfolder]: For 9083/9091 co-relation queries the response was YES. [2022-12-13 03:11:35,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23276 conditions, 3089 events. 1770/3089 cut-off events. For 9083/9091 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19039 event pairs, 163 based on Foata normal form. 81/2646 useless extension candidates. Maximal degree in co-relation 23244. Up to 2658 conditions per place. [2022-12-13 03:11:35,865 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 190 selfloop transitions, 50 changer transitions 8/263 dead transitions. [2022-12-13 03:11:35,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 263 transitions, 4634 flow [2022-12-13 03:11:35,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 03:11:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 03:11:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 03:11:35,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5875 [2022-12-13 03:11:35,867 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2022-12-13 03:11:35,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 263 transitions, 4634 flow [2022-12-13 03:11:35,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 255 transitions, 4490 flow [2022-12-13 03:11:35,897 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:35,897 INFO L89 Accepts]: Start accepts. Operand has 56 places, 255 transitions, 4490 flow [2022-12-13 03:11:35,898 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:35,898 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:35,898 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 255 transitions, 4490 flow [2022-12-13 03:11:35,905 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 255 transitions, 4490 flow [2022-12-13 03:11:35,905 INFO L226 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-13 03:11:35,907 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:35,907 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 10 [2022-12-13 03:11:35,907 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 255 transitions, 4490 flow [2022-12-13 03:11:35,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:35,908 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:35,908 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:35,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 03:11:35,908 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:35,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1267270231, now seen corresponding path program 1 times [2022-12-13 03:11:35,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:35,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299289107] [2022-12-13 03:11:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:36,936 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:36,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:36,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299289107] [2022-12-13 03:11:36,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299289107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:36,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:36,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 03:11:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753786046] [2022-12-13 03:11:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:36,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 03:11:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 03:11:36,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 03:11:36,939 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 03:11:36,939 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 255 transitions, 4490 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:36,939 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:36,939 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 03:11:36,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:37,754 INFO L130 PetriNetUnfolder]: 1990/3529 cut-off events. [2022-12-13 03:11:37,754 INFO L131 PetriNetUnfolder]: For 13697/13705 co-relation queries the response was YES. [2022-12-13 03:11:37,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29218 conditions, 3529 events. 1990/3529 cut-off events. For 13697/13705 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 22758 event pairs, 139 based on Foata normal form. 18/3007 useless extension candidates. Maximal degree in co-relation 29183. Up to 2998 conditions per place. [2022-12-13 03:11:37,776 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 277 selfloop transitions, 82 changer transitions 0/374 dead transitions. [2022-12-13 03:11:37,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 374 transitions, 7383 flow [2022-12-13 03:11:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 03:11:37,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 03:11:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2022-12-13 03:11:37,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2022-12-13 03:11:37,779 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2022-12-13 03:11:37,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 374 transitions, 7383 flow [2022-12-13 03:11:37,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 374 transitions, 7383 flow [2022-12-13 03:11:37,826 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:37,826 INFO L89 Accepts]: Start accepts. Operand has 64 places, 374 transitions, 7383 flow [2022-12-13 03:11:37,829 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:37,829 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:37,829 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 374 transitions, 7383 flow [2022-12-13 03:11:37,842 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 374 transitions, 7383 flow [2022-12-13 03:11:37,843 INFO L226 LiptonReduction]: Number of co-enabled transitions 454 [2022-12-13 03:11:37,845 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:37,845 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-13 03:11:37,845 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 374 transitions, 7383 flow [2022-12-13 03:11:37,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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:37,846 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:37,846 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:37,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 03:11:37,846 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:37,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:37,846 INFO L85 PathProgramCache]: Analyzing trace with hash -22433351, now seen corresponding path program 2 times [2022-12-13 03:11:37,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:37,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962730841] [2022-12-13 03:11:37,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:37,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:38,946 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:38,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:38,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962730841] [2022-12-13 03:11:38,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962730841] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:38,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:38,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 03:11:38,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980333452] [2022-12-13 03:11:38,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:38,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 03:11:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 03:11:38,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 03:11:38,947 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2022-12-13 03:11:38,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 374 transitions, 7383 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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:38,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:38,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2022-12-13 03:11:38,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:40,158 INFO L130 PetriNetUnfolder]: 2211/3917 cut-off events. [2022-12-13 03:11:40,158 INFO L131 PetriNetUnfolder]: For 19900/19908 co-relation queries the response was YES. [2022-12-13 03:11:40,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35527 conditions, 3917 events. 2211/3917 cut-off events. For 19900/19908 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 25969 event pairs, 133 based on Foata normal form. 18/3347 useless extension candidates. Maximal degree in co-relation 35489. Up to 3337 conditions per place. [2022-12-13 03:11:40,183 INFO L137 encePairwiseOnDemand]: 24/32 looper letters, 332 selfloop transitions, 109 changer transitions 0/456 dead transitions. [2022-12-13 03:11:40,183 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 456 transitions, 9914 flow [2022-12-13 03:11:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 03:11:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 03:11:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 200 transitions. [2022-12-13 03:11:40,185 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2022-12-13 03:11:40,185 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 37 predicate places. [2022-12-13 03:11:40,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 456 transitions, 9914 flow [2022-12-13 03:11:40,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 456 transitions, 9914 flow [2022-12-13 03:11:40,231 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:40,232 INFO L89 Accepts]: Start accepts. Operand has 75 places, 456 transitions, 9914 flow [2022-12-13 03:11:40,234 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:40,234 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:40,234 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 456 transitions, 9914 flow [2022-12-13 03:11:40,250 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 456 transitions, 9914 flow [2022-12-13 03:11:40,250 INFO L226 LiptonReduction]: Number of co-enabled transitions 486 [2022-12-13 03:11:40,268 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_298 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_293 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd0~0_100 256) 0)) (.cse6 (= (mod v_~x$w_buff0_used~0_299 256) 0))) (let ((.cse3 (select |v_#memory_int_486| |v_~#x~0.base_223|)) (.cse8 (not .cse6)) (.cse1 (not .cse5)) (.cse2 (not .cse4)) (.cse10 (and .cse9 .cse11))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EAX~0_145 1) (= v_~__unbuffered_p1_EBX~0_90 0) (= v_~y~0_95 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= |v_ULTIMATE.start_main_#t~nondet31#1_109| v_~weak$$choice1~0_73) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem28#1_104| |v_ULTIMATE.start_main_#t~mem28#1_102|))) (or (and (or (and .cse0 .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite29#1_105| v_~x$w_buff1~0_176)) (and (= |v_ULTIMATE.start_main_#t~mem28#1_102| (select .cse3 |v_~#x~0.offset_223|)) (or .cse4 .cse5) (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~mem28#1_102|))) (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~ite30#1_94|) (or .cse6 .cse7)) (and .cse0 (= v_~x$w_buff0~0_168 |v_ULTIMATE.start_main_#t~ite30#1_94|) .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~ite29#1_107|)))) (= (store |v_#memory_int_486| |v_~#x~0.base_223| (store .cse3 |v_~#x~0.offset_223| |v_ULTIMATE.start_main_#t~ite30#1_94|)) |v_#memory_int_485|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_299) v_~x$w_buff0_used~0_298) (= (ite .cse10 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse11) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_292 256) 0)))) 0 v_~x$r_buff1_thd0~0_100) v_~x$r_buff1_thd0~0_99) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff1_used~0_292 (ite (or (and .cse1 .cse2) .cse10) 0 v_~x$w_buff1_used~0_293)) (let ((.cse13 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_97 256) 0)) (.cse12 (= |v_ULTIMATE.start_main_#t~mem32#1_169| |v_ULTIMATE.start_main_#t~mem32#1_167|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite33#1_166| |v_ULTIMATE.start_main_#t~ite33#1_164|) (= v_~__unbuffered_p0_EAX~0_146 v_~__unbuffered_p0_EAX~0_145) .cse13) (and (not .cse13) (let ((.cse14 (= (mod v_~weak$$choice1~0_73 256) 0))) (or (and .cse12 .cse14 (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_146)) (and (= (select (select |v_#memory_int_485| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100) |v_ULTIMATE.start_main_#t~mem32#1_167|) (= |v_ULTIMATE.start_main_#t~ite33#1_164| |v_ULTIMATE.start_main_#t~mem32#1_167|) (not .cse14)))) (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_145)))))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_169|, ~x$w_buff0~0=v_~x$w_buff0~0_168, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, ~#x~0.offset=|v_~#x~0.offset_223|, ~x$w_buff1~0=v_~x$w_buff1~0_176, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_109|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_293, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_100, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_299, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_107|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_166|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100, #memory_int=|v_#memory_int_486|, ~#x~0.base=|v_~#x~0.base_223|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_97, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_104|, ~y~0=v_~y~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_168, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_145, ~weak$$choice1~0=v_~weak$$choice1~0_73, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_97, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~#x~0.offset=|v_~#x~0.offset_223|, ~x$w_buff1~0=v_~x$w_buff1~0_176, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_292, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_298, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_93|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100, #memory_int=|v_#memory_int_485|, ~#x~0.base=|v_~#x~0.base_223|} AuxVars[|v_ULTIMATE.start_main_#t~mem28#1_102|, |v_ULTIMATE.start_main_#t~ite30#1_94|, |v_ULTIMATE.start_main_#t~mem32#1_167|, |v_ULTIMATE.start_main_#t~ite29#1_105|, |v_ULTIMATE.start_main_#t~ite33#1_164|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite34#1, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1] and [539] L822-->L830: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_34 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0))) (.cse1 (not .cse10)) (.cse6 (= (mod v_~x$r_buff1_thd3~0_30 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_153 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_157 256) 0))) (let ((.cse2 (not .cse5)) (.cse0 (not .cse9)) (.cse7 (select |v_#memory_int_214| |v_~#x~0.base_139|)) (.cse3 (not .cse6)) (.cse4 (and .cse11 .cse1))) (and (= v_~x$w_buff0_used~0_152 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_153)) (= (ite (or (and .cse2 .cse3) .cse4) 0 v_~x$w_buff1_used~0_157) v_~x$w_buff1_used~0_156) (let ((.cse8 (= |v_P2_#t~mem19_30| |v_P2Thread1of1ForFork1_#t~mem19_1|))) (or (and (= |v_P2_#t~ite20_27| |v_P2_#t~ite21_27|) (or (and (or .cse5 .cse6) (= |v_P2_#t~ite20_27| |v_P2_#t~mem19_30|) (= (select .cse7 |v_~#x~0.offset_139|) |v_P2_#t~mem19_30|)) (and .cse2 (= |v_P2_#t~ite20_27| v_~x$w_buff1~0_74) .cse3 .cse8)) (or .cse9 .cse10)) (and .cse0 (= |v_P2_#t~ite20_27| |v_P2Thread1of1ForFork1_#t~ite20_1|) .cse1 .cse8 (= |v_P2_#t~ite21_27| v_~x$w_buff0~0_58)))) (= (store |v_#memory_int_214| |v_~#x~0.base_139| (store .cse7 |v_~#x~0.offset_139| |v_P2_#t~ite21_27|)) |v_#memory_int_213|) (= v_~x$r_buff1_thd3~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_156 256) 0))) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_33 256) 0)))) 0 v_~x$r_buff1_thd3~0_30)) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_34) v_~x$r_buff0_thd3~0_33))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_1|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_214|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_213|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} AuxVars[|v_P2_#t~ite20_27|, |v_P2_#t~mem19_30|, |v_P2_#t~ite21_27|] AssignedVars[P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-13 03:11:41,972 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_298 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_293 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd0~0_100 256) 0)) (.cse6 (= (mod v_~x$w_buff0_used~0_299 256) 0))) (let ((.cse3 (select |v_#memory_int_486| |v_~#x~0.base_223|)) (.cse8 (not .cse6)) (.cse1 (not .cse5)) (.cse2 (not .cse4)) (.cse10 (and .cse9 .cse11))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EAX~0_145 1) (= v_~__unbuffered_p1_EBX~0_90 0) (= v_~y~0_95 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= |v_ULTIMATE.start_main_#t~nondet31#1_109| v_~weak$$choice1~0_73) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem28#1_104| |v_ULTIMATE.start_main_#t~mem28#1_102|))) (or (and (or (and .cse0 .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite29#1_105| v_~x$w_buff1~0_176)) (and (= |v_ULTIMATE.start_main_#t~mem28#1_102| (select .cse3 |v_~#x~0.offset_223|)) (or .cse4 .cse5) (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~mem28#1_102|))) (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~ite30#1_94|) (or .cse6 .cse7)) (and .cse0 (= v_~x$w_buff0~0_168 |v_ULTIMATE.start_main_#t~ite30#1_94|) .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~ite29#1_107|)))) (= (store |v_#memory_int_486| |v_~#x~0.base_223| (store .cse3 |v_~#x~0.offset_223| |v_ULTIMATE.start_main_#t~ite30#1_94|)) |v_#memory_int_485|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_299) v_~x$w_buff0_used~0_298) (= (ite .cse10 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse11) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_292 256) 0)))) 0 v_~x$r_buff1_thd0~0_100) v_~x$r_buff1_thd0~0_99) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff1_used~0_292 (ite (or (and .cse1 .cse2) .cse10) 0 v_~x$w_buff1_used~0_293)) (let ((.cse13 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_97 256) 0)) (.cse12 (= |v_ULTIMATE.start_main_#t~mem32#1_169| |v_ULTIMATE.start_main_#t~mem32#1_167|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite33#1_166| |v_ULTIMATE.start_main_#t~ite33#1_164|) (= v_~__unbuffered_p0_EAX~0_146 v_~__unbuffered_p0_EAX~0_145) .cse13) (and (not .cse13) (let ((.cse14 (= (mod v_~weak$$choice1~0_73 256) 0))) (or (and .cse12 .cse14 (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_146)) (and (= (select (select |v_#memory_int_485| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100) |v_ULTIMATE.start_main_#t~mem32#1_167|) (= |v_ULTIMATE.start_main_#t~ite33#1_164| |v_ULTIMATE.start_main_#t~mem32#1_167|) (not .cse14)))) (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_145)))))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_169|, ~x$w_buff0~0=v_~x$w_buff0~0_168, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, ~#x~0.offset=|v_~#x~0.offset_223|, ~x$w_buff1~0=v_~x$w_buff1~0_176, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_109|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_293, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_100, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_299, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_107|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_166|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100, #memory_int=|v_#memory_int_486|, ~#x~0.base=|v_~#x~0.base_223|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_97, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_104|, ~y~0=v_~y~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_168, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_145, ~weak$$choice1~0=v_~weak$$choice1~0_73, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_97, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~#x~0.offset=|v_~#x~0.offset_223|, ~x$w_buff1~0=v_~x$w_buff1~0_176, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_292, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_298, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_93|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100, #memory_int=|v_#memory_int_485|, ~#x~0.base=|v_~#x~0.base_223|} AuxVars[|v_ULTIMATE.start_main_#t~mem28#1_102|, |v_ULTIMATE.start_main_#t~ite30#1_94|, |v_ULTIMATE.start_main_#t~mem32#1_167|, |v_ULTIMATE.start_main_#t~ite29#1_105|, |v_ULTIMATE.start_main_#t~ite33#1_164|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite34#1, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1] and [539] L822-->L830: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_34 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0))) (.cse1 (not .cse10)) (.cse6 (= (mod v_~x$r_buff1_thd3~0_30 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_153 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_157 256) 0))) (let ((.cse2 (not .cse5)) (.cse0 (not .cse9)) (.cse7 (select |v_#memory_int_214| |v_~#x~0.base_139|)) (.cse3 (not .cse6)) (.cse4 (and .cse11 .cse1))) (and (= v_~x$w_buff0_used~0_152 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_153)) (= (ite (or (and .cse2 .cse3) .cse4) 0 v_~x$w_buff1_used~0_157) v_~x$w_buff1_used~0_156) (let ((.cse8 (= |v_P2_#t~mem19_30| |v_P2Thread1of1ForFork1_#t~mem19_1|))) (or (and (= |v_P2_#t~ite20_27| |v_P2_#t~ite21_27|) (or (and (or .cse5 .cse6) (= |v_P2_#t~ite20_27| |v_P2_#t~mem19_30|) (= (select .cse7 |v_~#x~0.offset_139|) |v_P2_#t~mem19_30|)) (and .cse2 (= |v_P2_#t~ite20_27| v_~x$w_buff1~0_74) .cse3 .cse8)) (or .cse9 .cse10)) (and .cse0 (= |v_P2_#t~ite20_27| |v_P2Thread1of1ForFork1_#t~ite20_1|) .cse1 .cse8 (= |v_P2_#t~ite21_27| v_~x$w_buff0~0_58)))) (= (store |v_#memory_int_214| |v_~#x~0.base_139| (store .cse7 |v_~#x~0.offset_139| |v_P2_#t~ite21_27|)) |v_#memory_int_213|) (= v_~x$r_buff1_thd3~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_156 256) 0))) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_33 256) 0)))) 0 v_~x$r_buff1_thd3~0_30)) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_34) v_~x$r_buff0_thd3~0_33))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_1|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_214|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_213|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} AuxVars[|v_P2_#t~ite20_27|, |v_P2_#t~mem19_30|, |v_P2_#t~ite21_27|] AssignedVars[P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-13 03:11:43,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [642] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse7 (= (mod v_~x$r_buff0_thd0~0_94 256) 0))) (let ((.cse9 (not .cse7)) (.cse11 (not (= (mod v_~x$w_buff0_used~0_298 256) 0))) (.cse4 (= (mod v_~x$w_buff1_used~0_293 256) 0)) (.cse5 (= (mod v_~x$r_buff1_thd0~0_100 256) 0)) (.cse6 (= (mod v_~x$w_buff0_used~0_299 256) 0))) (let ((.cse3 (select |v_#memory_int_486| |v_~#x~0.base_223|)) (.cse8 (not .cse6)) (.cse1 (not .cse5)) (.cse2 (not .cse4)) (.cse10 (and .cse9 .cse11))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EAX~0_145 1) (= v_~__unbuffered_p1_EBX~0_90 0) (= v_~y~0_95 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_68) (= |v_ULTIMATE.start_main_#t~nondet31#1_109| v_~weak$$choice1~0_73) (let ((.cse0 (= |v_ULTIMATE.start_main_#t~mem28#1_104| |v_ULTIMATE.start_main_#t~mem28#1_102|))) (or (and (or (and .cse0 .cse1 .cse2 (= |v_ULTIMATE.start_main_#t~ite29#1_105| v_~x$w_buff1~0_176)) (and (= |v_ULTIMATE.start_main_#t~mem28#1_102| (select .cse3 |v_~#x~0.offset_223|)) (or .cse4 .cse5) (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~mem28#1_102|))) (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~ite30#1_94|) (or .cse6 .cse7)) (and .cse0 (= v_~x$w_buff0~0_168 |v_ULTIMATE.start_main_#t~ite30#1_94|) .cse8 .cse9 (= |v_ULTIMATE.start_main_#t~ite29#1_105| |v_ULTIMATE.start_main_#t~ite29#1_107|)))) (= (store |v_#memory_int_486| |v_~#x~0.base_223| (store .cse3 |v_~#x~0.offset_223| |v_ULTIMATE.start_main_#t~ite30#1_94|)) |v_#memory_int_485|) (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_59| 0)) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_39| 0) (= (ite (and .cse8 .cse9) 0 v_~x$w_buff0_used~0_299) v_~x$w_buff0_used~0_298) (= (ite .cse10 0 v_~x$r_buff0_thd0~0_94) v_~x$r_buff0_thd0~0_93) (= (ite (or (and (not (= (mod v_~x$r_buff0_thd0~0_93 256) 0)) .cse11) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_292 256) 0)))) 0 v_~x$r_buff1_thd0~0_100) v_~x$r_buff1_thd0~0_99) (= (mod v_~main$tmp_guard1~0_68 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|) (= v_~x$w_buff1_used~0_292 (ite (or (and .cse1 .cse2) .cse10) 0 v_~x$w_buff1_used~0_293)) (let ((.cse13 (= (mod v_~__unbuffered_p0_EAX$read_delayed~0_97 256) 0)) (.cse12 (= |v_ULTIMATE.start_main_#t~mem32#1_169| |v_ULTIMATE.start_main_#t~mem32#1_167|))) (or (and .cse12 (= |v_ULTIMATE.start_main_#t~ite33#1_166| |v_ULTIMATE.start_main_#t~ite33#1_164|) (= v_~__unbuffered_p0_EAX~0_146 v_~__unbuffered_p0_EAX~0_145) .cse13) (and (not .cse13) (let ((.cse14 (= (mod v_~weak$$choice1~0_73 256) 0))) (or (and .cse12 .cse14 (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_146)) (and (= (select (select |v_#memory_int_485| v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100) v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100) |v_ULTIMATE.start_main_#t~mem32#1_167|) (= |v_ULTIMATE.start_main_#t~ite33#1_164| |v_ULTIMATE.start_main_#t~mem32#1_167|) (not .cse14)))) (= |v_ULTIMATE.start_main_#t~ite33#1_164| v_~__unbuffered_p0_EAX~0_145)))))))) InVars {ULTIMATE.start_main_#t~mem32#1=|v_ULTIMATE.start_main_#t~mem32#1_169|, ~x$w_buff0~0=v_~x$w_buff0~0_168, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, ~#x~0.offset=|v_~#x~0.offset_223|, ~x$w_buff1~0=v_~x$w_buff1~0_176, ULTIMATE.start_main_#t~nondet31#1=|v_ULTIMATE.start_main_#t~nondet31#1_109|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_293, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_100, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_299, ULTIMATE.start_main_#t~ite29#1=|v_ULTIMATE.start_main_#t~ite29#1_107|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_146, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite33#1=|v_ULTIMATE.start_main_#t~ite33#1_166|, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100, #memory_int=|v_#memory_int_486|, ~#x~0.base=|v_~#x~0.base_223|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_97, ULTIMATE.start_main_#t~mem28#1=|v_ULTIMATE.start_main_#t~mem28#1_104|, ~y~0=v_~y~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_168, ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_68, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_145, ~weak$$choice1~0=v_~weak$$choice1~0_73, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_59|, ~__unbuffered_p0_EAX$read_delayed~0=v_~__unbuffered_p0_EAX$read_delayed~0_97, ~y~0=v_~y~0_95, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_93, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_90, ULTIMATE.start_main_#t~ite34#1=|v_ULTIMATE.start_main_#t~ite34#1_80|, ~#x~0.offset=|v_~#x~0.offset_223|, ~x$w_buff1~0=v_~x$w_buff1~0_176, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_292, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_99, ~__unbuffered_p0_EAX$read_delayed_var~0.base=v_~__unbuffered_p0_EAX$read_delayed_var~0.base_100, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_298, ULTIMATE.start_main_#t~ite30#1=|v_ULTIMATE.start_main_#t~ite30#1_93|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_39|, ~__unbuffered_p0_EAX$read_delayed_var~0.offset=v_~__unbuffered_p0_EAX$read_delayed_var~0.offset_100, #memory_int=|v_#memory_int_485|, ~#x~0.base=|v_~#x~0.base_223|} AuxVars[|v_ULTIMATE.start_main_#t~mem28#1_102|, |v_ULTIMATE.start_main_#t~ite30#1_94|, |v_ULTIMATE.start_main_#t~mem32#1_167|, |v_ULTIMATE.start_main_#t~ite29#1_105|, |v_ULTIMATE.start_main_#t~ite33#1_164|] AssignedVars[ULTIMATE.start_main_#t~mem32#1, ~x$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start_main_#t~ite34#1, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~nondet31#1, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite30#1, ULTIMATE.start_main_#t~ite29#1, ~__unbuffered_p0_EAX~0, ~weak$$choice1~0, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#t~ite33#1, #memory_int, ULTIMATE.start_main_#t~mem28#1] and [539] L822-->L830: Formula: (let ((.cse10 (= (mod v_~x$r_buff0_thd3~0_34 256) 0))) (let ((.cse11 (not (= (mod v_~x$w_buff0_used~0_152 256) 0))) (.cse1 (not .cse10)) (.cse6 (= (mod v_~x$r_buff1_thd3~0_30 256) 0)) (.cse9 (= (mod v_~x$w_buff0_used~0_153 256) 0)) (.cse5 (= (mod v_~x$w_buff1_used~0_157 256) 0))) (let ((.cse2 (not .cse5)) (.cse0 (not .cse9)) (.cse7 (select |v_#memory_int_214| |v_~#x~0.base_139|)) (.cse3 (not .cse6)) (.cse4 (and .cse11 .cse1))) (and (= v_~x$w_buff0_used~0_152 (ite (and .cse0 .cse1) 0 v_~x$w_buff0_used~0_153)) (= (ite (or (and .cse2 .cse3) .cse4) 0 v_~x$w_buff1_used~0_157) v_~x$w_buff1_used~0_156) (let ((.cse8 (= |v_P2_#t~mem19_30| |v_P2Thread1of1ForFork1_#t~mem19_1|))) (or (and (= |v_P2_#t~ite20_27| |v_P2_#t~ite21_27|) (or (and (or .cse5 .cse6) (= |v_P2_#t~ite20_27| |v_P2_#t~mem19_30|) (= (select .cse7 |v_~#x~0.offset_139|) |v_P2_#t~mem19_30|)) (and .cse2 (= |v_P2_#t~ite20_27| v_~x$w_buff1~0_74) .cse3 .cse8)) (or .cse9 .cse10)) (and .cse0 (= |v_P2_#t~ite20_27| |v_P2Thread1of1ForFork1_#t~ite20_1|) .cse1 .cse8 (= |v_P2_#t~ite21_27| v_~x$w_buff0~0_58)))) (= (store |v_#memory_int_214| |v_~#x~0.base_139| (store .cse7 |v_~#x~0.offset_139| |v_P2_#t~ite21_27|)) |v_#memory_int_213|) (= v_~x$r_buff1_thd3~0_29 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_156 256) 0))) (and .cse11 (not (= (mod v_~x$r_buff0_thd3~0_33 256) 0)))) 0 v_~x$r_buff1_thd3~0_30)) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_34) v_~x$r_buff0_thd3~0_33))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~mem19=|v_P2Thread1of1ForFork1_#t~mem19_1|, P2Thread1of1ForFork1_#t~ite20=|v_P2Thread1of1ForFork1_#t~ite20_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_214|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_30, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_157, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, P2Thread1of1ForFork1_#t~ite21=|v_P2Thread1of1ForFork1_#t~ite21_1|, ~#x~0.offset=|v_~#x~0.offset_139|, ~x$w_buff1~0=v_~x$w_buff1~0_74, #memory_int=|v_#memory_int_213|, ~#x~0.base=|v_~#x~0.base_139|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_29, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_156, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_33, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} AuxVars[|v_P2_#t~ite20_27|, |v_P2_#t~mem19_30|, |v_P2_#t~ite21_27|] AssignedVars[P2Thread1of1ForFork1_#t~mem19, P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21, #memory_int, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x$w_buff0_used~0] [2022-12-13 03:11:45,489 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 03:11:45,490 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5259 [2022-12-13 03:11:45,490 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 458 transitions, 9964 flow [2022-12-13 03:11:45,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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:45,490 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:45,490 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:45,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 03:11:45,490 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:45,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:45,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1869496199, now seen corresponding path program 3 times [2022-12-13 03:11:45,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:45,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542610517] [2022-12-13 03:11:45,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:45,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:11:45,608 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:45,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:11:45,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542610517] [2022-12-13 03:11:45,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542610517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:11:45,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:11:45,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 03:11:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159849007] [2022-12-13 03:11:45,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:11:45,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 03:11:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:11:45,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 03:11:45,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 03:11:45,610 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 36 [2022-12-13 03:11:45,610 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 458 transitions, 9964 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:45,610 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:11:45,610 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 36 [2022-12-13 03:11:45,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:11:46,236 INFO L130 PetriNetUnfolder]: 1876/3499 cut-off events. [2022-12-13 03:11:46,236 INFO L131 PetriNetUnfolder]: For 20742/20780 co-relation queries the response was YES. [2022-12-13 03:11:46,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34669 conditions, 3499 events. 1876/3499 cut-off events. For 20742/20780 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 24244 event pairs, 40 based on Foata normal form. 264/3238 useless extension candidates. Maximal degree in co-relation 34628. Up to 2930 conditions per place. [2022-12-13 03:11:46,270 INFO L137 encePairwiseOnDemand]: 21/36 looper letters, 215 selfloop transitions, 194 changer transitions 70/485 dead transitions. [2022-12-13 03:11:46,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 485 transitions, 11462 flow [2022-12-13 03:11:46,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 03:11:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 03:11:46,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2022-12-13 03:11:46,272 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-13 03:11:46,272 INFO L295 CegarLoopForPetriNet]: 38 programPoint places, 42 predicate places. [2022-12-13 03:11:46,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 485 transitions, 11462 flow [2022-12-13 03:11:46,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 415 transitions, 9830 flow [2022-12-13 03:11:46,400 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:11:46,400 INFO L89 Accepts]: Start accepts. Operand has 78 places, 415 transitions, 9830 flow [2022-12-13 03:11:46,405 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:11:46,406 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:11:46,406 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 415 transitions, 9830 flow [2022-12-13 03:11:46,424 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 415 transitions, 9830 flow [2022-12-13 03:11:46,424 INFO L226 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-13 03:11:46,427 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:11:46,429 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-13 03:11:46,429 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 415 transitions, 9830 flow [2022-12-13 03:11:46,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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:46,429 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:11:46,429 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:46,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 03:11:46,430 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 03:11:46,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:11:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2017324615, now seen corresponding path program 1 times [2022-12-13 03:11:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:11:46,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868079157] [2022-12-13 03:11:46,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:11:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:11:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:11:46,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:11:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:11:46,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:11:46,550 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:11:46,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 03:11:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 03:11:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 03:11:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 03:11:46,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 03:11:46,555 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:11:46,558 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:11:46,558 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:11:46,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:11:46 BasicIcfg [2022-12-13 03:11:46,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:11:46,644 INFO L158 Benchmark]: Toolchain (without parser) took 25300.78ms. Allocated memory was 241.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 215.7MB in the beginning and 1.2GB in the end (delta: -947.8MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB. [2022-12-13 03:11:46,644 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 241.2MB. Free memory is still 218.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:11:46,644 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.13ms. Allocated memory is still 241.2MB. Free memory was 215.3MB in the beginning and 188.4MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 03:11:46,644 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.33ms. Allocated memory is still 241.2MB. Free memory was 188.4MB in the beginning and 186.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:11:46,645 INFO L158 Benchmark]: Boogie Preprocessor took 46.14ms. Allocated memory is still 241.2MB. Free memory was 186.0MB in the beginning and 183.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 03:11:46,645 INFO L158 Benchmark]: RCFGBuilder took 883.34ms. Allocated memory was 241.2MB in the beginning and 324.0MB in the end (delta: 82.8MB). Free memory was 183.9MB in the beginning and 266.7MB in the end (delta: -82.9MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2022-12-13 03:11:46,645 INFO L158 Benchmark]: TraceAbstraction took 23882.03ms. Allocated memory was 324.0MB in the beginning and 1.3GB in the end (delta: 967.8MB). Free memory was 265.2MB in the beginning and 1.2GB in the end (delta: -898.3MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. [2022-12-13 03:11:46,646 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 241.2MB. Free memory is still 218.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.13ms. Allocated memory is still 241.2MB. Free memory was 215.3MB in the beginning and 188.4MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.33ms. Allocated memory is still 241.2MB. Free memory was 188.4MB in the beginning and 186.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.14ms. Allocated memory is still 241.2MB. Free memory was 186.0MB in the beginning and 183.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 883.34ms. Allocated memory was 241.2MB in the beginning and 324.0MB in the end (delta: 82.8MB). Free memory was 183.9MB in the beginning and 266.7MB in the end (delta: -82.9MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. * TraceAbstraction took 23882.03ms. Allocated memory was 324.0MB in the beginning and 1.3GB in the end (delta: 967.8MB). Free memory was 265.2MB in the beginning and 1.2GB in the end (delta: -898.3MB). Peak memory consumption was 70.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 118 PlacesBefore, 38 PlacesAfterwards, 109 TransitionsBefore, 29 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 57 TrivialYvCompositions, 32 ConcurrentYvCompositions, 0 ChoiceCompositions, 91 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1489, independent: 1394, independent conditional: 1394, independent unconditional: 0, dependent: 95, dependent conditional: 95, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1489, independent: 1394, independent conditional: 0, independent unconditional: 1394, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1489, independent: 1394, independent conditional: 0, independent unconditional: 1394, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1489, independent: 1394, independent conditional: 0, independent unconditional: 1394, dependent: 95, dependent conditional: 0, dependent unconditional: 95, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 967, independent: 918, independent conditional: 0, independent unconditional: 918, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 967, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 330, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 278, dependent conditional: 0, dependent unconditional: 278, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1489, independent: 476, independent conditional: 0, independent unconditional: 476, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 967, unknown conditional: 0, unknown unconditional: 967] , Statistics on independence cache: Total cache size (in pairs): 1359, Positive cache size: 1310, Positive conditional cache size: 0, Positive unconditional cache size: 1310, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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, 39 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 25, independent conditional: 25, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 25, independent conditional: 0, independent unconditional: 25, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 31, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 17, Positive conditional cache size: 0, Positive unconditional cache size: 17, 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.7s, 41 PlacesBefore, 41 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 0, independent unconditional: 6, 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: 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: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 27, Positive cache size: 23, Positive conditional cache size: 0, 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: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 280 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): 27, Positive cache size: 23, Positive conditional cache size: 0, 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: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 45 PlacesBefore, 45 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 338 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): 27, Positive cache size: 23, Positive conditional cache size: 0, 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: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 48 PlacesBefore, 48 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 470 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 12, independent: 12, independent conditional: 0, independent unconditional: 12, 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: 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: 12, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, 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: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 173 TransitionsBefore, 173 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 12, 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: 12, independent: 12, independent conditional: 4, independent unconditional: 8, 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: 12, independent: 12, independent conditional: 4, independent unconditional: 8, 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: 12, independent: 12, independent conditional: 4, independent unconditional: 8, 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): 36, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, 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: 8, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 178 TransitionsBefore, 178 TransitionsAfterwards, 302 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): 36, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, 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, 56 PlacesBefore, 56 PlacesAfterwards, 255 TransitionsBefore, 255 TransitionsAfterwards, 368 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): 36, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, 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, 64 PlacesBefore, 64 PlacesAfterwards, 374 TransitionsBefore, 374 TransitionsAfterwards, 454 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): 36, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, 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: 5.2s, 75 PlacesBefore, 75 PlacesAfterwards, 456 TransitionsBefore, 458 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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: 4, independent unconditional: 2, 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: 4, independent unconditional: 2, 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: 6, independent: 6, independent conditional: 4, independent unconditional: 2, 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): 37, Positive cache size: 33, Positive conditional cache size: 0, 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: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 78 PlacesBefore, 78 PlacesAfterwards, 415 TransitionsBefore, 415 TransitionsAfterwards, 444 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): 37, Positive cache size: 33, Positive conditional cache size: 0, 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: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p1_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L847] 0 pthread_t t1693; [L848] FCALL, FORK 0 pthread_create(&t1693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1693, ((void *)0), P0, ((void *)0))=-1, t1693={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L849] 0 pthread_t t1694; [L850] FCALL, FORK 0 pthread_create(&t1694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1694, ((void *)0), P1, ((void *)0))=0, t1693={7:0}, t1694={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t1695; [L852] FCALL, FORK 0 pthread_create(&t1695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1695, ((void *)0), P2, ((void *)0))=1, t1693={7:0}, t1694={5:0}, t1695={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 x$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(x) [L764] 1 x$mem_tmp = x [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] EXPR 1 \read(x) [L765] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L765] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L766] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L767] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L768] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L769] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L771] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L774] EXPR 1 \read(x) [L774] 1 __unbuffered_p0_EAX = x [L775] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L775] 1 x = x$flush_delayed ? x$mem_tmp : x [L776] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 y = 2 [L794] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 2 x$flush_delayed = weak$$choice2 [L800] EXPR 2 \read(x) [L800] 2 x$mem_tmp = x [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] EXPR 2 \read(x) [L801] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L801] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L802] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L803] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L804] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L805] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L807] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 \read(x) [L808] 2 __unbuffered_p1_EBX = x [L809] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L809] 2 x = x$flush_delayed ? x$mem_tmp : x [L810] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 2 return 0; [L822] 3 x = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L825] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L825] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L826] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L827] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L828] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L829] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L854] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L856] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L856] RET 0 assume_abort_if_not(main$tmp_guard0) [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 \read(x) [L858] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L858] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L858] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L859] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L860] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L861] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L862] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L865] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L866] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L866] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L867] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L869] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 4 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: 23.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 406 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 406 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1168 IncrementalHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 3 mSDtfsCounter, 1168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9964occurred in iteration=10, InterpolantAutomatonStates: 59, 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.6s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 118 ConstructedInterpolants, 0 QuantifiedInterpolants, 2472 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 03:11:46,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...