/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:30:20,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:30:20,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:30:20,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:30:20,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:30:20,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:30:20,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:30:20,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:30:20,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:30:20,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:30:20,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:30:20,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:30:20,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:30:20,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:30:20,335 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:30:20,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:30:20,336 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:30:20,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:30:20,338 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:30:20,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:30:20,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:30:20,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:30:20,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:30:20,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:30:20,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:30:20,358 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:30:20,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:30:20,360 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:30:20,361 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:30:20,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:30:20,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:30:20,364 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:30:20,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:30:20,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:30:20,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:30:20,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:30:20,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:30:20,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:30:20,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:30:20,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:30:20,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:30:20,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:30:20,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:30:20,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:30:20,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:30:20,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:30:20,402 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:30:20,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:30:20,403 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:30:20,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:30:20,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:30:20,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:30:20,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:30:20,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:30:20,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:30:20,404 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:30:20,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:30:20,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:30:20,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:30:20,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:30:20,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:30:20,405 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:30:20,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:30:20,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:20,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:30:20,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:30:20,406 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:30:20,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:30:20,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:30:20,406 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:30:20,407 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 06:30:20,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:30:20,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:30:20,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:30:20,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:30:20,736 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:30:20,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2022-12-06 06:30:21,938 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:30:22,213 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:30:22,214 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_tso.oepc.i [2022-12-06 06:30:22,229 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98468b654/614baa166e3f42cf9a3dff8ebc44a610/FLAG222f7717b [2022-12-06 06:30:22,241 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98468b654/614baa166e3f42cf9a3dff8ebc44a610 [2022-12-06 06:30:22,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:30:22,245 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:30:22,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:22,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:30:22,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:30:22,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103d071c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22, skipping insertion in model container [2022-12-06 06:30:22,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:30:22,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:30:22,501 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/mix055_tso.oepc.i[949,962] [2022-12-06 06:30:22,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,674 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,675 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,682 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,686 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,687 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,705 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,708 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,714 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,739 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,740 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,748 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:22,761 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:30:22,771 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/mix055_tso.oepc.i[949,962] [2022-12-06 06:30:22,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,791 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,793 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,794 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,799 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,801 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,804 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,805 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,807 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,816 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,817 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,821 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,822 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 06:30:22,826 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 06:30:22,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:30:22,872 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:30:22,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22 WrapperNode [2022-12-06 06:30:22,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:30:22,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:22,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:30:22,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:30:22,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,945 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-12-06 06:30:22,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:30:22,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:30:22,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:30:22,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:30:22,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,982 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,984 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:22,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:30:22,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:30:22,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:30:22,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:30:22,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (1/1) ... [2022-12-06 06:30:23,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:30:23,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:30:23,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 06:30:23,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 06:30:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:30:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 06:30:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:30:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:30:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:30:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-06 06:30:23,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-06 06:30:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-06 06:30:23,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-06 06:30:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-06 06:30:23,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-06 06:30:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-06 06:30:23,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-06 06:30:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:30:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 06:30:23,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:30:23,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:30:23,075 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 06:30:23,259 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:30:23,261 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:30:23,633 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:30:23,830 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:30:23,831 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 06:30:23,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:23 BoogieIcfgContainer [2022-12-06 06:30:23,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:30:23,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:30:23,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:30:23,839 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:30:23,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:30:22" (1/3) ... [2022-12-06 06:30:23,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfc0066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:23, skipping insertion in model container [2022-12-06 06:30:23,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:30:22" (2/3) ... [2022-12-06 06:30:23,840 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfc0066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:30:23, skipping insertion in model container [2022-12-06 06:30:23,840 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:30:23" (3/3) ... [2022-12-06 06:30:23,841 INFO L112 eAbstractionObserver]: Analyzing ICFG mix055_tso.oepc.i [2022-12-06 06:30:23,858 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:30:23,859 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:30:23,859 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:30:23,938 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-06 06:30:23,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 276 flow [2022-12-06 06:30:24,034 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 06:30:24,034 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:24,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 06:30:24,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 139 places, 128 transitions, 276 flow [2022-12-06 06:30:24,047 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 124 transitions, 260 flow [2022-12-06 06:30:24,049 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:24,095 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-06 06:30:24,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 135 places, 124 transitions, 260 flow [2022-12-06 06:30:24,191 INFO L130 PetriNetUnfolder]: 2/124 cut-off events. [2022-12-06 06:30:24,192 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:24,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2022-12-06 06:30:24,198 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 135 places, 124 transitions, 260 flow [2022-12-06 06:30:24,199 INFO L188 LiptonReduction]: Number of co-enabled transitions 3044 [2022-12-06 06:30:30,156 INFO L203 LiptonReduction]: Total number of compositions: 95 [2022-12-06 06:30:30,170 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:30:30,178 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;@19f4431f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:30:30,178 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-06 06:30:30,188 INFO L130 PetriNetUnfolder]: 0/6 cut-off events. [2022-12-06 06:30:30,188 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:30,188 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:30,189 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 06:30:30,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:30,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash 517776689, now seen corresponding path program 1 times [2022-12-06 06:30:30,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:30,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223732774] [2022-12-06 06:30:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:30,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:30,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:30,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223732774] [2022-12-06 06:30:30,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223732774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:30,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:30,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 06:30:30,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309576446] [2022-12-06 06:30:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:30,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:30:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:30,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:30:30,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:30:30,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 34 [2022-12-06 06:30:30,624 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:30,624 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:30,624 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 34 [2022-12-06 06:30:30,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:31,729 INFO L130 PetriNetUnfolder]: 4863/6830 cut-off events. [2022-12-06 06:30:31,729 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2022-12-06 06:30:31,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13654 conditions, 6830 events. 4863/6830 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 34804 event pairs, 1800 based on Foata normal form. 0/6221 useless extension candidates. Maximal degree in co-relation 13642. Up to 5308 conditions per place. [2022-12-06 06:30:31,774 INFO L137 encePairwiseOnDemand]: 29/34 looper letters, 37 selfloop transitions, 2 changer transitions 8/51 dead transitions. [2022-12-06 06:30:31,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 51 transitions, 214 flow [2022-12-06 06:30:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:30:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:30:31,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-06 06:30:31,785 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6274509803921569 [2022-12-06 06:30:31,786 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 64 transitions. [2022-12-06 06:30:31,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 51 transitions, 214 flow [2022-12-06 06:30:31,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 06:30:31,794 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 66 flow [2022-12-06 06:30:31,796 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2022-12-06 06:30:31,800 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2022-12-06 06:30:31,800 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:31,801 INFO L89 Accepts]: Start accepts. Operand has 42 places, 27 transitions, 66 flow [2022-12-06 06:30:31,804 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:31,804 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:31,804 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 27 transitions, 66 flow [2022-12-06 06:30:31,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 66 flow [2022-12-06 06:30:31,822 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-06 06:30:31,822 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 06:30:31,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 27 events. 0/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2022-12-06 06:30:31,823 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 66 flow [2022-12-06 06:30:31,823 INFO L188 LiptonReduction]: Number of co-enabled transitions 384 [2022-12-06 06:30:31,882 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:31,885 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 06:30:31,885 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2022-12-06 06:30:31,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:31,885 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:31,885 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:31,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:30:31,889 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:31,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:31,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1672548873, now seen corresponding path program 1 times [2022-12-06 06:30:31,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:31,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155600935] [2022-12-06 06:30:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:31,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:32,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:32,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155600935] [2022-12-06 06:30:32,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155600935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:32,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:32,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:30:32,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814318969] [2022-12-06 06:30:32,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:32,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:32,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:32,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:32,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:32,401 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:30:32,401 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:32,401 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:32,401 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:30:32,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:33,928 INFO L130 PetriNetUnfolder]: 9357/12631 cut-off events. [2022-12-06 06:30:33,928 INFO L131 PetriNetUnfolder]: For 641/641 co-relation queries the response was YES. [2022-12-06 06:30:33,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26265 conditions, 12631 events. 9357/12631 cut-off events. For 641/641 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 58604 event pairs, 1414 based on Foata normal form. 175/12806 useless extension candidates. Maximal degree in co-relation 26255. Up to 10537 conditions per place. [2022-12-06 06:30:34,006 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 46 selfloop transitions, 13 changer transitions 0/59 dead transitions. [2022-12-06 06:30:34,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 59 transitions, 256 flow [2022-12-06 06:30:34,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 06:30:34,009 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2022-12-06 06:30:34,009 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 4 states and 61 transitions. [2022-12-06 06:30:34,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 59 transitions, 256 flow [2022-12-06 06:30:34,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 59 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:34,012 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 146 flow [2022-12-06 06:30:34,012 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2022-12-06 06:30:34,013 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2022-12-06 06:30:34,013 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:34,013 INFO L89 Accepts]: Start accepts. Operand has 41 places, 38 transitions, 146 flow [2022-12-06 06:30:34,014 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:34,014 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:34,014 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 38 transitions, 146 flow [2022-12-06 06:30:34,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 146 flow [2022-12-06 06:30:34,238 INFO L130 PetriNetUnfolder]: 802/1291 cut-off events. [2022-12-06 06:30:34,239 INFO L131 PetriNetUnfolder]: For 166/166 co-relation queries the response was YES. [2022-12-06 06:30:34,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1291 events. 802/1291 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 7046 event pairs, 400 based on Foata normal form. 0/1259 useless extension candidates. Maximal degree in co-relation 2844. Up to 1057 conditions per place. [2022-12-06 06:30:34,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 146 flow [2022-12-06 06:30:34,253 INFO L188 LiptonReduction]: Number of co-enabled transitions 442 [2022-12-06 06:30:34,280 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:34,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 268 [2022-12-06 06:30:34,282 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 146 flow [2022-12-06 06:30:34,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:34,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:34,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:34,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:30:34,282 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:34,283 INFO L85 PathProgramCache]: Analyzing trace with hash -309407726, now seen corresponding path program 1 times [2022-12-06 06:30:34,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:34,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380808380] [2022-12-06 06:30:34,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:34,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:34,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:34,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380808380] [2022-12-06 06:30:34,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380808380] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:34,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:34,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:34,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852497358] [2022-12-06 06:30:34,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:34,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:34,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:34,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:34,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:34,993 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:30:34,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 146 flow. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:34,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:34,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:30:34,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:36,380 INFO L130 PetriNetUnfolder]: 9051/12244 cut-off events. [2022-12-06 06:30:36,380 INFO L131 PetriNetUnfolder]: For 3762/3762 co-relation queries the response was YES. [2022-12-06 06:30:36,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33842 conditions, 12244 events. 9051/12244 cut-off events. For 3762/3762 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 57107 event pairs, 2445 based on Foata normal form. 63/12307 useless extension candidates. Maximal degree in co-relation 33830. Up to 10019 conditions per place. [2022-12-06 06:30:36,454 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 57 selfloop transitions, 20 changer transitions 0/77 dead transitions. [2022-12-06 06:30:36,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 77 transitions, 441 flow [2022-12-06 06:30:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:36,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2022-12-06 06:30:36,457 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6018518518518519 [2022-12-06 06:30:36,457 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 146 flow. Second operand 4 states and 65 transitions. [2022-12-06 06:30:36,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 77 transitions, 441 flow [2022-12-06 06:30:36,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 77 transitions, 441 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:36,468 INFO L231 Difference]: Finished difference. Result has 47 places, 53 transitions, 322 flow [2022-12-06 06:30:36,469 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=47, PETRI_TRANSITIONS=53} [2022-12-06 06:30:36,470 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 1 predicate places. [2022-12-06 06:30:36,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:36,470 INFO L89 Accepts]: Start accepts. Operand has 47 places, 53 transitions, 322 flow [2022-12-06 06:30:36,472 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:36,472 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:36,472 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 53 transitions, 322 flow [2022-12-06 06:30:36,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 53 transitions, 322 flow [2022-12-06 06:30:36,608 INFO L130 PetriNetUnfolder]: 700/1127 cut-off events. [2022-12-06 06:30:36,609 INFO L131 PetriNetUnfolder]: For 812/837 co-relation queries the response was YES. [2022-12-06 06:30:36,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3627 conditions, 1127 events. 700/1127 cut-off events. For 812/837 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 5940 event pairs, 250 based on Foata normal form. 0/1103 useless extension candidates. Maximal degree in co-relation 3613. Up to 923 conditions per place. [2022-12-06 06:30:36,621 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 53 transitions, 322 flow [2022-12-06 06:30:36,621 INFO L188 LiptonReduction]: Number of co-enabled transitions 582 [2022-12-06 06:30:36,637 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:36,638 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 168 [2022-12-06 06:30:36,638 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 53 transitions, 322 flow [2022-12-06 06:30:36,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:36,638 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:36,639 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:36,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:30:36,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1978805146, now seen corresponding path program 1 times [2022-12-06 06:30:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:36,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284237811] [2022-12-06 06:30:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:36,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284237811] [2022-12-06 06:30:36,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284237811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:36,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:36,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:36,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644816402] [2022-12-06 06:30:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:36,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:36,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:36,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:36,978 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:30:36,978 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 53 transitions, 322 flow. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:36,978 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:36,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:30:36,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:38,574 INFO L130 PetriNetUnfolder]: 11659/15912 cut-off events. [2022-12-06 06:30:38,574 INFO L131 PetriNetUnfolder]: For 11585/11585 co-relation queries the response was YES. [2022-12-06 06:30:38,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50322 conditions, 15912 events. 11659/15912 cut-off events. For 11585/11585 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 79293 event pairs, 2732 based on Foata normal form. 348/16260 useless extension candidates. Maximal degree in co-relation 50305. Up to 8400 conditions per place. [2022-12-06 06:30:38,651 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 73 selfloop transitions, 12 changer transitions 4/89 dead transitions. [2022-12-06 06:30:38,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 647 flow [2022-12-06 06:30:38,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-06 06:30:38,654 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2022-12-06 06:30:38,654 INFO L175 Difference]: Start difference. First operand has 47 places, 53 transitions, 322 flow. Second operand 4 states and 61 transitions. [2022-12-06 06:30:38,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 647 flow [2022-12-06 06:30:38,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 647 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:38,812 INFO L231 Difference]: Finished difference. Result has 52 places, 55 transitions, 375 flow [2022-12-06 06:30:38,812 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=375, PETRI_PLACES=52, PETRI_TRANSITIONS=55} [2022-12-06 06:30:38,813 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2022-12-06 06:30:38,813 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:38,814 INFO L89 Accepts]: Start accepts. Operand has 52 places, 55 transitions, 375 flow [2022-12-06 06:30:38,815 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:38,815 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:38,815 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 55 transitions, 375 flow [2022-12-06 06:30:38,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 55 transitions, 375 flow [2022-12-06 06:30:39,075 INFO L130 PetriNetUnfolder]: 796/1408 cut-off events. [2022-12-06 06:30:39,075 INFO L131 PetriNetUnfolder]: For 1824/1874 co-relation queries the response was YES. [2022-12-06 06:30:39,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4560 conditions, 1408 events. 796/1408 cut-off events. For 1824/1874 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 8652 event pairs, 334 based on Foata normal form. 0/1387 useless extension candidates. Maximal degree in co-relation 4542. Up to 1119 conditions per place. [2022-12-06 06:30:39,091 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 55 transitions, 375 flow [2022-12-06 06:30:39,092 INFO L188 LiptonReduction]: Number of co-enabled transitions 608 [2022-12-06 06:30:39,102 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:39,110 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 297 [2022-12-06 06:30:39,110 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 55 transitions, 375 flow [2022-12-06 06:30:39,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:39,110 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:39,110 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:39,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 06:30:39,111 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:39,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1004312271, now seen corresponding path program 1 times [2022-12-06 06:30:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:39,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40362539] [2022-12-06 06:30:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:39,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:39,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:39,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40362539] [2022-12-06 06:30:39,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40362539] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:39,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:39,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403525987] [2022-12-06 06:30:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:39,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:39,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:39,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:39,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:39,868 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 27 [2022-12-06 06:30:39,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 55 transitions, 375 flow. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:39,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:39,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 27 [2022-12-06 06:30:39,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:41,285 INFO L130 PetriNetUnfolder]: 9589/13532 cut-off events. [2022-12-06 06:30:41,285 INFO L131 PetriNetUnfolder]: For 17978/18041 co-relation queries the response was YES. [2022-12-06 06:30:41,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45477 conditions, 13532 events. 9589/13532 cut-off events. For 17978/18041 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 73756 event pairs, 3340 based on Foata normal form. 79/13092 useless extension candidates. Maximal degree in co-relation 45456. Up to 11183 conditions per place. [2022-12-06 06:30:41,516 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 64 selfloop transitions, 21 changer transitions 8/102 dead transitions. [2022-12-06 06:30:41,516 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 102 transitions, 820 flow [2022-12-06 06:30:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:30:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:30:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-12-06 06:30:41,520 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6481481481481481 [2022-12-06 06:30:41,520 INFO L175 Difference]: Start difference. First operand has 52 places, 55 transitions, 375 flow. Second operand 4 states and 70 transitions. [2022-12-06 06:30:41,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 102 transitions, 820 flow [2022-12-06 06:30:41,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 102 transitions, 812 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:41,554 INFO L231 Difference]: Finished difference. Result has 57 places, 66 transitions, 539 flow [2022-12-06 06:30:41,555 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=539, PETRI_PLACES=57, PETRI_TRANSITIONS=66} [2022-12-06 06:30:41,557 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2022-12-06 06:30:41,557 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:41,558 INFO L89 Accepts]: Start accepts. Operand has 57 places, 66 transitions, 539 flow [2022-12-06 06:30:41,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:41,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:41,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 66 transitions, 539 flow [2022-12-06 06:30:41,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 66 transitions, 539 flow [2022-12-06 06:30:41,792 INFO L130 PetriNetUnfolder]: 804/1428 cut-off events. [2022-12-06 06:30:41,793 INFO L131 PetriNetUnfolder]: For 3139/3167 co-relation queries the response was YES. [2022-12-06 06:30:41,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 1428 events. 804/1428 cut-off events. For 3139/3167 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8780 event pairs, 339 based on Foata normal form. 0/1408 useless extension candidates. Maximal degree in co-relation 5496. Up to 1125 conditions per place. [2022-12-06 06:30:41,811 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 66 transitions, 539 flow [2022-12-06 06:30:41,811 INFO L188 LiptonReduction]: Number of co-enabled transitions 692 [2022-12-06 06:30:41,840 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:41,841 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 284 [2022-12-06 06:30:41,841 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 66 transitions, 539 flow [2022-12-06 06:30:41,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:41,841 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:41,841 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:41,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:30:41,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:41,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2051912491, now seen corresponding path program 1 times [2022-12-06 06:30:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:41,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914533876] [2022-12-06 06:30:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:42,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:42,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914533876] [2022-12-06 06:30:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914533876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:42,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:42,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622753436] [2022-12-06 06:30:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:42,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:42,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:42,685 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 27 [2022-12-06 06:30:42,685 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 66 transitions, 539 flow. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:42,685 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:42,685 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 27 [2022-12-06 06:30:42,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:44,302 INFO L130 PetriNetUnfolder]: 12402/17057 cut-off events. [2022-12-06 06:30:44,302 INFO L131 PetriNetUnfolder]: For 31906/31906 co-relation queries the response was YES. [2022-12-06 06:30:44,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63275 conditions, 17057 events. 12402/17057 cut-off events. For 31906/31906 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 88093 event pairs, 3176 based on Foata normal form. 96/17153 useless extension candidates. Maximal degree in co-relation 63250. Up to 13672 conditions per place. [2022-12-06 06:30:44,420 INFO L137 encePairwiseOnDemand]: 15/27 looper letters, 123 selfloop transitions, 51 changer transitions 11/185 dead transitions. [2022-12-06 06:30:44,420 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 185 transitions, 1713 flow [2022-12-06 06:30:44,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-12-06 06:30:44,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2022-12-06 06:30:44,423 INFO L175 Difference]: Start difference. First operand has 57 places, 66 transitions, 539 flow. Second operand 6 states and 100 transitions. [2022-12-06 06:30:44,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 185 transitions, 1713 flow [2022-12-06 06:30:44,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 185 transitions, 1713 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:44,507 INFO L231 Difference]: Finished difference. Result has 66 places, 110 transitions, 1194 flow [2022-12-06 06:30:44,507 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1194, PETRI_PLACES=66, PETRI_TRANSITIONS=110} [2022-12-06 06:30:44,510 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2022-12-06 06:30:44,510 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:44,510 INFO L89 Accepts]: Start accepts. Operand has 66 places, 110 transitions, 1194 flow [2022-12-06 06:30:44,512 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:44,513 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:44,513 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 110 transitions, 1194 flow [2022-12-06 06:30:44,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 110 transitions, 1194 flow [2022-12-06 06:30:44,783 INFO L130 PetriNetUnfolder]: 1285/2236 cut-off events. [2022-12-06 06:30:44,783 INFO L131 PetriNetUnfolder]: For 8074/8298 co-relation queries the response was YES. [2022-12-06 06:30:44,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11218 conditions, 2236 events. 1285/2236 cut-off events. For 8074/8298 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 13985 event pairs, 322 based on Foata normal form. 6/2221 useless extension candidates. Maximal degree in co-relation 11190. Up to 1733 conditions per place. [2022-12-06 06:30:44,810 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 110 transitions, 1194 flow [2022-12-06 06:30:44,810 INFO L188 LiptonReduction]: Number of co-enabled transitions 998 [2022-12-06 06:30:44,842 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:44,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 333 [2022-12-06 06:30:44,843 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 110 transitions, 1194 flow [2022-12-06 06:30:44,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:44,843 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:44,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:44,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:30:44,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:44,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1485787996, now seen corresponding path program 1 times [2022-12-06 06:30:44,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:44,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116272422] [2022-12-06 06:30:44,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:44,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:45,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116272422] [2022-12-06 06:30:45,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116272422] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:45,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:45,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:30:45,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445010147] [2022-12-06 06:30:45,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:45,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:30:45,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:45,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:30:45,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:30:45,010 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:30:45,010 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 110 transitions, 1194 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-06 06:30:45,010 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:45,010 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:30:45,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:46,427 INFO L130 PetriNetUnfolder]: 8602/12699 cut-off events. [2022-12-06 06:30:46,427 INFO L131 PetriNetUnfolder]: For 71695/73864 co-relation queries the response was YES. [2022-12-06 06:30:46,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59620 conditions, 12699 events. 8602/12699 cut-off events. For 71695/73864 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 78300 event pairs, 1241 based on Foata normal form. 1653/14015 useless extension candidates. Maximal degree in co-relation 59589. Up to 7597 conditions per place. [2022-12-06 06:30:46,524 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 233 selfloop transitions, 10 changer transitions 7/266 dead transitions. [2022-12-06 06:30:46,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 266 transitions, 3402 flow [2022-12-06 06:30:46,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:30:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:30:46,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-12-06 06:30:46,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2022-12-06 06:30:46,528 INFO L175 Difference]: Start difference. First operand has 66 places, 110 transitions, 1194 flow. Second operand 5 states and 88 transitions. [2022-12-06 06:30:46,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 266 transitions, 3402 flow [2022-12-06 06:30:46,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 266 transitions, 3360 flow, removed 21 selfloop flow, removed 0 redundant places. [2022-12-06 06:30:46,586 INFO L231 Difference]: Finished difference. Result has 73 places, 112 transitions, 1197 flow [2022-12-06 06:30:46,587 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1110, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1197, PETRI_PLACES=73, PETRI_TRANSITIONS=112} [2022-12-06 06:30:46,587 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2022-12-06 06:30:46,587 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:46,587 INFO L89 Accepts]: Start accepts. Operand has 73 places, 112 transitions, 1197 flow [2022-12-06 06:30:46,589 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:46,589 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:46,589 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 112 transitions, 1197 flow [2022-12-06 06:30:46,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 112 transitions, 1197 flow [2022-12-06 06:30:47,007 INFO L130 PetriNetUnfolder]: 2397/4214 cut-off events. [2022-12-06 06:30:47,008 INFO L131 PetriNetUnfolder]: For 17184/19154 co-relation queries the response was YES. [2022-12-06 06:30:47,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19555 conditions, 4214 events. 2397/4214 cut-off events. For 17184/19154 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 31366 event pairs, 782 based on Foata normal form. 140/3978 useless extension candidates. Maximal degree in co-relation 19522. Up to 2313 conditions per place. [2022-12-06 06:30:47,238 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 112 transitions, 1197 flow [2022-12-06 06:30:47,238 INFO L188 LiptonReduction]: Number of co-enabled transitions 1424 [2022-12-06 06:30:47,257 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L853-3-->L857: Formula: (and (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_211 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [428] L809-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-06 06:30:47,288 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L853-3-->L857: Formula: (and (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_211 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [487] L789-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~__unbuffered_cnt~0_181 (+ v_~__unbuffered_cnt~0_182 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_182} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] [2022-12-06 06:30:47,319 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L853-3-->L857: Formula: (and (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_211 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [438] L829-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_135 (+ v_~__unbuffered_cnt~0_136 1)) (= |v_P3Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_15|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-06 06:30:47,348 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L853-3-->L857: Formula: (and (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_211 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [426] L759-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= |v_P0Thread1of1ForFork3_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-06 06:30:47,385 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:47,386 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 799 [2022-12-06 06:30:47,386 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 111 transitions, 1207 flow [2022-12-06 06:30:47,386 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-06 06:30:47,387 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:47,387 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:47,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:30:47,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1555123023, now seen corresponding path program 1 times [2022-12-06 06:30:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:47,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344606138] [2022-12-06 06:30:47,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:47,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:47,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:47,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344606138] [2022-12-06 06:30:47,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344606138] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:47,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:47,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209206138] [2022-12-06 06:30:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:47,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:47,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:47,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:47,567 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2022-12-06 06:30:47,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 111 transitions, 1207 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:47,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:47,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2022-12-06 06:30:47,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:48,612 INFO L130 PetriNetUnfolder]: 5739/8835 cut-off events. [2022-12-06 06:30:48,612 INFO L131 PetriNetUnfolder]: For 57547/59197 co-relation queries the response was YES. [2022-12-06 06:30:48,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46367 conditions, 8835 events. 5739/8835 cut-off events. For 57547/59197 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 54784 event pairs, 500 based on Foata normal form. 1019/9599 useless extension candidates. Maximal degree in co-relation 46331. Up to 4181 conditions per place. [2022-12-06 06:30:48,686 INFO L137 encePairwiseOnDemand]: 20/31 looper letters, 207 selfloop transitions, 18 changer transitions 20/261 dead transitions. [2022-12-06 06:30:48,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 261 transitions, 3245 flow [2022-12-06 06:30:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-12-06 06:30:48,688 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2022-12-06 06:30:48,688 INFO L175 Difference]: Start difference. First operand has 72 places, 111 transitions, 1207 flow. Second operand 6 states and 112 transitions. [2022-12-06 06:30:48,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 261 transitions, 3245 flow [2022-12-06 06:30:48,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 261 transitions, 3232 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:48,737 INFO L231 Difference]: Finished difference. Result has 79 places, 118 transitions, 1304 flow [2022-12-06 06:30:48,737 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1304, PETRI_PLACES=79, PETRI_TRANSITIONS=118} [2022-12-06 06:30:48,738 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2022-12-06 06:30:48,738 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:48,738 INFO L89 Accepts]: Start accepts. Operand has 79 places, 118 transitions, 1304 flow [2022-12-06 06:30:48,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:48,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:48,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 118 transitions, 1304 flow [2022-12-06 06:30:48,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 118 transitions, 1304 flow [2022-12-06 06:30:49,025 INFO L130 PetriNetUnfolder]: 1271/2646 cut-off events. [2022-12-06 06:30:49,026 INFO L131 PetriNetUnfolder]: For 14042/17376 co-relation queries the response was YES. [2022-12-06 06:30:49,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13951 conditions, 2646 events. 1271/2646 cut-off events. For 14042/17376 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 20672 event pairs, 211 based on Foata normal form. 212/2668 useless extension candidates. Maximal degree in co-relation 13914. Up to 1411 conditions per place. [2022-12-06 06:30:49,058 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 118 transitions, 1304 flow [2022-12-06 06:30:49,058 INFO L188 LiptonReduction]: Number of co-enabled transitions 1608 [2022-12-06 06:30:49,062 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:49,063 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 325 [2022-12-06 06:30:49,063 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 118 transitions, 1304 flow [2022-12-06 06:30:49,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:49,063 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:49,063 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:49,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:30:49,064 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:49,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1599178664, now seen corresponding path program 1 times [2022-12-06 06:30:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:49,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254741821] [2022-12-06 06:30:49,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:49,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:49,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254741821] [2022-12-06 06:30:49,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254741821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:49,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:49,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:30:49,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708737186] [2022-12-06 06:30:49,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:49,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:30:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:30:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:30:49,502 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 31 [2022-12-06 06:30:49,503 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 118 transitions, 1304 flow. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:49,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:49,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 31 [2022-12-06 06:30:49,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:51,451 INFO L130 PetriNetUnfolder]: 11281/16724 cut-off events. [2022-12-06 06:30:51,452 INFO L131 PetriNetUnfolder]: For 104142/104142 co-relation queries the response was YES. [2022-12-06 06:30:51,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94366 conditions, 16724 events. 11281/16724 cut-off events. For 104142/104142 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 102974 event pairs, 1485 based on Foata normal form. 76/16800 useless extension candidates. Maximal degree in co-relation 94326. Up to 8600 conditions per place. [2022-12-06 06:30:51,555 INFO L137 encePairwiseOnDemand]: 18/31 looper letters, 145 selfloop transitions, 58 changer transitions 103/306 dead transitions. [2022-12-06 06:30:51,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 306 transitions, 3798 flow [2022-12-06 06:30:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2022-12-06 06:30:51,557 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2022-12-06 06:30:51,557 INFO L175 Difference]: Start difference. First operand has 79 places, 118 transitions, 1304 flow. Second operand 6 states and 120 transitions. [2022-12-06 06:30:51,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 306 transitions, 3798 flow [2022-12-06 06:30:52,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 306 transitions, 3610 flow, removed 69 selfloop flow, removed 2 redundant places. [2022-12-06 06:30:52,662 INFO L231 Difference]: Finished difference. Result has 86 places, 129 transitions, 1670 flow [2022-12-06 06:30:52,662 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1670, PETRI_PLACES=86, PETRI_TRANSITIONS=129} [2022-12-06 06:30:52,663 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 40 predicate places. [2022-12-06 06:30:52,663 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:52,663 INFO L89 Accepts]: Start accepts. Operand has 86 places, 129 transitions, 1670 flow [2022-12-06 06:30:52,665 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:52,665 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:52,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 129 transitions, 1670 flow [2022-12-06 06:30:52,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 129 transitions, 1670 flow [2022-12-06 06:30:53,065 INFO L130 PetriNetUnfolder]: 1614/3195 cut-off events. [2022-12-06 06:30:53,066 INFO L131 PetriNetUnfolder]: For 20233/21002 co-relation queries the response was YES. [2022-12-06 06:30:53,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16773 conditions, 3195 events. 1614/3195 cut-off events. For 20233/21002 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 23906 event pairs, 299 based on Foata normal form. 120/3157 useless extension candidates. Maximal degree in co-relation 16732. Up to 1666 conditions per place. [2022-12-06 06:30:53,116 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 129 transitions, 1670 flow [2022-12-06 06:30:53,116 INFO L188 LiptonReduction]: Number of co-enabled transitions 1216 [2022-12-06 06:30:53,122 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:53,123 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 460 [2022-12-06 06:30:53,123 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 129 transitions, 1670 flow [2022-12-06 06:30:53,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:53,123 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:53,123 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:53,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:30:53,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1626021732, now seen corresponding path program 1 times [2022-12-06 06:30:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:53,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254970787] [2022-12-06 06:30:53,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:53,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:53,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:53,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254970787] [2022-12-06 06:30:53,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254970787] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:53,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:53,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 06:30:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794039782] [2022-12-06 06:30:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:53,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:30:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:53,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:30:53,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:30:53,347 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2022-12-06 06:30:53,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 129 transitions, 1670 flow. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:53,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:53,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2022-12-06 06:30:53,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:54,550 INFO L130 PetriNetUnfolder]: 3970/6356 cut-off events. [2022-12-06 06:30:54,550 INFO L131 PetriNetUnfolder]: For 46691/47175 co-relation queries the response was YES. [2022-12-06 06:30:54,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34633 conditions, 6356 events. 3970/6356 cut-off events. For 46691/47175 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 39002 event pairs, 347 based on Foata normal form. 441/6674 useless extension candidates. Maximal degree in co-relation 34589. Up to 3057 conditions per place. [2022-12-06 06:30:54,597 INFO L137 encePairwiseOnDemand]: 20/27 looper letters, 186 selfloop transitions, 18 changer transitions 56/279 dead transitions. [2022-12-06 06:30:54,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 279 transitions, 3932 flow [2022-12-06 06:30:54,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:30:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:30:54,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 126 transitions. [2022-12-06 06:30:54,601 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-06 06:30:54,601 INFO L175 Difference]: Start difference. First operand has 83 places, 129 transitions, 1670 flow. Second operand 7 states and 126 transitions. [2022-12-06 06:30:54,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 279 transitions, 3932 flow [2022-12-06 06:30:54,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 279 transitions, 3865 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-12-06 06:30:54,665 INFO L231 Difference]: Finished difference. Result has 88 places, 129 transitions, 1623 flow [2022-12-06 06:30:54,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1623, PETRI_PLACES=88, PETRI_TRANSITIONS=129} [2022-12-06 06:30:54,666 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 42 predicate places. [2022-12-06 06:30:54,666 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:54,666 INFO L89 Accepts]: Start accepts. Operand has 88 places, 129 transitions, 1623 flow [2022-12-06 06:30:54,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:54,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:54,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 129 transitions, 1623 flow [2022-12-06 06:30:54,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 129 transitions, 1623 flow [2022-12-06 06:30:54,852 INFO L130 PetriNetUnfolder]: 969/2148 cut-off events. [2022-12-06 06:30:54,852 INFO L131 PetriNetUnfolder]: For 9689/10150 co-relation queries the response was YES. [2022-12-06 06:30:54,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11031 conditions, 2148 events. 969/2148 cut-off events. For 9689/10150 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16185 event pairs, 75 based on Foata normal form. 18/2089 useless extension candidates. Maximal degree in co-relation 10989. Up to 891 conditions per place. [2022-12-06 06:30:54,878 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 129 transitions, 1623 flow [2022-12-06 06:30:54,878 INFO L188 LiptonReduction]: Number of co-enabled transitions 1230 [2022-12-06 06:30:54,893 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L853-3-->L857: Formula: (and (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_211 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [428] L809-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#res.offset_7| 0) (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= |v_P2Thread1of1ForFork2_#res.base_7| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] [2022-12-06 06:30:54,918 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L853-3-->L857: Formula: (and (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_211 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [487] L789-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res#1.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res#1.base_7| 0) (= v_~__unbuffered_cnt~0_181 (+ v_~__unbuffered_cnt~0_182 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_182} OutVars{P1Thread1of1ForFork1_#res#1.base=|v_P1Thread1of1ForFork1_#res#1.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_181, P1Thread1of1ForFork1_#res#1.offset=|v_P1Thread1of1ForFork1_#res#1.offset_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res#1.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res#1.offset] [2022-12-06 06:30:54,941 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L853-3-->L857: Formula: (and (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_211 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [426] L759-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork3_#res.offset_7| 0) (= |v_P0Thread1of1ForFork3_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset] [2022-12-06 06:30:54,965 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [507] L853-3-->L857: Formula: (and (= v_~main$tmp_guard0~0_38 (ite (= (ite (= v_~__unbuffered_cnt~0_211 4) 1 0) 0) 0 1)) (= (mod v_~main$tmp_guard0~0_38 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_21|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_211, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_38, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ~main$tmp_guard0~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1] and [438] L829-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.offset_15| 0) (= v_~__unbuffered_cnt~0_135 (+ v_~__unbuffered_cnt~0_136 1)) (= |v_P3Thread1of1ForFork0_#res.base_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_136} OutVars{P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_15|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] [2022-12-06 06:30:55,010 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:30:55,011 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 345 [2022-12-06 06:30:55,011 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 128 transitions, 1629 flow [2022-12-06 06:30:55,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:55,011 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:55,012 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:55,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 06:30:55,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:55,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2053662073, now seen corresponding path program 1 times [2022-12-06 06:30:55,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:55,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044817686] [2022-12-06 06:30:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:55,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:55,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:55,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044817686] [2022-12-06 06:30:55,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044817686] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:55,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:55,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:30:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821972912] [2022-12-06 06:30:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:55,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:30:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:55,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:30:55,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:30:55,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 31 [2022-12-06 06:30:55,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 128 transitions, 1629 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:55,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:55,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 31 [2022-12-06 06:30:55,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:57,211 INFO L130 PetriNetUnfolder]: 5534/8890 cut-off events. [2022-12-06 06:30:57,211 INFO L131 PetriNetUnfolder]: For 54554/54865 co-relation queries the response was YES. [2022-12-06 06:30:57,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49928 conditions, 8890 events. 5534/8890 cut-off events. For 54554/54865 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 56808 event pairs, 905 based on Foata normal form. 87/8783 useless extension candidates. Maximal degree in co-relation 49883. Up to 3863 conditions per place. [2022-12-06 06:30:57,271 INFO L137 encePairwiseOnDemand]: 25/31 looper letters, 162 selfloop transitions, 43 changer transitions 11/232 dead transitions. [2022-12-06 06:30:57,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 232 transitions, 3103 flow [2022-12-06 06:30:57,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 06:30:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 06:30:57,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2022-12-06 06:30:57,273 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2022-12-06 06:30:57,273 INFO L175 Difference]: Start difference. First operand has 87 places, 128 transitions, 1629 flow. Second operand 6 states and 108 transitions. [2022-12-06 06:30:57,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 232 transitions, 3103 flow [2022-12-06 06:30:57,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 232 transitions, 2776 flow, removed 110 selfloop flow, removed 5 redundant places. [2022-12-06 06:30:57,607 INFO L231 Difference]: Finished difference. Result has 90 places, 135 transitions, 1771 flow [2022-12-06 06:30:57,607 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1771, PETRI_PLACES=90, PETRI_TRANSITIONS=135} [2022-12-06 06:30:57,608 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 44 predicate places. [2022-12-06 06:30:57,608 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:57,608 INFO L89 Accepts]: Start accepts. Operand has 90 places, 135 transitions, 1771 flow [2022-12-06 06:30:57,610 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:57,610 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:57,610 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 135 transitions, 1771 flow [2022-12-06 06:30:57,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 135 transitions, 1771 flow [2022-12-06 06:30:57,856 INFO L130 PetriNetUnfolder]: 1460/3063 cut-off events. [2022-12-06 06:30:57,856 INFO L131 PetriNetUnfolder]: For 13108/13390 co-relation queries the response was YES. [2022-12-06 06:30:57,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14424 conditions, 3063 events. 1460/3063 cut-off events. For 13108/13390 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 23969 event pairs, 166 based on Foata normal form. 13/2933 useless extension candidates. Maximal degree in co-relation 14381. Up to 1190 conditions per place. [2022-12-06 06:30:57,897 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 135 transitions, 1771 flow [2022-12-06 06:30:57,897 INFO L188 LiptonReduction]: Number of co-enabled transitions 1314 [2022-12-06 06:30:57,900 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:30:57,901 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 293 [2022-12-06 06:30:57,901 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 135 transitions, 1771 flow [2022-12-06 06:30:57,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:57,901 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:30:57,901 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:30:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 06:30:57,902 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:30:57,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:30:57,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2083644541, now seen corresponding path program 2 times [2022-12-06 06:30:57,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:30:57,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463293047] [2022-12-06 06:30:57,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:30:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:30:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:30:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:30:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:30:58,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463293047] [2022-12-06 06:30:58,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463293047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:30:58,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:30:58,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 06:30:58,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798143811] [2022-12-06 06:30:58,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:30:58,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 06:30:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:30:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 06:30:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-06 06:30:58,099 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2022-12-06 06:30:58,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 135 transitions, 1771 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:30:58,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:30:58,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2022-12-06 06:30:58,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:30:59,155 INFO L130 PetriNetUnfolder]: 4903/7851 cut-off events. [2022-12-06 06:30:59,156 INFO L131 PetriNetUnfolder]: For 55987/56485 co-relation queries the response was YES. [2022-12-06 06:30:59,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43667 conditions, 7851 events. 4903/7851 cut-off events. For 55987/56485 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 50728 event pairs, 434 based on Foata normal form. 219/7890 useless extension candidates. Maximal degree in co-relation 43621. Up to 3461 conditions per place. [2022-12-06 06:30:59,199 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 130 selfloop transitions, 21 changer transitions 95/256 dead transitions. [2022-12-06 06:30:59,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 256 transitions, 3772 flow [2022-12-06 06:30:59,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 06:30:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 06:30:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2022-12-06 06:30:59,201 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5041666666666667 [2022-12-06 06:30:59,201 INFO L175 Difference]: Start difference. First operand has 90 places, 135 transitions, 1771 flow. Second operand 8 states and 121 transitions. [2022-12-06 06:30:59,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 256 transitions, 3772 flow [2022-12-06 06:30:59,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 256 transitions, 3715 flow, removed 28 selfloop flow, removed 1 redundant places. [2022-12-06 06:30:59,415 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 1108 flow [2022-12-06 06:30:59,415 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1108, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2022-12-06 06:30:59,415 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 53 predicate places. [2022-12-06 06:30:59,415 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:30:59,415 INFO L89 Accepts]: Start accepts. Operand has 99 places, 94 transitions, 1108 flow [2022-12-06 06:30:59,417 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:30:59,417 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:30:59,417 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 94 transitions, 1108 flow [2022-12-06 06:30:59,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 94 transitions, 1108 flow [2022-12-06 06:30:59,487 INFO L130 PetriNetUnfolder]: 406/915 cut-off events. [2022-12-06 06:30:59,487 INFO L131 PetriNetUnfolder]: For 3628/3776 co-relation queries the response was YES. [2022-12-06 06:30:59,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4570 conditions, 915 events. 406/915 cut-off events. For 3628/3776 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5873 event pairs, 38 based on Foata normal form. 4/877 useless extension candidates. Maximal degree in co-relation 4529. Up to 310 conditions per place. [2022-12-06 06:30:59,494 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 94 transitions, 1108 flow [2022-12-06 06:30:59,494 INFO L188 LiptonReduction]: Number of co-enabled transitions 794 [2022-12-06 06:31:00,652 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] $Ultimate##0-->L752: Formula: (and (= v_~a~0_37 1) (= v_~x~0_470 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_17| v_P0Thread1of1ForFork3_~arg.offset_17) (= v_P0Thread1of1ForFork3_~arg.base_17 |v_P0Thread1of1ForFork3_#in~arg.base_17|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} OutVars{~a~0=v_~a~0_37, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_17, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_17, ~x~0=v_~x~0_470, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~x~0] and [389] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_112 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse1 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x~0_59 (ite .cse1 v_~x$w_buff0~0_32 (ite .cse2 v_~x$w_buff1~0_41 v_~x~0_60))) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x$r_buff1_thd3~0_23 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:31:00,749 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] $Ultimate##0-->L752: Formula: (and (= v_~a~0_37 1) (= v_~x~0_470 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_17| v_P0Thread1of1ForFork3_~arg.offset_17) (= v_P0Thread1of1ForFork3_~arg.base_17 |v_P0Thread1of1ForFork3_#in~arg.base_17|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} OutVars{~a~0=v_~a~0_37, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_17, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_17, ~x~0=v_~x~0_470, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~x~0] and [389] L802-->L809: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_24 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_111 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff0_used~0_112 256) 0)) .cse5)) (.cse0 (and .cse4 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_101 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$r_buff0_thd3~0_28) v_~x$r_buff0_thd3~0_27) (= (ite .cse1 0 v_~x$w_buff0_used~0_112) v_~x$w_buff0_used~0_111) (= v_~x~0_59 (ite .cse1 v_~x$w_buff0~0_32 (ite .cse2 v_~x$w_buff1~0_41 v_~x~0_60))) (= (ite (or .cse0 .cse2) 0 v_~x$w_buff1_used~0_101) v_~x$w_buff1_used~0_100) (= v_~x$r_buff1_thd3~0_23 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_100 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_27 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_24))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_24, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_101, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_28, ~x~0=v_~x~0_60, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_112} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_41, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_23, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_100, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_27, ~x~0=v_~x~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_111} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:31:00,851 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] $Ultimate##0-->L752: Formula: (and (= v_~a~0_37 1) (= v_~x~0_470 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_17| v_P0Thread1of1ForFork3_~arg.offset_17) (= v_P0Thread1of1ForFork3_~arg.base_17 |v_P0Thread1of1ForFork3_#in~arg.base_17|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} OutVars{~a~0=v_~a~0_37, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_17, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_17, ~x~0=v_~x~0_470, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~x~0] and [461] $Ultimate##0-->L779: Formula: (and (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| 0)) (= v_~x$r_buff1_thd4~0_47 v_~x$r_buff0_thd4~0_47) (= v_~x$w_buff0_used~0_234 v_~x$w_buff1_used~0_203) (= v_~x$r_buff0_thd2~0_58 1) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_11| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~x$r_buff1_thd2~0_41 v_~x$r_buff0_thd2~0_59) (= v_~x$r_buff1_thd1~0_39 v_~x$r_buff0_thd1~0_45) (= (ite (not (and (not (= (mod v_~x$w_buff0_used~0_233 256) 0)) (not (= (mod v_~x$w_buff1_used~0_203 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|) (= v_~x$r_buff1_thd3~0_39 v_~x$r_buff0_thd3~0_45) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_7| |v_P1Thread1of1ForFork1_~arg#1.offset_7|) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_7| |v_P1Thread1of1ForFork1_~arg#1.base_7|) (= v_~x$w_buff0_used~0_233 1) (= 2 v_~x$w_buff0~0_116) (= v_~x$r_buff0_thd0~0_119 v_~x$r_buff1_thd0~0_116) (= v_~x$w_buff0~0_117 v_~x$w_buff1~0_108)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_117, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_119, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_45, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_47, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_45, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_59, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_234, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_116, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_119, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_45, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_7|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_7|, ~x$w_buff1~0=v_~x$w_buff1~0_108, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_39, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_41, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_203, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_39, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_47, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_45, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_58, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_116, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_47, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_233, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_7|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_7|, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_11|} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] [2022-12-06 06:31:00,973 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [527] $Ultimate##0-->L752: Formula: (and (= v_~a~0_37 1) (= v_~x~0_470 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_17| v_P0Thread1of1ForFork3_~arg.offset_17) (= v_P0Thread1of1ForFork3_~arg.base_17 |v_P0Thread1of1ForFork3_#in~arg.base_17|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} OutVars{~a~0=v_~a~0_37, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_17|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_17, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_17, ~x~0=v_~x~0_470, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_17|} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_~arg.offset, ~x~0] and [396] L822-->L829: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_151 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_152 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_59 v_~x~0_88))) (= v_~x$w_buff0_used~0_151 (ite .cse0 0 v_~x$w_buff0_used~0_152)) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$w_buff1_used~0_132 256) 0))) (and (not (= (mod v_~x$r_buff0_thd4~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_26) v_~x$r_buff0_thd4~0_25)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_26, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_152} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_59, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_25, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_151} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0] [2022-12-06 06:32:54,724 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L799-->L802: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [530] $Ultimate##0-->L822: Formula: (and (= |v_P3Thread1of1ForFork0_#in~arg.offset_21| v_P3Thread1of1ForFork0_~arg.offset_21) (= v_~z~0_88 2) (= v_~a~0_41 v_~__unbuffered_p3_EAX~0_71) (= |v_P3Thread1of1ForFork0_#in~arg.base_21| v_P3Thread1of1ForFork0_~arg.base_21)) InVars {~a~0=v_~a~0_41, P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_21|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_21|} OutVars{~a~0=v_~a~0_41, P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_21|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_71, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_21, ~z~0=v_~z~0_88, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_21|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_21} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0, P3Thread1of1ForFork0_~arg.offset, ~z~0, P3Thread1of1ForFork0_~arg.base] [2022-12-06 06:32:54,750 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 06:32:54,750 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 115335 [2022-12-06 06:32:54,751 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 1083 flow [2022-12-06 06:32:54,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:32:54,751 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:54,751 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:54,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 06:32:54,751 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:32:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1608285309, now seen corresponding path program 1 times [2022-12-06 06:32:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:54,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989937894] [2022-12-06 06:32:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:32:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:32:54,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:32:54,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989937894] [2022-12-06 06:32:54,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989937894] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:32:54,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:32:54,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:32:54,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941061715] [2022-12-06 06:32:54,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:32:54,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 06:32:54,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:32:54,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 06:32:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 06:32:54,972 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2022-12-06 06:32:54,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 1083 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-06 06:32:54,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:32:54,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2022-12-06 06:32:54,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:32:55,608 INFO L130 PetriNetUnfolder]: 2677/4252 cut-off events. [2022-12-06 06:32:55,608 INFO L131 PetriNetUnfolder]: For 26743/26749 co-relation queries the response was YES. [2022-12-06 06:32:55,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23967 conditions, 4252 events. 2677/4252 cut-off events. For 26743/26749 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 23730 event pairs, 793 based on Foata normal form. 2/4252 useless extension candidates. Maximal degree in co-relation 23917. Up to 2150 conditions per place. [2022-12-06 06:32:55,634 INFO L137 encePairwiseOnDemand]: 28/31 looper letters, 49 selfloop transitions, 1 changer transitions 88/140 dead transitions. [2022-12-06 06:32:55,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 140 transitions, 1950 flow [2022-12-06 06:32:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 06:32:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 06:32:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-06 06:32:55,636 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-06 06:32:55,636 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 1083 flow. Second operand 4 states and 62 transitions. [2022-12-06 06:32:55,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 140 transitions, 1950 flow [2022-12-06 06:32:55,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 140 transitions, 1730 flow, removed 43 selfloop flow, removed 15 redundant places. [2022-12-06 06:32:55,748 INFO L231 Difference]: Finished difference. Result has 80 places, 48 transitions, 444 flow [2022-12-06 06:32:55,748 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=444, PETRI_PLACES=80, PETRI_TRANSITIONS=48} [2022-12-06 06:32:55,749 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 34 predicate places. [2022-12-06 06:32:55,749 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:32:55,750 INFO L89 Accepts]: Start accepts. Operand has 80 places, 48 transitions, 444 flow [2022-12-06 06:32:55,750 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:32:55,751 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:55,751 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 48 transitions, 444 flow [2022-12-06 06:32:55,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 48 transitions, 444 flow [2022-12-06 06:32:55,783 INFO L130 PetriNetUnfolder]: 175/407 cut-off events. [2022-12-06 06:32:55,784 INFO L131 PetriNetUnfolder]: For 2071/2144 co-relation queries the response was YES. [2022-12-06 06:32:55,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1657 conditions, 407 events. 175/407 cut-off events. For 2071/2144 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2365 event pairs, 16 based on Foata normal form. 32/412 useless extension candidates. Maximal degree in co-relation 1620. Up to 131 conditions per place. [2022-12-06 06:32:55,787 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 48 transitions, 444 flow [2022-12-06 06:32:55,787 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 06:32:55,797 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L799-->L802: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [382] L782-->L789: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd2~0_33 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_125 256) 0))) (.cse2 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse1 (and (not (= (mod v_~x$w_buff1_used~0_113 256) 0)) .cse2)) (.cse4 (and .cse5 .cse3)) (.cse0 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_126 256) 0))))) (and (= (ite .cse0 v_~x$w_buff0~0_40 (ite .cse1 v_~x$w_buff1~0_49 v_~x~0_72)) v_~x~0_71) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= 0 (mod v_~x$w_buff1_used~0_112 256))) .cse2) (and .cse3 (not (= (mod v_~x$r_buff0_thd2~0_32 256) 0)))) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$r_buff0_thd2~0_32 (ite .cse4 0 v_~x$r_buff0_thd2~0_33)) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_113) v_~x$w_buff1_used~0_112) (= (ite .cse0 0 v_~x$w_buff0_used~0_126) v_~x$w_buff0_used~0_125)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_113, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_33, ~x~0=v_~x~0_72, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_126} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_49, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_112, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_32, ~x~0=v_~x~0_71, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_125} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:32:55,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [388] L799-->L802: Formula: (= v_~z~0_1 1) InVars {} OutVars{~z~0=v_~z~0_1} AuxVars[] AssignedVars[~z~0] and [475] $Ultimate##0-->L819: Formula: (and (= v_~z~0_31 2) (= |v_P3Thread1of1ForFork0_#in~arg.base_5| v_P3Thread1of1ForFork0_~arg.base_5) (= v_P3Thread1of1ForFork0_~arg.offset_5 |v_P3Thread1of1ForFork0_#in~arg.offset_5|)) InVars {P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|} OutVars{P3Thread1of1ForFork0_#in~arg.offset=|v_P3Thread1of1ForFork0_#in~arg.offset_5|, P3Thread1of1ForFork0_~arg.offset=v_P3Thread1of1ForFork0_~arg.offset_5, ~z~0=v_~z~0_31, P3Thread1of1ForFork0_#in~arg.base=|v_P3Thread1of1ForFork0_#in~arg.base_5|, P3Thread1of1ForFork0_~arg.base=v_P3Thread1of1ForFork0_~arg.base_5} AuxVars[] AssignedVars[P3Thread1of1ForFork0_~arg.offset, ~z~0, P3Thread1of1ForFork0_~arg.base] [2022-12-06 06:32:56,205 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [381] L779-->L782: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_1) InVars {~y~0=v_~y~0_1} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] and [541] $Ultimate##0-->L789: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd2~0_140 256) 0))) (.cse2 (not (= (mod v_~x$w_buff0_used~0_591 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_175 256) 0)))) (let ((.cse1 (and .cse2 .cse5)) (.cse4 (and (not (= (mod v_~x$w_buff0_used~0_592 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_546 256) 0))))) (and (= (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_546) v_~x$w_buff1_used~0_545) (= v_~x$r_buff1_thd2~0_139 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd2~0_174 256) 0))) (and (not (= (mod v_~x$w_buff1_used~0_545 256) 0)) .cse3)) 0 v_~x$r_buff1_thd2~0_140)) (= (ite .cse4 0 v_~x$w_buff0_used~0_592) v_~x$w_buff0_used~0_591) (= |v_P2Thread1of1ForFork2_#in~arg.base_15| v_P2Thread1of1ForFork2_~arg.base_15) (= v_~y~0_35 1) (= v_~x$r_buff0_thd2~0_174 (ite .cse1 0 v_~x$r_buff0_thd2~0_175)) (= v_P2Thread1of1ForFork2_~arg.offset_15 |v_P2Thread1of1ForFork2_#in~arg.offset_15|) (= (ite .cse4 v_~x$w_buff0~0_334 (ite .cse0 v_~x$w_buff1~0_314 v_~x~0_507)) v_~x~0_506) (= v_~z~0_106 1)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_334, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_140, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_546, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_175, ~x~0=v_~x~0_507, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_592} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_334, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_15|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_15, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_139, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_545, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_174, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_591, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_15, ~z~0=v_~z~0_106, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_15|, ~y~0=v_~y~0_35, ~x~0=v_~x~0_506} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~z~0, ~x$r_buff0_thd2~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:32:56,602 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [546] $Ultimate##0-->L782: Formula: (and (= v_~x$r_buff0_thd4~0_113 v_~x$r_buff1_thd4~0_109) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35| (ite (not (and (not (= (mod v_~x$w_buff0_used~0_603 256) 0)) (not (= (mod v_~x$w_buff1_used~0_557 256) 0)))) 1 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|) (= v_~y~0_47 v_~__unbuffered_p1_EAX~0_72) (= v_~x$r_buff0_thd3~0_147 v_~x$r_buff1_thd3~0_137) (= v_~x$w_buff0_used~0_604 v_~x$w_buff1_used~0_557) (= v_~x$r_buff0_thd2~0_182 1) (= v_~x$w_buff0~0_341 v_~x$w_buff1~0_320) (not (= |v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35| 0)) (= v_~x$r_buff0_thd1~0_105 v_~x$r_buff1_thd1~0_100) (= |v_P1Thread1of1ForFork1_#in~arg#1.offset_31| |v_P1Thread1of1ForFork1_~arg#1.offset_31|) (= v_~x$r_buff0_thd0~0_288 v_~x$r_buff1_thd0~0_289) (= v_~x$w_buff0_used~0_603 1) (= |v_P1Thread1of1ForFork1_#in~arg#1.base_31| |v_P1Thread1of1ForFork1_~arg#1.base_31|) (= 2 v_~x$w_buff0~0_340) (= v_~x$r_buff0_thd2~0_183 v_~x$r_buff1_thd2~0_147)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_341, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_288, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_113, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_147, ~y~0=v_~y~0_47, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_183, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_604, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_31|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_340, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_288, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_105, P1Thread1of1ForFork1_~arg#1.base=|v_P1Thread1of1ForFork1_~arg#1.base_31|, P1Thread1of1ForFork1_~arg#1.offset=|v_P1Thread1of1ForFork1_~arg#1.offset_31|, ~x$w_buff1~0=v_~x$w_buff1~0_320, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_137, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_147, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_557, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_100, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_113, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_147, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_182, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_289, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_109, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_~expression#1_35|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_603, P1Thread1of1ForFork1_#in~arg#1.base=|v_P1Thread1of1ForFork1_#in~arg#1.base_31|, P1Thread1of1ForFork1_#in~arg#1.offset=|v_P1Thread1of1ForFork1_#in~arg#1.offset_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1_35|, ~y~0=v_~y~0_47} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork1_~arg#1.base, P1Thread1of1ForFork1_~arg#1.offset, ~x$w_buff1~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0, ~x$r_buff1_thd4~0, P1Thread1of1ForFork1___VERIFIER_assert_~expression#1, ~x$w_buff0_used~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression#1] and [543] $Ultimate##0-->L809: Formula: (let ((.cse2 (not (= (mod v_~x$w_buff0_used~0_595 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_144 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd3~0_134 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_550 256) 0)))) (.cse4 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~x$w_buff0_used~0_596 256) 0)) .cse5))) (and (= v_~z~0_110 1) (= (ite .cse0 v_~x$w_buff0~0_336 (ite .cse1 v_~x$w_buff1~0_316 v_~x~0_511)) v_~x~0_510) (= v_~x$r_buff1_thd3~0_133 (ite (or (and .cse2 (not (= (mod v_~x$r_buff0_thd3~0_143 256) 0))) (and .cse3 (not (= (mod v_~x$w_buff1_used~0_549 256) 0)))) 0 v_~x$r_buff1_thd3~0_134)) (= (ite (or .cse1 .cse4) 0 v_~x$w_buff1_used~0_550) v_~x$w_buff1_used~0_549) (= (ite .cse4 0 v_~x$r_buff0_thd3~0_144) v_~x$r_buff0_thd3~0_143) (= |v_P2Thread1of1ForFork2_#in~arg.base_19| v_P2Thread1of1ForFork2_~arg.base_19) (= v_~x$w_buff0_used~0_595 (ite .cse0 0 v_~x$w_buff0_used~0_596)) (= v_~y~0_39 1) (= v_P2Thread1of1ForFork2_~arg.offset_19 |v_P2Thread1of1ForFork2_#in~arg.offset_19|)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_336, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_19|, ~x$w_buff1~0=v_~x$w_buff1~0_316, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_134, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_550, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_144, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_19|, ~x~0=v_~x~0_511, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_596} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_336, P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_19|, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_19, ~x$w_buff1~0=v_~x$w_buff1~0_316, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_133, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_549, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_143, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_595, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_19, ~z~0=v_~z~0_110, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_19|, ~y~0=v_~y~0_39, ~x~0=v_~x~0_510} AuxVars[] AssignedVars[P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, ~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~z~0, ~y~0, ~x~0, ~x$w_buff0_used~0] [2022-12-06 06:32:56,810 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 06:32:56,811 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1062 [2022-12-06 06:32:56,811 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 45 transitions, 471 flow [2022-12-06 06:32:56,811 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-06 06:32:56,812 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:56,812 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:56,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-06 06:32:56,812 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:32:56,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1202344373, now seen corresponding path program 1 times [2022-12-06 06:32:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:56,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895040904] [2022-12-06 06:32:56,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:56,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:32:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:32:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:32:58,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895040904] [2022-12-06 06:32:58,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895040904] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:32:58,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:32:58,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 06:32:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025408464] [2022-12-06 06:32:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:32:58,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 06:32:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:32:58,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 06:32:58,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-06 06:32:58,006 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 26 [2022-12-06 06:32:58,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 45 transitions, 471 flow. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:32:58,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:32:58,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 26 [2022-12-06 06:32:58,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:32:58,400 INFO L130 PetriNetUnfolder]: 1079/1855 cut-off events. [2022-12-06 06:32:58,400 INFO L131 PetriNetUnfolder]: For 8675/8675 co-relation queries the response was YES. [2022-12-06 06:32:58,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9192 conditions, 1855 events. 1079/1855 cut-off events. For 8675/8675 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10095 event pairs, 177 based on Foata normal form. 4/1856 useless extension candidates. Maximal degree in co-relation 9152. Up to 776 conditions per place. [2022-12-06 06:32:58,407 INFO L137 encePairwiseOnDemand]: 17/26 looper letters, 49 selfloop transitions, 6 changer transitions 50/106 dead transitions. [2022-12-06 06:32:58,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 106 transitions, 1041 flow [2022-12-06 06:32:58,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 06:32:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 06:32:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-06 06:32:58,408 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36813186813186816 [2022-12-06 06:32:58,408 INFO L175 Difference]: Start difference. First operand has 73 places, 45 transitions, 471 flow. Second operand 7 states and 67 transitions. [2022-12-06 06:32:58,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 106 transitions, 1041 flow [2022-12-06 06:32:58,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 106 transitions, 882 flow, removed 59 selfloop flow, removed 13 redundant places. [2022-12-06 06:32:58,432 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 319 flow [2022-12-06 06:32:58,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=319, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2022-12-06 06:32:58,432 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2022-12-06 06:32:58,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:32:58,432 INFO L89 Accepts]: Start accepts. Operand has 69 places, 41 transitions, 319 flow [2022-12-06 06:32:58,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:32:58,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:32:58,434 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 41 transitions, 319 flow [2022-12-06 06:32:58,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 41 transitions, 319 flow [2022-12-06 06:32:58,460 INFO L130 PetriNetUnfolder]: 122/298 cut-off events. [2022-12-06 06:32:58,460 INFO L131 PetriNetUnfolder]: For 1628/1709 co-relation queries the response was YES. [2022-12-06 06:32:58,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 298 events. 122/298 cut-off events. For 1628/1709 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1528 event pairs, 17 based on Foata normal form. 33/312 useless extension candidates. Maximal degree in co-relation 1045. Up to 99 conditions per place. [2022-12-06 06:32:58,462 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 41 transitions, 319 flow [2022-12-06 06:32:58,462 INFO L188 LiptonReduction]: Number of co-enabled transitions 226 [2022-12-06 06:32:58,468 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:32:58,469 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 37 [2022-12-06 06:32:58,469 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 41 transitions, 319 flow [2022-12-06 06:32:58,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:32:58,469 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:32:58,469 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:58,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 06:32:58,470 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:32:58,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:32:58,470 INFO L85 PathProgramCache]: Analyzing trace with hash -670576984, now seen corresponding path program 1 times [2022-12-06 06:32:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:32:58,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163501913] [2022-12-06 06:32:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:32:58,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:32:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:32:58,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:32:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:32:58,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:32:58,584 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:32:58,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-06 06:32:58,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-06 06:32:58,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-06 06:32:58,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-06 06:32:58,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-06 06:32:58,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-06 06:32:58,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-06 06:32:58,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-06 06:32:58,587 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:32:58,592 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:32:58,592 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:32:58,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:32:58 BasicIcfg [2022-12-06 06:32:58,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:32:58,681 INFO L158 Benchmark]: Toolchain (without parser) took 156436.82ms. Allocated memory was 206.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 180.7MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 677.1MB. Max. memory is 8.0GB. [2022-12-06 06:32:58,682 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory was 183.6MB in the beginning and 183.6MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:32:58,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.37ms. Allocated memory is still 206.6MB. Free memory was 180.5MB in the beginning and 152.8MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-12-06 06:32:58,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.70ms. Allocated memory is still 206.6MB. Free memory was 152.8MB in the beginning and 149.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:32:58,682 INFO L158 Benchmark]: Boogie Preprocessor took 42.51ms. Allocated memory is still 206.6MB. Free memory was 149.6MB in the beginning and 148.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:32:58,682 INFO L158 Benchmark]: RCFGBuilder took 844.15ms. Allocated memory is still 206.6MB. Free memory was 147.5MB in the beginning and 109.2MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2022-12-06 06:32:58,683 INFO L158 Benchmark]: TraceAbstraction took 154845.34ms. Allocated memory was 206.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 108.7MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 604.7MB. Max. memory is 8.0GB. [2022-12-06 06:32:58,684 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.12ms. Allocated memory is still 206.6MB. Free memory was 183.6MB in the beginning and 183.6MB in the end (delta: 75.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 627.37ms. Allocated memory is still 206.6MB. Free memory was 180.5MB in the beginning and 152.8MB in the end (delta: 27.8MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.70ms. Allocated memory is still 206.6MB. Free memory was 152.8MB in the beginning and 149.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.51ms. Allocated memory is still 206.6MB. Free memory was 149.6MB in the beginning and 148.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 844.15ms. Allocated memory is still 206.6MB. Free memory was 147.5MB in the beginning and 109.2MB in the end (delta: 38.3MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 154845.34ms. Allocated memory was 206.6MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 108.7MB in the beginning and 2.8GB in the end (delta: -2.6GB). Peak memory consumption was 604.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 135 PlacesBefore, 46 PlacesAfterwards, 124 TransitionsBefore, 34 TransitionsAfterwards, 3044 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 41 TrivialYvCompositions, 52 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2318, independent: 2249, independent conditional: 2249, independent unconditional: 0, dependent: 69, dependent conditional: 69, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2318, independent: 2249, independent conditional: 0, independent unconditional: 2249, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2318, independent: 2249, independent conditional: 0, independent unconditional: 2249, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2318, independent: 2249, independent conditional: 0, independent unconditional: 2249, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1883, independent: 1836, independent conditional: 0, independent unconditional: 1836, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1883, independent: 1790, independent conditional: 0, independent unconditional: 1790, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 93, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 360, independent: 65, independent conditional: 0, independent unconditional: 65, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2318, independent: 413, independent conditional: 0, independent unconditional: 413, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 1883, unknown conditional: 0, unknown unconditional: 1883] , Statistics on independence cache: Total cache size (in pairs): 2884, Positive cache size: 2837, Positive conditional cache size: 0, Positive unconditional cache size: 2837, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, 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, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 384 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 173, independent: 145, independent conditional: 145, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 173, independent: 145, independent conditional: 14, independent unconditional: 131, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 173, independent: 145, independent conditional: 14, independent unconditional: 131, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 173, independent: 145, independent conditional: 14, independent unconditional: 131, dependent: 28, dependent conditional: 3, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 153, independent: 132, independent conditional: 13, independent unconditional: 119, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 153, independent: 126, independent conditional: 0, independent unconditional: 126, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 21, dependent conditional: 2, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 48, dependent conditional: 11, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 153, unknown conditional: 15, unknown unconditional: 138] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 132, Positive conditional cache size: 13, Positive unconditional cache size: 119, Negative cache size: 21, Negative conditional cache size: 2, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 442 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 124, independent: 114, independent conditional: 114, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 124, independent: 114, independent conditional: 26, independent unconditional: 88, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 124, independent: 114, independent conditional: 15, independent unconditional: 99, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 124, independent: 114, independent conditional: 15, independent unconditional: 99, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 16, independent conditional: 5, independent unconditional: 11, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 124, independent: 98, independent conditional: 10, independent unconditional: 88, dependent: 8, dependent conditional: 1, dependent unconditional: 7, unknown: 18, unknown conditional: 7, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 148, Positive conditional cache size: 18, Positive unconditional cache size: 130, Negative cache size: 23, Negative conditional cache size: 4, Negative unconditional cache size: 19, 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, 47 PlacesBefore, 47 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 582 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 193, independent: 175, independent conditional: 175, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 193, independent: 175, independent conditional: 33, independent unconditional: 142, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 193, independent: 175, independent conditional: 22, independent unconditional: 153, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 193, independent: 175, independent conditional: 22, independent unconditional: 153, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 1, independent unconditional: 2, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 193, independent: 172, independent conditional: 21, independent unconditional: 151, dependent: 16, dependent conditional: 3, dependent unconditional: 13, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 151, Positive conditional cache size: 19, Positive unconditional cache size: 132, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 11, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 52 PlacesBefore, 52 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 608 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 170, independent: 153, independent conditional: 153, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 170, independent: 153, independent conditional: 45, independent unconditional: 108, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 170, independent: 153, independent conditional: 38, independent unconditional: 115, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 170, independent: 153, independent conditional: 38, independent unconditional: 115, dependent: 17, dependent conditional: 6, dependent unconditional: 11, 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: 170, independent: 153, independent conditional: 38, independent unconditional: 115, dependent: 17, dependent conditional: 6, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 176, Positive cache size: 151, Positive conditional cache size: 19, Positive unconditional cache size: 132, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 7, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 57 PlacesBefore, 57 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 265, independent: 238, independent conditional: 238, independent unconditional: 0, dependent: 27, dependent conditional: 27, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 265, independent: 238, independent conditional: 48, independent unconditional: 190, dependent: 27, dependent conditional: 10, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 275, independent: 238, independent conditional: 40, independent unconditional: 198, dependent: 37, dependent conditional: 20, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 275, independent: 238, independent conditional: 40, independent unconditional: 198, dependent: 37, dependent conditional: 20, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 2, independent unconditional: 7, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 275, independent: 229, independent conditional: 38, independent unconditional: 191, dependent: 35, dependent conditional: 18, dependent unconditional: 17, unknown: 11, unknown conditional: 4, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 160, Positive conditional cache size: 21, Positive unconditional cache size: 139, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 110 TransitionsBefore, 110 TransitionsAfterwards, 998 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 545, independent: 508, independent conditional: 508, independent unconditional: 0, dependent: 37, dependent conditional: 37, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 545, independent: 508, independent conditional: 258, independent unconditional: 250, dependent: 37, dependent conditional: 5, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 545, independent: 508, independent conditional: 136, independent unconditional: 372, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 545, independent: 508, independent conditional: 136, independent unconditional: 372, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 1, 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: 7, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 545, independent: 501, independent conditional: 135, independent unconditional: 366, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 194, Positive cache size: 167, Positive conditional cache size: 22, Positive unconditional cache size: 145, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 127, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 73 PlacesBefore, 72 PlacesAfterwards, 112 TransitionsBefore, 111 TransitionsAfterwards, 1424 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 558, independent: 542, independent conditional: 542, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 558, independent: 542, independent conditional: 466, independent unconditional: 76, dependent: 16, dependent conditional: 10, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 558, independent: 542, independent conditional: 364, independent unconditional: 178, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 558, independent: 542, independent conditional: 364, independent unconditional: 178, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 11, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 558, independent: 529, independent conditional: 353, independent unconditional: 176, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 13, unknown conditional: 11, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 189, Positive conditional cache size: 33, Positive unconditional cache size: 156, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 112, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 79 PlacesBefore, 79 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 1608 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 107, independent: 98, independent conditional: 98, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 107, independent: 98, independent conditional: 62, independent unconditional: 36, dependent: 9, dependent conditional: 5, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 107, independent: 98, independent conditional: 33, independent unconditional: 65, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 107, independent: 98, independent conditional: 33, independent unconditional: 65, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 107, independent: 97, independent conditional: 33, independent unconditional: 64, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 190, Positive conditional cache size: 33, Positive unconditional cache size: 157, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 34, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 83 PlacesBefore, 83 PlacesAfterwards, 129 TransitionsBefore, 129 TransitionsAfterwards, 1216 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, independent: 69, independent conditional: 69, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 79, independent: 69, independent conditional: 45, independent unconditional: 24, dependent: 10, dependent conditional: 9, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, independent: 69, independent conditional: 27, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, independent: 69, independent conditional: 27, independent unconditional: 42, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, independent: 68, independent conditional: 27, independent unconditional: 41, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 191, Positive conditional cache size: 33, Positive unconditional cache size: 158, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 27, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 88 PlacesBefore, 87 PlacesAfterwards, 129 TransitionsBefore, 128 TransitionsAfterwards, 1230 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 338, independent: 320, independent conditional: 320, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 338, independent: 320, independent conditional: 292, independent unconditional: 28, dependent: 18, dependent conditional: 16, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 338, independent: 320, independent conditional: 256, independent unconditional: 64, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 338, independent: 320, independent conditional: 256, independent unconditional: 64, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, 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: 8, independent: 8, independent conditional: 0, independent unconditional: 8, 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: 338, independent: 312, independent conditional: 248, independent unconditional: 64, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 208, Positive conditional cache size: 41, Positive unconditional cache size: 167, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 52, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 90 PlacesBefore, 90 PlacesAfterwards, 135 TransitionsBefore, 135 TransitionsAfterwards, 1314 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 56, independent conditional: 56, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 56, independent conditional: 40, independent unconditional: 16, dependent: 9, dependent conditional: 8, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 56, independent conditional: 24, independent unconditional: 32, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 56, independent conditional: 24, independent unconditional: 32, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 55, independent conditional: 24, independent unconditional: 31, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 209, Positive conditional cache size: 41, Positive unconditional cache size: 168, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 24, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.3s, 96 PlacesBefore, 90 PlacesAfterwards, 94 TransitionsBefore, 86 TransitionsAfterwards, 794 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 219, independent: 213, independent conditional: 213, 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: 219, independent: 213, independent conditional: 183, independent unconditional: 30, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 219, independent: 213, independent conditional: 144, independent unconditional: 69, 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: 219, independent: 213, independent conditional: 144, independent unconditional: 69, 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: 29, independent: 29, independent conditional: 27, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29, independent: 29, independent conditional: 0, independent unconditional: 29, 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: 219, independent: 184, independent conditional: 117, independent unconditional: 67, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 29, unknown conditional: 27, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 341, Positive cache size: 314, Positive conditional cache size: 77, Positive unconditional cache size: 237, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 45, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.0s, 77 PlacesBefore, 73 PlacesAfterwards, 48 TransitionsBefore, 45 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 86, independent: 86, independent conditional: 86, 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: 86, independent: 86, independent conditional: 64, independent unconditional: 22, 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: 86, independent: 86, independent conditional: 43, independent unconditional: 43, 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: 86, independent: 86, independent conditional: 43, independent unconditional: 43, 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: 13, independent: 13, independent conditional: 9, 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: 13, independent: 13, independent conditional: 0, independent unconditional: 13, 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: 86, independent: 73, independent conditional: 34, independent unconditional: 39, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 13, unknown conditional: 9, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 391, Positive conditional cache size: 90, Positive unconditional cache size: 301, Negative cache size: 27, Negative conditional cache size: 8, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 66 PlacesBefore, 66 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, 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: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 5, independent conditional: 2, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 391, Positive conditional cache size: 90, Positive unconditional cache size: 301, Negative cache size: 29, Negative conditional cache size: 10, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff0_thd4; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$r_buff1_thd4; [L733] 0 _Bool x$read_delayed; [L734] 0 int *x$read_delayed_var; [L735] 0 int x$w_buff0; [L736] 0 _Bool x$w_buff0_used; [L737] 0 int x$w_buff1; [L738] 0 _Bool x$w_buff1_used; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1481; [L847] FCALL, FORK 0 pthread_create(&t1481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1481, ((void *)0), P0, ((void *)0))=-4, t1481={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L848] 0 pthread_t t1482; [L849] FCALL, FORK 0 pthread_create(&t1482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1482, ((void *)0), P1, ((void *)0))=-3, t1481={5:0}, t1482={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L850] 0 pthread_t t1483; [L851] FCALL, FORK 0 pthread_create(&t1483, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1483, ((void *)0), P2, ((void *)0))=-2, t1481={5:0}, t1482={6:0}, t1483={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L852] 0 pthread_t t1484; [L853] FCALL, FORK 0 pthread_create(&t1484, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1484, ((void *)0), P3, ((void *)0))=-1, t1481={5:0}, t1482={6:0}, t1483={7:0}, t1484={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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, z=0] [L768] 2 x$w_buff1 = x$w_buff0 [L769] 2 x$w_buff0 = 2 [L770] 2 x$w_buff1_used = x$w_buff0_used [L771] 2 x$w_buff0_used = (_Bool)1 [L772] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L772] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L773] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L774] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L775] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L776] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L777] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L778] 2 x$r_buff0_thd2 = (_Bool)1 [L781] 2 __unbuffered_p1_EAX = y [L798] 2 y = 1 [L801] 2 z = 1 [L804] 2 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L806] 2 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 [L807] 2 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L808] 2 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L818] 4 z = 2 [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=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=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L748] 1 a = 1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L784] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L785] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L786] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L788] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0: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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L754] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L755] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L756] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L757] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 3 return 0; [L824] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L825] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L826] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L827] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L828] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 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 [L862] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 x$flush_delayed = weak$$choice2 [L869] 0 x$mem_tmp = x [L870] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L878] 0 x = x$flush_delayed ? x$mem_tmp : x [L879] 0 x$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 164 locations, 7 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: 154.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 21.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 725 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 725 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1727 IncrementalHoareTripleChecker+Invalid, 1876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 37 mSDtfsCounter, 1727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1771occurred in iteration=11, InterpolantAutomatonStates: 74, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 249 NumberOfCodeBlocks, 249 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 2377 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:32:58,712 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...